发布求助
文献互助 智能选刊 最新文献

European Conference on Logics in Artificial Intelligence最新文献

筛选
英文 中文
Deterministic Weighted Automata Under Partial Observability 部分可观测性下的确定性加权自动机
European Conference on Logics in Artificial Intelligence Pub Date : 2024-03-01 DOI: 10.1007/978-3-031-43619-2_52
Jakub Michaliszyn, J. Otop
{"title":"Deterministic Weighted Automata Under Partial Observability","authors":"Jakub Michaliszyn, J. Otop","doi":"10.1007/978-3-031-43619-2_52","DOIUrl":"https://doi.org/10.1007/978-3-031-43619-2_52","url":null,"abstract":"","PeriodicalId":225087,"journal":{"name":"European Conference on Logics in Artificial Intelligence","volume":"116 9","pages":"771-784"},"PeriodicalIF":0.0,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140090719","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
How Easy it is to Know How: An Upper Bound for the Satisfiability Problem 知道如何做有多容易可满足性问题的上限
European Conference on Logics in Artificial Intelligence Pub Date : 2023-09-29 DOI: 10.1007/978-3-031-43619-2_28
C. Areces, Valentin Cassano, Pablo F. Castro, Raul Fervari, Andrés R. Saravia
{"title":"How Easy it is to Know How: An Upper Bound for the Satisfiability Problem","authors":"C. Areces, Valentin Cassano, Pablo F. Castro, Raul Fervari, Andrés R. Saravia","doi":"10.1007/978-3-031-43619-2_28","DOIUrl":"https://doi.org/10.1007/978-3-031-43619-2_28","url":null,"abstract":"","PeriodicalId":225087,"journal":{"name":"European Conference on Logics in Artificial Intelligence","volume":"27 1","pages":"405-419"},"PeriodicalIF":0.0,"publicationDate":"2023-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139334304","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Bounded Combinatorial Reconfiguration with Answer Set Programming 基于答案集规划的有界组合重构
European Conference on Logics in Artificial Intelligence Pub Date : 2023-07-20 DOI: 10.48550/arXiv.2307.10688
Yuya Yamada, Mutsunori Banbara, Katsumi Inoue, Torsten Schaub
{"title":"Bounded Combinatorial Reconfiguration with Answer Set Programming","authors":"Yuya Yamada, Mutsunori Banbara, Katsumi Inoue, Torsten Schaub","doi":"10.48550/arXiv.2307.10688","DOIUrl":"https://doi.org/10.48550/arXiv.2307.10688","url":null,"abstract":"We develop an approach called bounded combinatorial reconfiguration for solving combinatorial reconfiguration problems based on Answer Set Programming (ASP). The general task is to study the solution spaces of source combinatorial problems and to decide whether or not there are sequences of feasible solutions that have special properties. The resulting recongo solver covers all metrics of the solver track in the most recent international competition on combinatorial reconfiguration (CoRe Challenge 2022). recongo ranked first in the shortest metric of the single-engine solvers track. In this paper, we present the design and implementation of bounded combinatorial reconfiguration, and present an ASP encoding of the independent set reconfiguration problem that is one of the most studied combinatorial reconfiguration problems. Finally, we present empirical analysis considering all instances of CoRe Challenge 2022.","PeriodicalId":225087,"journal":{"name":"European Conference on Logics in Artificial Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129551912","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Robust Alternating-Time Temporal Logic 鲁棒交替时间时序逻辑
European Conference on Logics in Artificial Intelligence Pub Date : 2023-07-20 DOI: 10.48550/arXiv.2307.10885
A. Murano, D. Neider, Martin Zimmermann
{"title":"Robust Alternating-Time Temporal Logic","authors":"A. Murano, D. Neider, Martin Zimmermann","doi":"10.48550/arXiv.2307.10885","DOIUrl":"https://doi.org/10.48550/arXiv.2307.10885","url":null,"abstract":"In multi-agent system design, a crucial aspect is to ensure robustness, meaning that for a coalition of agents A, small violations of adversarial assumptions only lead to small violations of A's goals. In this paper we introduce a logical framework for robust strategic reasoning about multi-agent systems. Specifically, inspired by recent works on robust temporal logics, we introduce and study rATL and rATL*, logics that extend the well-known Alternating-time Temporal Logic ATL and ATL* by means of an opportune multi-valued semantics for the strategy quantifiers and temporal operators. We study the model-checking and satisfiability problems for rATL and rATL* and show that dealing with robustness comes at no additional computational cost. Indeed, we show that these problems are PTime-complete and ExpTime-complete for rATL, respectively, while both are 2ExpTime-complete for rATL*.","PeriodicalId":225087,"journal":{"name":"European Conference on Logics in Artificial Intelligence","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131391274","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Short Boolean Formulas as Explanations in Practice 短布尔公式在实践中的解释
European Conference on Logics in Artificial Intelligence Pub Date : 2023-07-13 DOI: 10.48550/arXiv.2307.06971
Reijo Jaakkola, T. Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander
{"title":"Short Boolean Formulas as Explanations in Practice","authors":"Reijo Jaakkola, T. Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, Miikka Vilander","doi":"10.48550/arXiv.2307.06971","DOIUrl":"https://doi.org/10.48550/arXiv.2307.06971","url":null,"abstract":"We investigate explainability via short Boolean formulas in the data model based on unary relations. As an explanation of length k, we take a Boolean formula of length k that minimizes the error with respect to the target attribute to be explained. We first provide novel quantitative bounds for the expected error in this scenario. We then also demonstrate how the setting works in practice by studying three concrete data sets. In each case, we calculate explanation formulas of different lengths using an encoding in Answer Set Programming. The most accurate formulas we obtain achieve errors similar to other methods on the same data sets. However, due to overfitting, these formulas are not necessarily ideal explanations, so we use cross validation to identify a suitable length for explanations. By limiting to shorter formulas, we obtain explanations that avoid overfitting but are still reasonably accurate and also, importantly, human interpretable.","PeriodicalId":225087,"journal":{"name":"European Conference on Logics in Artificial Intelligence","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132821091","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Formalizing Statistical Causality via Modal Logic 通过模态逻辑形式化统计因果关系
European Conference on Logics in Artificial Intelligence Pub Date : 2022-10-30 DOI: 10.48550/arXiv.2210.16751
Yusuke Kawamoto, Sato Tetsuya, Kohei Suenaga
{"title":"Formalizing Statistical Causality via Modal Logic","authors":"Yusuke Kawamoto, Sato Tetsuya, Kohei Suenaga","doi":"10.48550/arXiv.2210.16751","DOIUrl":"https://doi.org/10.48550/arXiv.2210.16751","url":null,"abstract":"We propose a formal language for describing and explaining statistical causality. Concretely, we define Statistical Causality Language (StaCL) for expressing causal effects and specifying the requirements for causal inference. StaCL incorporates modal operators for interventions to express causal properties between probability distributions in different possible worlds in a Kripke model. We formalize axioms for probability distributions, interventions, and causal predicates using StaCL formulas. These axioms are expressive enough to derive the rules of Pearl's do-calculus. Finally, we demonstrate by examples that StaCL can be used to specify and explain the correctness of statistical causal inference.","PeriodicalId":225087,"journal":{"name":"European Conference on Logics in Artificial Intelligence","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134471128","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Truth and Preferences - A Game Approach for Qualitative Choice Logic 真理与偏好——定性选择逻辑的博弈方法
European Conference on Logics in Artificial Intelligence Pub Date : 2022-09-26 DOI: 10.48550/arXiv.2209.12777
Robert Freiman, M. Bernreiter
{"title":"Truth and Preferences - A Game Approach for Qualitative Choice Logic","authors":"Robert Freiman, M. Bernreiter","doi":"10.48550/arXiv.2209.12777","DOIUrl":"https://doi.org/10.48550/arXiv.2209.12777","url":null,"abstract":"In this paper, we introduce game-theoretic semantics (GTS) for Qualitative Choice Logic (QCL), which, in order to express preferences, extends classical propositional logic with an additional connective called ordered disjunction. Firstly, we demonstrate that game semantics can capture existing degree-based semantics for QCL in a natural way. Secondly, we show that game semantics can be leveraged to derive new semantics for the language of QCL. In particular, we present a new semantics that makes use of GTS negation and, by doing so, avoids problems with negation in existing QCL-semantics.","PeriodicalId":225087,"journal":{"name":"European Conference on Logics in Artificial Intelligence","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123359835","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Solving a Multi-resource Partial-ordering Flexible Variant of the Job-shop Scheduling Problem with Hybrid ASP 用混合ASP求解多资源偏序柔性作业车间调度问题
European Conference on Logics in Artificial Intelligence Pub Date : 2021-01-25 DOI: 10.1007/978-3-030-75775-5_21
Giulia Francescutto, Konstantin Schekotihin, Mohammed M. S. El-Kholany
{"title":"Solving a Multi-resource Partial-ordering Flexible Variant of the Job-shop Scheduling Problem with Hybrid ASP","authors":"Giulia Francescutto, Konstantin Schekotihin, Mohammed M. S. El-Kholany","doi":"10.1007/978-3-030-75775-5_21","DOIUrl":"https://doi.org/10.1007/978-3-030-75775-5_21","url":null,"abstract":"","PeriodicalId":225087,"journal":{"name":"European Conference on Logics in Artificial Intelligence","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131657533","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals 实数上的概率团队语义和存在二阶逻辑的可溯性边界
European Conference on Logics in Artificial Intelligence Pub Date : 2020-12-23 DOI: 10.1007/978-3-030-75775-5_18
Miika Hannula, J. Virtema
{"title":"Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals","authors":"Miika Hannula, J. Virtema","doi":"10.1007/978-3-030-75775-5_18","DOIUrl":"https://doi.org/10.1007/978-3-030-75775-5_18","url":null,"abstract":"","PeriodicalId":225087,"journal":{"name":"European Conference on Logics in Artificial Intelligence","volume":"5 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120855752","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Tractable Combinations of Theories via Sampling 通过抽样的可处理的理论组合
European Conference on Logics in Artificial Intelligence Pub Date : 2020-12-02 DOI: 10.1007/978-3-030-75775-5_10
M. Bodirsky, Johannes Greiner
{"title":"Tractable Combinations of Theories via Sampling","authors":"M. Bodirsky, Johannes Greiner","doi":"10.1007/978-3-030-75775-5_10","DOIUrl":"https://doi.org/10.1007/978-3-030-75775-5_10","url":null,"abstract":"","PeriodicalId":225087,"journal":{"name":"European Conference on Logics in Artificial Intelligence","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132894177","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信