Skip to main content
SpringerLink
Log in

Stratified Partial-Order Logic Programming

  • Conference paper
  • First Online:
Advances in Artificial Intelligence (Canadian AI 2001)

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

  • 1115 Accesses

Abstract

The stable semantics has become a prime candidate for knowledge representation and reasoning. The rules associated with propositional logic programs and the stable semantics are not expressive enough to let one write concise optimization programs. We propose an extension to the language of logic programs that allows one to express optimization problems in a suitable well. In earlier work we defined the declarative semantics for partial order clauses. The main contribution of our paper is the following: First, we define the language of our extended paradigm as well as its declarative semantics. Our declarative semantics is based on translating partial order clauses into normal programs and the using the stable semantics as the intended meaning of the original program. Second, we propose an operational semantics for our paradigm. Our experimental results show that our approach is more efficient than using the well known system SMODELS over the translated program.

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. Alfred V. Aho, Ravi Setvi, and Jeffrey D. Ullman. Compilers Principles, Techniques, and Tools. Addison Wesley, 1988.

    Google Scholar 

  2. Rachel Ben-Eliyahu and Rina Dechter. Propositional Semantics for Disjunctive Logic Programs. In K. R. Apt, editor, LOGIC PROGRAMMING: Proceedings of the 1992 Joint International Conference and Symposium, pages 813–827, Cambridge, Mass., November 1992. MIT Press.

    Google Scholar 

  3. D. Brand. Proving theorems with the mofication method. SIAM Journal, 4:412–430, 1975.

    Article  MATH  MathSciNet  Google Scholar 

  4. Gerd Brewka, Jürgen Dix, and Kurt Konolige. Nonmonotonic Reasoning: An Overview. CSLI Lecture Notes 73. CSLI Publications, Stanford, CA, 1997.

    MATH  Google Scholar 

  5. Michael Gelfond and Vladimir Lifschitz. The Stable Model Semantics for Logic Programming. In R. Kowalski and K. Bowen, editors, 5th Conference on Logic Programming, pages 1070–1080. MIT Press, 1988.

    Google Scholar 

  6. D. Jana and Bharat Jayaraman. Set constructors, finite sets, and logical semantics. Journal of Logic Programming, 38(1):55–77, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  7. Bharat Jayaraman. Implementation of subset-equational programs. Journal of Logic Programming, 11(4):299–324, 1992.

    Article  Google Scholar 

  8. Bharat Jayaraman and K. Moon. Subset logic programs and their implementation. Journal of Logic Programming, 41(2):71–110, 2000.

    Article  MathSciNet  Google Scholar 

  9. John W. Lloyd. Foundations of Logic Programming. Springer, Berlin, 1987. 2nd edition.

    MATH  Google Scholar 

  10. Bharat Jayaraman Mauricio Osorio and J. C. Nieves. Declarative pruning in a functional query language. In Danny De Schreye, editor, Proceedings of the International Conference on Logic Programming, pages 588–602. MIT Press, 1999.

    Google Scholar 

  11. Bharat Jayaraman Mauricio Osorio and David Plaisted. Theory of partial-order programming. Science of Computer Programming, 34(3):207–238, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  12. Mauricio Osorio. Semantics of partial-order programs. In J. Dix and L.F. del Cerro and U. Furbach, editors, Logics in Artificial Intelligence (JELIA’ 98), LNCS 1489, pages 47–61. Springer, 1998.

    Chapter  Google Scholar 

  13. Mauricio Osorio and Bharat Jayaraman. Aggregation and WFS+. In J. Dix, L. Pereira, and T. Przymusinski, editors, Nonmonotonic Extensions of Logic Programming, LNAI 1216, pages 71–90. Springer, Berlin, 1997.

    Chapter  Google Scholar 

  14. Mauricio Osorio and Bharat Jayaraman. Aggregation and negation-as-failure. New generation computing, 17(3):255–284, 1999.

    Article  MathSciNet  Google Scholar 

  15. P. Simons. Towards constraint satisfaction through logic programs and the stable model semantics. Technical Report 47, Helsinki University of Technology, Digital Systems Laboratory, August 1997.

    Google Scholar 

  16. D.R. Stinson. An introduction to the Design and Analysis of Algorithms. The Charles Babbage Research Centre, Winnipeg, Canada, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CENTIA, Universidad de las Americas, Sta. Catarina Martir, Cholula, Puebla, 72820, Mexico

    Mauricio Osorio

  2. Instituto de Electronica y Computacion, Universidad Tecnologica de la Mixteca, Huajuapan de Leon, Oaxaca, 69000, Mexico

    Juan Carlos Nieves

Authors
  1. Mauricio Osorio
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Juan Carlos Nieves
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Alberta, Edmonton, AB, Canada, T6G 2E8

    Eleni Stroulia

  2. School of Information Technology and Engineering, University of Ottawa, Ottawa, ON, Canada, K1N 6N5

    Stan Matwin

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Osorio, M., Nieves, J.C. (2001). Stratified Partial-Order Logic Programming. In: Stroulia, E., Matwin, S. (eds) Advances in Artificial Intelligence. Canadian AI 2001. Lecture Notes in Computer Science(), vol 2056. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45153-6_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-45153-6_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42144-3

  • Online ISBN: 978-3-540-45153-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation