International Joint Conference on Automated Reasoning最新文献

Evonne: Interactive Proof Visualization for Description Logics (System Description) - Extended Version Evonne:描述逻辑的交互式证明可视化(系统描述)-扩展版

International Joint Conference on Automated Reasoning Pub Date : 2022-05-19 DOI: 10.48550/arXiv.2205.09583

C. Alrabbaa, F. Baader, Stefan Borgwardt, Raimund Dachselt, P. Koopmann, J. M'endez

引用次数: 10

Finite two-dimensional proof systems for non-finitely axiomatizable logics 非有限公理化逻辑的有限二维证明系统

International Joint Conference on Automated Reasoning Pub Date : 2022-05-18 DOI: 10.48550/arXiv.2205.08920

V. Greati, J. Martin Marcos

{"title":"Finite two-dimensional proof systems for non-finitely axiomatizable logics","authors":"V. Greati, J. Martin Marcos","doi":"10.48550/arXiv.2205.08920","DOIUrl":"https://doi.org/10.48550/arXiv.2205.08920","url":null,"abstract":"The characterizing properties of a proof-theoretical presentation of a given logic may hang on the choice of proof formalism, on the shape of the logical rules and of the sequents manipulated by a given proof system, on the underlying notion of consequence, and even on the expressiveness of its linguistic resources and on the logical framework into which it is embedded. Standard (one-dimensional) logics determined by (non-deterministic) logical matrices are known to be axiomatizable by analytic and possibly finite proof systems as soon as they turn out to satisfy a certain constraint of sufficient expressiveness. In this paper we introduce a recipe for cooking up a two-dimensional logical matrix (or B-matrix) by the combination of two (possibly partial) non-deterministic logical matrices. We will show that such a combination may result in B-matrices satisfying the property of sufficient expressiveness, even when the input matrices are not sufficiently expressive in isolation, and we will use this result to show that one-dimensional logics that are not finitely axiomatizable may inhabit finitely axiomatizable two-dimensional logics, becoming, thus, finitely axiomatizable by the addition of an extra dimension. We will illustrate the said construction using a well-known logic of formal inconsistency called mCi. We will first prove that this logic is not finitely axiomatizable by a one-dimensional (generalized) Hilbert-style system. Then, taking advantage of a known 5-valued non-deterministic logical matrix for this logic, we will combine it with another one, conveniently chosen so as to give rise to a B-matrix that is axiomatized by a two-dimensional Hilbert-style system that is both finite and analytic.","PeriodicalId":448502,"journal":{"name":"International Joint Conference on Automated Reasoning","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127294094","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

Reasoning About Vectors using an SMT Theory of Sequences 用序列的SMT理论推理向量

International Joint Conference on Automated Reasoning Pub Date : 2022-05-17 DOI: 10.48550/arXiv.2205.08095

Ying Sheng, Andres Nötzli, Andrew Reynolds, Yoni Zohar, D. Dill, W. Grieskamp, Junkil Park, S. Qadeer, Clark W. Barrett, C. Tinelli

引用次数: 3

Connection-minimal Abduction in EL via Translation to FOL - Technical Report 通过翻译到FOL的EL连接最小外展-技术报告

International Joint Conference on Automated Reasoning Pub Date : 2022-05-17 DOI: 10.48550/arXiv.2205.08449

Fajar Haifani, P. Koopmann, Sophie Tourret, Christoph Weidenbach

{"title":"Connection-minimal Abduction in EL via Translation to FOL - Technical Report","authors":"Fajar Haifani, P. Koopmann, Sophie Tourret, Christoph Weidenbach","doi":"10.48550/arXiv.2205.08449","DOIUrl":"https://doi.org/10.48550/arXiv.2205.08449","url":null,"abstract":". Abduction in description logics ﬁnds extensions of a knowledge base to make it entail an observation. As such, it can be used to explain why the observation does not follow, to repair incomplete knowledge bases, and to provide possible explanations for unexpected observations. We consider TBox abduction in the lightweight description logic EL , where the observation is a concept inclusion and the background knowledge is a TBox, i.e., a set of concept inclusions. To avoid useless answers, such problems usually come with further restrictions on the solution space and/or minimality criteria that help sort the chaﬀ from the grain. We argue that existing minimality notions are insuﬃcient, and introduce connection minimality. This criterion follows Occam’s razor by rejecting hypotheses that use concept inclusions unrelated to the problem at hand. We show how to compute a special class of connection-minimal hypotheses in a sound and complete way. Our technique is based on a translation to ﬁrst-order logic, and constructs hypotheses based on prime implicates. We evaluate a prototype implementation of our approach on ontologies from the medical domain.","PeriodicalId":448502,"journal":{"name":"International Joint Conference on Automated Reasoning","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132994152","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

Paraconsistent Gödel Modal Logic 副一致Gödel模态逻辑

International Joint Conference on Automated Reasoning Pub Date : 2022-03-02 DOI: 10.1007/978-3-031-10769-6_26

M. Bílková, S. Frittella, D. Kozhemiachenko

引用次数: 4

Actions over Core-closed Knowledge Bases 核心封闭知识库之上的行动

International Joint Conference on Automated Reasoning Pub Date : 2022-02-25 DOI: 10.1007/978-3-031-10769-6_17

Claudia Cauli, Magdalena Ortiz, Nir Piterman

引用次数: 1

Decision Problems in a Logic for Reasoning about Reconfigurable Distributed Systems 可重构分布式系统推理逻辑中的决策问题

International Joint Conference on Automated Reasoning Pub Date : 2022-02-19 DOI: 10.1007/978-3-031-10769-6_40

M. Bozga, Lucas Bueri, Radu Iosif

引用次数: 6

NP Reasoning in the Monotone $μ$-Calculus 单调$μ$-微积分中的NP推理

International Joint Conference on Automated Reasoning Pub Date : 2020-07-01 DOI: 10.1007/978-3-030-51074-9_28

D. Hausmann, Lutz Schröder

引用次数: 0

Probably Half True: Probabilistic Satisfiability over Łukasiewicz Infinitely-Valued Logic 可能半真:Łukasiewicz无穷值逻辑的概率可满足性

International Joint Conference on Automated Reasoning Pub Date : 2018-07-14 DOI: 10.1007/978-3-319-94205-6_14

M. Finger, Sandro Preto

引用次数: 6

Fort 2.0 2.0堡

International Joint Conference on Automated Reasoning Pub Date : 2018-07-14 DOI: 10.1007/978-3-319-94205-6_6

Franziska Rapp, A. Middeldorp

引用次数: 4