Skip to main content

SELP – A System for Studying Strong Equivalence Between Logic Programs

  • Conference paper
Logic Programming and Nonmonotonic Reasoning (LPNMR 2005)

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

Abstract

This paper describes a system called SELP for studying strong equivalence in answer set logic programming. The basic function of the system is to check if two given ground disjunctive logic programs are equivalent, and if not, return a counter-example. We have used the system to discover some interesting theorems about strong equivalence [Lin and Chen, 2005]. Here we briefly describe how the system can be used to find out whether a given set of rules is strongly equivalent to another, perhaps simpler set of rules.

This work was supported in part by HK RGC CERG HKUST6170/04E.

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

Access this chapter

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. Eiter, T., Fink, M.: Uniform equivalence of logic programs under the stable model semantics. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol. 2916, pp. 224–238. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  2. Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 365–385 (1991)

    Article  Google Scholar 

  3. Janhunen, T., Oikarinen, E.: Lpeq and dlpeq - translators for automated equivalence testing of logic programs. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, pp. 336–340. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  4. Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM Transactions on Computational Logic 2(4), 526–541 (2001)

    Article  MathSciNet  Google Scholar 

  5. Lin, F., Chen, Y.: Discovering classes of strongly equivalent logic programs. In: Proceedings of the Nineteenth International Joint Conference on Artifcial Intelligence, IJCAI 2005 (2005) (to appear)

    Google Scholar 

  6. Lin, F.: Reducing strong equivalence of logic programs to entailment in classical propositional logic. In: Proceedings of the Eighth International Conference on Principles of Knowledge Representation and Reasoning (KR 2002), pp. 170–176 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, Y., Lin, F., Li, L. (2005). SELP – A System for Studying Strong Equivalence Between Logic Programs. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2005. Lecture Notes in Computer Science(), vol 3662. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11546207_43

Download citation

  • DOI: https://doi.org/10.1007/11546207_43

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28538-0

  • Online ISBN: 978-3-540-31827-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics