Skip to main content
SpringerLink
Log in

A Descriptive Handling of Directly Conflicting Rules in Preferred Answer Sets

  • Conference paper
  • First Online:
Declarative Programming and Knowledge Management (INAP 2013, WLP 2013, WFLP 2013)

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

  • 486 Accesses

Abstract

We consider the problem of extending the answer set semantics for logic programs with preferences on rules. Many interesting semantics have been proposed. In this paper we develop a descriptive semantics that ignores preferences between non-conflicting rules. It is based on the Gelfond-Lifschitz reduction extended by the condition: a rule cannot be removed because of a less preferred conflicting rule. It turns out that the semantics continues to be in the hierarchy of the approaches by Delgrande et al., Wang et al., and Brewka and Eiter, and guarantees existence of a preferred answer set for the class of call-consistent head-consistent extended logic programs. The semantics can be also characterized by a transformation from logic programs with preferences to logic programs without preferences such that the preferred answer sets of an original program correspond to the answer sets of the transformed program. We have also developed a prototypical solver for preferred answer sets using the meta-interpretation technique.

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 EPUB and 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

Notes

  1. 1.

    It is an idea from Proposition 6.1 from [2]. Brewka and Eiter did not consider it as a principle. On the other hand [13] did.

References

  1. Apt, K.R., Blair, H.A., Walker, A.: Towards a theory of declarative knowledge. In: Foundations of Deductive Databases and Logic Programming, pp. 89–148. Morgan Kaufmann, New York (1988)

    Google Scholar 

  2. Brewka, G., Eiter, T.: Preferred answer sets for extended logic programs. Artif. Intell. 109(1–2), 297–356 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  3. Chandra, A.K., Harel, D.: Horn clauses queries and generalizations. J. Log. Program. 2(1), 1–15 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  4. Delgrande, J.P., Schaub, T., Tompits, H.: A framework for compiling preferences in logic programs. Theory Pract. Log. Program. 3(2), 129–187 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  5. Dung, P.M.: On the relations between stable and well-founded semantics of logic programs. Theoret. Comput. Sci. 105(1), 7–25 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  6. Eiter, T., Faber, W., Leone, N., Pfeifer, G.: Computing preferred answer sets by meta-interpretation in answer set programming. Theory Pract. Log. Program. 3(4–5), 463–498 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  7. Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Gener. Comput. 9(3/4), 365–386 (1991)

    Article  Google Scholar 

  8. Illic, M., Leite, J., Slota, M.: ERASP - a system for enhancing recommendations using answer-set programming. Int. J. Reasoning-based Intell. Syst. 1, 147–163 (2009)

    Article  Google Scholar 

  9. Kunen, K.: Signed data dependencies in logic programs. J. Log. Program. 7(3), 231–245 (1989)

    Article  MathSciNet  Google Scholar 

  10. Sakama, C., Inoue, K.: Prioritized logic programming and its application to commonsense reasoning. Artif. Intell. 123(1–2), 185–222 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  11. Sato, T.: On consistency of first-order logic programs. Technical report TR 87–12, ETL (1987)

    Google Scholar 

  12. Schaub, T., Wang, K.: A semantic framework for preference handling in answer set programming. Theory Pract. Log. Program. 3(4–5), 569–607 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  13. Šefránek, J.: Preferred answer sets supported by arguments. In: Proceedings of 12th International Workshop on Non-Monotonic Reasoning (NMR 2008), pp. 232–240 (2008)

    Google Scholar 

  14. Turner, H.: Signed logic programs. In: Logic Programming: Proceedngs of the 1994 International Symposium (ILPS’94), pp. 61–75 (1994)

    Google Scholar 

  15. Šimko, A.: Logic programming with preferences on rules. Technical report TR-2013-035, Comenius University in Bratislava (2013). http://kedrigern.dcs.fmph.uniba.sk/reports/display.php?id=50

  16. Šimko, A.: Meta-interpreter for logic programs with preferences on rules, April 2013. http://dai.fmph.uniba.sk/~simko/lpp/

  17. Wang, K., Zhou, L., Lin, F.: Alternating fixpoint theory for logic programs with priority. In: Palamidessi, C., et al. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 164–178. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  18. Zhang, Y., Foo, N.Y.: Answer sets for prioritized logic programs. In: Proceedings of the 1997 International Logic Programming Symposium (ILPS’97), pp. 69–83 (1997)

    Google Scholar 

  19. Zhang, Y., Foo, N.Y.: Towards generalized rule-based updates. In: Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, IJCAI 97 (1997)

    Google Scholar 

Download references

Acknowledgement

We would like to thank the anonymous reviewers for detailed and useful comments. This work was supported by the grant UK/276/2013 of Comenius University in Bratislava and 1/1333/12 of VEGA.

Author information

Authors and Affiliations

  1. Comenius University in Bratislava, 842 48, Bratislava, Slovakia

    Alexander Šimko

Authors
  1. Alexander Šimko
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alexander Šimko .

Editor information

Editors and Affiliations

  1. Universität Kiel, Kiel, Germany

    Michael Hanus

  2. CRACS & INESC-Porto LA, University of Porto, Porto, Portugal

    Ricardo Rocha

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Šimko, A. (2014). A Descriptive Handling of Directly Conflicting Rules in Preferred Answer Sets. In: Hanus, M., Rocha, R. (eds) Declarative Programming and Knowledge Management. INAP WLP WFLP 2013 2013 2013. Lecture Notes in Computer Science(), vol 8439. Springer, Cham. https://doi.org/10.1007/978-3-319-08909-6_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-08909-6_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-08908-9

  • Online ISBN: 978-3-319-08909-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation