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

Authors:
Marcelo Finger;Renata Wassermann
Affiliations:
-;-
Venue:
SBIA '02 Proceedings of the 16th Brazilian Symposium on Artificial Intelligence: Advances in Artificial Intelligence
Year:
2002

Citing 3
Cited 1

Tractable reasoning via approximation

Artificial Intelligence
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximate Inference In Default Logic And Circumscription

Fundamenta Informaticae

The universe of propositional approximations

Theoretical Computer Science - Logic, language, information and computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.