Skip to main content
SpringerLink
Log in

High-Level Logic Programming

  • Conference paper
  • First Online:
Foundations of Information and Knowledge Systems (FoIKS 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1762))

Abstract

We introduce the paradigm of High-Level Logic Programming. This paradigm is the consolidation of our recent results on disjunctions, sets, partial-order clauses and aggregation. We show how these concepts are integrated in a natural way into the standard logic programming framework. For this purpose, we present several well known examples from the literature that support this claim. Our approach to define the declarative semantics of HLL (High-Level Logic) programs consists on a translation of them to datalog disjunctive programs and then to use D1-WFS-COMP.

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. J. Arrazola, J. Dix y M. Osorio. Confluent term Rewriting Systems for Non-Monotonic Reasoning. Computaciń y Sistemas, II(2–3). pp. 104–123, 1999. México.

    Google Scholar 

  2. S. Abiteboul and S. Grumbach, “A Rule-Based Language with Functions and Sets,” ACM Transactions on Database Systems, 16(1):1–30,1991.

    Article  MathSciNet  Google Scholar 

  3. C. Beeri, S. Naqvi, et al, “Sets and Negation in a Logic Database Language (LDL1),” Proc. 6th ACM Principles of Database Systems, pp. 21–37, 1987.

    Google Scholar 

  4. S. Brass, J. Dix, T. Przymusinski, “Super Logic Programs,” Proc. of the Fifth Intern. Conf. on Principles of Knowledge Repr. and Reasoning (KR’ 96), L. C. Aiello, J. Doyle and S. C. Shapiro (eds.), Morgan Kaufmann, San Francisco 1996.

    Google Scholar 

  5. Stefan Brass and Jürgen Dix. Characterizations of the Disjunctive Stable Semantics by Partial Evaluation. Journal of Logic Programming, 32(3):207–228, 1997. (Extended abstract appeared in: Characterizations of the Stable Semantics by Partial Evaluation LPNMR, Proceedings of the Third International Conference, Kentucky, pages 85–98, 1995. LNCS 928, Springer.).

    Article  MATH  MathSciNet  Google Scholar 

  6. Stefan Brass and Jürgen Dix. Characterizations of the Disjunctive Well-founded Semantics: Confluent Calculi and Iterated GCWA. Journal of Automated Reasoning, to appear, 1998. (Extended abstract appeared in: Characterizing D-WFS: Confluence and Iterated GCWA. Logics in Artificial Intelligence, JELIA’ 96, pages 268–283, 1996. Springer, LNCS 1126.).

    Google Scholar 

  7. Stefan Brass, Ulrich Zukowski, and Burkhardt Freitag. Transformation Based Bottom-Up Computation of the Well-Founded Model. In J. Dix, L. Pereira, and T. Przymusinski, editors, Nonmonotonic Extensions of Logic Programming, LNAI 1216, pages 171–201. Springer, Berlin, 1997.

    Chapter  Google Scholar 

  8. Gerhard Brewka and Jürgen Dix. Knowledge representation with logic programs. Technical report, Tutorial Notes of the 12th European Conference on Artificial Intelligence (ECAI’ 96), 1996. Also appeare d as Technical Report 15/96, Dept. of CS of the University of Koblenz-Landau. Will appear as Chapter 6 in Handbook of Philosophical Logic, 2nd edition (1998), Volume 6, Methodologies.

    Google Scholar 

  9. Keith L. Clark. Negation as Failure. In H. Gallaire and J. Minker, editors, Logic and Data-Bases, pages 293–322. Plenum, New York, 1978.

    Google Scholar 

  10. Dovier, A., Omodeo, E. G., Pontelli, E., and Rossi, G. “{log }: A Logic Programming Language with Finite Sets,” Proc. 8th International Conference of Logic Programming, pp. 111–124, Paris, June 1991.

    Google Scholar 

  11. Jürgen Dix. A Framework for Representing and Characterizing Semantics of Logic Programs. In B. Nebel, C. Rich, and W. Swartout, editors, Principles of Knowledge Representation and Reas oning: Proceedings of the Third International Conference (KR’ 92), pages 591–602. San Mateo, CA, Morgan Kaufmann, 1992.

    Google Scholar 

  12. Jürgen Dix. A Classification-Theory of Semantics of Normal Logic Programs: II. Weak Properties. Fundamenta Informaticae, XXII(3):257–288, 1995.

    MathSciNet  Google Scholar 

  13. G. Ganguly, S. Greco, and C. Zaniolo, “Minimum and maximum predicates in logic programs”, Proceedings of the ACM Symposium on Principles of Database Systems, pp 154–163, 1991.

    Google Scholar 

  14. Allen van Gelder, Kenneth A. Ross, and John S. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 38:620–650, 1991.

    Article  MATH  Google Scholar 

  15. B. Jayaraman, “Implementation of Subset-Equational Programs,” Journal of Logic Programming, 11(4):299–324, 1992.

    Article  Google Scholar 

  16. D. Jana, “Semantics of Subset-Logic Languages,” dissertation submitted to SUNY-Buffalo, 1994.

    Google Scholar 

  17. B. Jayaraman, M. Osorio and K. Moon, “Partial Order Programming (revisited)”, Proc. AMAST, Springer-Verlag, July 1995.

    Google Scholar 

  18. Jayaraman, B. and Plaisted, D. A., “Programming with Equations, Subsets, and Relations,” Proc. North American Conference of Logic Programming 89, pp. 1051–1068, Cleveland, October 1989.

    Google Scholar 

  19. Kuper, G. M., “Logic Programming with Sets,” JCSS, 41(1):44–64, 1990.

    MATH  MathSciNet  Google Scholar 

  20. J. Lloyd, “Foundations of Logic Programming,” (2 ed.) Springer-Verlag, 1987.

    Google Scholar 

  21. M. Liu., “Relationlog: A typed extension to Datalog with Sets and Tuples,” Proc. ISLP95 pp. 83–97. MIT Press. June 1995.

    Google Scholar 

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

    MATH  Google Scholar 

  23. Mauricio Osorio y B. Jayaraman Integrating the Completion and the Well Founded Semantics. Titulo del libro: Progress in Artificial Intelligence IBERAMIA 98. Ed. Springer-Verlag. ISBN 3-540-64992-1. pp 230–241. Alemania 1998.

    Google Scholar 

  24. M. Osorio and B. Jayaraman, “Aggregation and Negation as Failure”, New Genetation Computing, 17(3), 1999.

    Google Scholar 

  25. M. Osorio, B. Jayaraman and J. C. Nieves “Declarative Pruning in a Functional Query Language”, accepted ICLP99.

    Google Scholar 

  26. Mauricio Osorio, B. Jayaraman and D. Plaisted “Theory of partial-order programming,” in Science of computer programming Journal, (34)3, 1999.

    Google Scholar 

  27. M. Osorio, B. Jayaraman, “Aggregation and WFS+”, In J. Dix, L. Pereida, and T. Przymusinski, editors, Nonmonotonic Extensions of Logic Programming, LNAI 1216, pp. 71–90. Springer, Berlin 1997

    Chapter  Google Scholar 

  28. Mauricio Osorio, “Semantics of Partial order programming,” presented at JELIA98, Germany, Oct. 1998 appears in Proc. JELIA98, pp. 47–61, LNAI 1489, Springer-Verlag, 1998.

    Google Scholar 

  29. K. Ross, “Modular Stratification and Magic Sets for DATALOG Programs with negation”, Journal of the ACM, Vol. 41, No. 6, November 1994, pp. 1216–1266.

    Article  MATH  Google Scholar 

  30. K.A. Ross and Y. Sagiv, “Monotonic Aggregation in Deductive Databases,” Proc. 11th ACM Symposium on Principles of Database Systems, pp. 114–126, San Diego, 1992.

    Google Scholar 

  31. A. Van Gelder, “The Well-Founded Semantics of Aggregation,” Proc. ACM 11th Principles of Database Systems, pp. 127–138, San Diego, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universidad de las Americas, CENTIA, Sta. Catarina Martir, 72820, Cholula, Puebla, México

    Mauricio Osorio

  2. Facultad de Ciencias, Computacion, Benemerita Universidad Autonoma de Puebla, 75579, Puebla, México

    Fernando Zacarias

Authors
  1. Mauricio Osorio
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fernando Zacarias
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Technische Universität Clausthal, Julius-Albert-Str. 4, 38678, Clausthal-Zellerfeld, Germany

    Klaus-Dieter Schewe

  2. Institut für Informatik, Technische Universität Cottbus, Postfach 101344, 03013, Cottbus, Germany

    Bernhard Thalheim

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Osorio, M., Zacarias, F. (2000). High-Level Logic Programming. In: Schewe, KD., Thalheim, B. (eds) Foundations of Information and Knowledge Systems. FoIKS 2000. Lecture Notes in Computer Science, vol 1762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46564-2_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-46564-2_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67100-8

  • Online ISBN: 978-3-540-46564-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation