A Logical Study of Partial Entailment

DOI10.1613/JAIR.3117zbMATH Open1210.68108arXiv1401.3864OpenAlexW3101678617WikidataQ129518582 ScholiaQ129518582MaRDI QIDQ3068941FDOQ3068941

Authors:

Publication date: 21 January 2011

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Abstract: We introduce a novel logical notion--partial entailment--to propositional logic. In contrast with classical entailment, that a formula P partially entails another formula Q with respect to a background formula set Gamma intuitively means that under the circumstance of Gamma, if P is true then some "part" of Q will also be true. We distinguish three different kinds of partial entailments and formalize them by using an extended notion of prime implicant. We study their semantic properties, which show that, surprisingly, partial entailments fail for many simple inference rules. Then, we study the related computational properties, which indicate that partial entailments are relatively difficult to be computed. Finally, we consider a potential application of partial entailments in reasoning about rational agents.

Full work available at URL: https://arxiv.org/abs/1401.3864

Recommendations

zbMATH Keywords

computational complexity propositional logic partial entailment reasoning about rational agents

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Complexity of computation (including implicit computational complexity) (03D15)

Cited In (6)

This page was built for publication: A Logical Study of Partial Entailment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3068941)