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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
A. R. Anderson and N.D Belnap. Entailment: The Logic of Relevance and Necessity, Vol. 1. Princeton University Press, 1975.
Samir Chopra, Rohit Parikh, and Renata Wassermann. Approximate belief revision. Logic Journal of the IGPL, 9(6):755–768, 2001.
Marco Cadoli and Marco Schaerf. Approximate inference in default logic and circumscription. Fundamenta Informaticae, 23:123–143, 1995.
Marco Cadoli and Marco Schaerf. The complexity of entailment in propositional multivalued logics. Annals of Mathematics and Artificial Intelligence, 18(1):29–50, 1996.
Marcelo Finger and Renata Wassermann. Tableaux for approximate reasoning. In Leopoldo Bertossi and Jan Chomicki, editors, IJCAI-2001 Workshop on Inconsistency in Data and Knowledge, pages 71–79, Seattle, August 6–10 2001.
M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, 1979.
A. Hunter. Reasoning with contradictory information in quasi-classical logic. Journal of Logic and Computation, 10(5):677–703, 2000.
S. C. Kleene. On a notation for ordinal numbers. Journal of Symbolic Logic, 1938.
Hector Levesque. A logic of implicit and explicit belief. In Proceedings of AAAI-84, 1984.
Marco Schaerf and Marco Cadoli. Tractable reasoning via approximation. Artificial Intelligence, 74(2):249–310, 1995.
Annette ten Teije and Frank van Harmelen. Computing approximate diagnoses by using approximate entailment. In Proceedings of KR’96, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Finger, M., Wassermann, R. (2002). Logics for Approximate Reasoning: Approximating Classical Logic “From Above”. In: Bittencourt, G., Ramalho, G.L. (eds) Advances in Artificial Intelligence. SBIA 2002. Lecture Notes in Computer Science(), vol 2507. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36127-8_3
Download citation
DOI: https://doi.org/10.1007/3-540-36127-8_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00124-9
Online ISBN: 978-3-540-36127-5
eBook Packages: Springer Book Archive