论文信息 - Logics for Approximate Reasoning: Approximating Classical Logic "From Above"

Logics for Approximate Reasoning: Approximating Classical Logic "From Above"

Approximations are used for dealing with problems that are hard, usually NP-hard or coNP-hard. In this paper we describe the notion of approximating classical logic from above and from below, and concentrate in the first. We present the family s1 of logics, and show it performs approximation of classical logic from above. The family s1 can be used for disproving formulas (the SAT-problem) in a local way, concentrating only on the relevant part of a large set of formulas.

Marcelo Finger | Renata Wassermann

[1] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[3] Hector J. Levesque,et al. A Logic of Implicit and Explicit Belief , 1984, AAAI.

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

[5] Nuel D. Belnap,et al. Entailment : the logic of relevance and necessity , 1975 .

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

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

[8] Marco Schaerf,et al. Approximate Inference in Default Logic and Circumscription , 1992, Fundam. Informaticae.

[9] Anthony Hunter,et al. Reasoning with contradictory information using quasi-classical logic , 2000, J. Log. Comput..