Anytime Approximations of Classical Logic from Above

In this article we present s1, a family of logics that is useful to disprove propositional formulas by means of an anytime approximation process. The systems follows the paradigm of a parameterized family of logics established by Schaerf’s and Cadoli’s system S1. We show that s1 inherits several of the nice properties of S1, while presenting several attractive new properties. The family s1 deals with the full propositional language, has a complete tableau proof system which provides for incremental approximations; furthermore, it constitutes a full approximation of classical logic from above, with an approximation process with better relevance and locality properties than S1. When applied to clausal inference, s1 provides a strong simplification method. An application of s1 to model-based diagnosis is presented, demonstrating how the solution to this problem can benefit from the use of s1 approximations.

[1]  Mukesh Dalal.  Anytime Families of Tractable Propositional Reasoners Introduction , .

[2]  Fabio Massacci.  Anytime Approximate Modal Reasoning , 1998, AAAI/IAAI.

[3]  Marcelo Finger,et al.  Approximate and Limited Reasoning: Semantics, Proof Theory, Expressivity and Control , 2004, J. Log. Comput..

[4]  Frank van Harmelen,et al.  Exploiting Domain Knowledge for Approximate Diagnosis , 1997, IJCAI.

[5]  Nils J. Nilsson,et al.  Probabilistic Logic * , 2022 .

[6]  Renata Wassermann.  Local Diagnosis , 2001, J. Appl. Non Class. Logics.

[7]  R. Smullyan.  First-Order Logic , 1968 .

[8]  Marcelo Finger,et al.  Expressivity and Control in Limited Reasoning , 2002, ECAI.

[9]  Marcelo Finger,et al.  Logics for Approximate Reasoning: Approximating Classical Logic "From Above" , 2002, SBIA.

[10]  J. Paris.  The Uncertain Reasoner's Companion: A Mathematical Perspective , 1994 .

[11]  Fabio Massacci,et al.  Anytime approximate model reasoning , 1998, AAAI 1998.

[12]  Marco Schaerf,et al.  Tractable Reasoning via Approximation , 1995, Artif. Intell..

[13]  Marcello D'Agostino,et al.  Are tableaux an improvement on truth-tables? , 1992, J. Log. Lang. Inf..

[14]  Kevin M. Knight.  Probabilistic Entailment and a Non-Probabilistic Logic , 2003, Log. J. IGPL.

[15]  Renata Wassermann,et al.  Approximate Belief Revision , 2001, Log. J. IGPL.

[16]  Nils J. Nilsson,et al.  Probabilistic Logic Revisited , 1993, Artif. Intell..

[17]  Fabio Massacci,et al.  A Proof Theory for Tractable Approximations of Propositional Reasoning , 1997, AI*IA.

[18]  Stephen Cole Kleene,et al.  On notation for ordinal numbers , 1938, Journal of Symbolic Logic.

[19]  Luca Console,et al.  Readings in Model-Based Diagnosis , 1992 .

[20]  Raymond Reiter,et al.  A Theory of Diagnosis from First Principles , 1986, Artif. Intell..

[21]  Frank van Harmelen,et al.  Computing Approximate Diagnoses By Using Approximate Entailment , 1996, KR.