Skip to main content
SpringerLink
Log in

Towards Default Reasoning through MAX-SAT

  • Conference paper
  • First Online:
Advances in Artificial Intelligence (SBIA 2002)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2507))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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.

    Article  MATH  MathSciNet  Google Scholar 

  2. 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.

    Article  Google Scholar 

  3. V. Chandru and J. N. Hooker. Optimization Methods for Logical Inference. Series in Discrete Mathematics and Optimization. John Wiley & Sons, Inc., 1999.

    Google Scholar 

  4. Thomas Eiter and Thomas Lukasiewicz. Default reasoning from conditional knowledge bases: Complexity and tractable cases. Artificial Intelligence, 124(2):169–241, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  5. Moises Goldszmidt and Judea Pearl. On the consistency of defeasible databases. Artificial Intelligence, 52(2):121–149, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  6. T. Hailperin. Boole’s Logic and Probability: A Critical Exposition from Standpoint of Contemporary Algebra and Probability Theory. North Holland, Amsterdam, 1976.

    MATH  Google Scholar 

  7. John N. Hooker. A quantitative approach to logical inference. Decision Support Systems, 4:45–69, 1988.

    Article  Google Scholar 

  8. Robert G. Jeroslow. Logic-Based Decision Support. Mixed Integer Model Formulation. Elsevier, Amsterdam, 1988.

    Google Scholar 

  9. 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.

    Article  MATH  MathSciNet  Google Scholar 

  10. 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.

    Google Scholar 

  11. P. Simons. Towards constraint satisfaction through logic programs and the stable model semantics. Research report A47, Helsinki University of Technology, 1997.

    Google Scholar 

  12. H. P. Williams. Fourier-Motzkin elimination extension to integer programming problems. Journal of Combinatorial Theory (A), 21:118–123, 1976.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departament of Computer Science, Universidade Federal do Espirito Santo - UFES, Av. Fernando Ferrari, s/n - CT VII, 29.060-970, Vitoria - ES, Brazil

    Berilhes Borges Garcia & Samuel M. Brasil Jr.

Authors
  1. Berilhes Borges Garcia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Samuel M. Brasil Jr.
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departamento de Automação e Sistemas, Universidade Federal de Santa Catarina, 88040-900, Florianópolis, SC, Brazil

    Guilherme Bittencourt

  2. Centro de Informática, Universidade Federal de Pernambuco, Cx. Postal 7851, 50732-970, Recife, PE, Brazil

    Geber L. Ramalho

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation