Advertisement

Implementing Ordered Disjunction Using Answer Set Solvers for Normal Programs

  • G. Brewka
  • Ilkka Niemelä
  • Tommi Syrjänen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2424)

Abstract

Logic programs with ordered disjunction (LPODs) add a new connective to logic programming. This connective allows us to represent alternative, ranked options for problem solutions in the heads of rules: A×B intuitively means: if possible A, but if A is not possible, then at least B. The semantics of logic programs with ordered disjunction is based on a preference relation on answer sets. In this paper we show how LPODs can be implemented using answer set solvers for normal programs. The implementation is based on a generator which produces candidate answer sets and a tester which checks whether a given candidate is maximally preferred and produces a better candidate if it is not. We also discuss the complexity of reasoning tasks based on LPODs.

Keywords

Logic Program Logic Programming Reasoning Task Preference Criterion Normal Program 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    G. Brewka, S. Benferhat, and D. Le Berre. Qualitative choice logic. In Proc. Principles of Knowledge Representation and Reasoning, KR-02, pages 158–169. Morgan Kaufmann, 2002.Google Scholar
  2. 2.
    G. Brewka. Logic programming with ordered disjunction. In Proc. 18th National Conference on Artificial Intelligence, AAAI-2002. Morgan Kaufmann, 2002.Google Scholar
  3. 3.
    T. Eiter and G. Gottlob. Propositional circumscription and extended closed-world reasoning are IIP 2-complete. Theoretical Computer Science, 114:231–245, 1993.zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365–385, 1991.CrossRefGoogle Scholar
  5. 5.
    Tomi Janhunen, Ilkka Niemelä, Patrik Simons, and Jia-Huai You. Unfolding partiality and disjunctions in stable model semantics. In Principles of Knowledge Representation and Reasoning: Proceedings of the 7th International Conference, pages 411–419. Morgan Kaufmann Publishers, April 2000.Google Scholar
  6. 6.
    Ilkka Niemelä and Patrik Simons. Extending the Smodels system with cardinality and weight constraints. In Jack Minker, editor, Logic-Based Artificial Intelligence, pages 491–521. Kluwer Academic Publishers, 2000.Google Scholar
  7. 7.
    C. Sakama and K. Inoue. An alternative approach to the semantics of disjunctive logic programs and deductive databases. Journal of Automated Reasoning, 13:145–172, 1994.zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    T. Soininen. An Approach to Knowledge Representation and Reasoning for Product Configuration Tasks. PhD thesis, Helsinki University of Technology, Finland, 2000.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • G. Brewka
    • 1
  • Ilkka Niemelä
    • 2
  • Tommi Syrjänen
    • 2
  1. 1.Institut für InformatikUniversität LeipzigLeipzigGermany
  2. 2.Helsinki University of TechnologyHUTFinland

Personalised recommendations