Abstract
We introduce a translation of a conditional logic semantics to a mathematical programming problem. A model of 0-1 programming is used to compute the logical consequences of a conditional knowledge base, according to a chosen default theory semantics. The key to understanding this model of mathematical programming is to regard the task of the entailment of plausible conclusions as isomorphic to an instance of weighted MAX-SAT problem. Hence, we describe the use of combinatorial optimization algorithms in the task of defeasible reasoning over conditional knowledge bases.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Colin Bell, Anil Nerode, Raymond T. Ng, and V. S. Subrahmanian. Mixed integer programming methods for computing nonmonotonic deductive databases. Journal of the ACM, 41(6):1178–1215, 1994.
Colin Bell, Anil Nerode, Raymond T. Ng, and V. S. Subrahmanian. Implementing deductive databases by mixed integer programming. ACM Transactions on Database Systems, 21(2):238–269, 1996.
V. Chandru and J. N. Hooker. Optimization Methods for Logical Inference. Series in Discrete Mathematics and Optimization. John Wiley & Sons, Inc., 1999.
Thomas Eiter and Thomas Lukasiewicz. Default reasoning from conditional knowledge bases: Complexity and tractable cases. Artificial Intelligence, 124(2):169–241, 2000.
Moises Goldszmidt and Judea Pearl. On the consistency of defeasible databases. Artificial Intelligence, 52(2):121–149, 1991.
T. Hailperin. Boole’s Logic and Probability: A Critical Exposition from Standpoint of Contemporary Algebra and Probability Theory. North Holland, Amsterdam, 1976.
John N. Hooker. A quantitative approach to logical inference. Decision Support Systems, 4:45–69, 1988.
Robert G. Jeroslow. Logic-Based Decision Support. Mixed Integer Model Formulation. Elsevier, Amsterdam, 1988.
Vadim Kagan, Anil Nerode, and V. S. Subrahmanian. Computing definite logic programs by partial instantiation. Annals of Pure and Applied Logic, 67(1-3):161–182, 1994.
J. Pearl. System Z: A natural ordering of defaults with tractable applications to nonmonotonic reasoning. In Rohit Parikh, editor, TARK: Theoretical Aspects of Reasoning about Knowledge, pages 121–136. Morgan Kaufmann, 1990.
P. Simons. Towards constraint satisfaction through logic programs and the stable model semantics. Research report A47, Helsinki University of Technology, 1997.
H. P. Williams. Fourier-Motzkin elimination extension to integer programming problems. Journal of Combinatorial Theory (A), 21:118–123, 1976.
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
Garcia, B.B., Brasil, S.M. (2002). Towards Default Reasoning through MAX-SAT. 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_6
Download citation
DOI: https://doi.org/10.1007/3-540-36127-8_6
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