Skip to main content
Springer Nature Link
Log in

A new abstract logic programming language and its quantifier elimination method for disjunctive logic programming

  • Conference paper
  • First Online:
Artificial Intelligence: Methodology, Systems, and Applications (AIMSA 1998)

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

Abstract

Dale Miller describes a logic programming language as an abstract logic programming language plus a quantifier elimination method. We present a new abstract logic programming language for disjunctive logic programming, extension of the SLD system: the SLOU system and a new quantifier elimination method for disjunctive logic programming, result of the combination of Robinson resolution and case-analysis: the OU-resolution method.

This research has been realized at IRISA (Rennes) (Campus de Beaulieu, F-35042 Rennes, France) and supported by an MESR grant.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.M. Andreoli and R. Pareschi. Linear objects: Logical processes with buit-in inheritance. New Generation Computing, 9, 1991.

    Google Scholar 

  2. P. Baumgartner and U. Furbach. Model Elimination Without Contrapositives. In A. Bundy, editor, Automated Deduction, CADE-12, volume 814 of LNAI, Nancy, France, June 1994.

    Google Scholar 

  3. C. Baral and M. Gelfond. Logic programming and knowledge representation. Journal of logic programming, 19, 20:73–148, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  4. W.F. Clocksin and C.S. Mellish. Programming in Prolog. Springer-Verlag, 1987.

    Google Scholar 

  5. J.H. Gallier. Logic for Computer Science. John Wiley & Sons, 1987.

    Google Scholar 

  6. R. Kowalski and M. Van Emden. The semantics of predicate logic as a programming language. JACM, 23(4):733–743, Oct. 1976.

    Article  MATH  Google Scholar 

  7. J. Lobo, J. Minker, and A. Rajasekar. Foundations of disjunctive logic programming. Logic Programming. The MIT Press, 1992.

    Google Scholar 

  8. D.W. Loveland. A simplified format for Model Elimination procedure. Jour. Assoc. Comput. Mach., 16:349–363, 1969.

    MATH  MathSciNet  Google Scholar 

  9. D.W. Loveland. Near-Horn Prolog and Beyond. Journal of Automated Reasoning, 7(1):1–25, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  10. D.A. Miller, G. Nadathur, F. Pfenning, and A. Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125–157, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  11. D.A. Miller, G. Nadathur, and A. Scedrov. Hereditary Harrop formulas and uniform proof systems. In D. Gries, editor, 2nd Symp. Logic in Computer Science, pages 98–105, Ithaca, New York, USA, 1987.

    Google Scholar 

  12. G. Nadathur and D.W. Loveland. Uniform proofs and disjunctive logic programming. Technical Report 40, Department of Computer Science, Duke University, 1994.

    Google Scholar 

  13. D.W. Reed and D.W. Loveland. Near-horn prolog and the ancestry family of procedures. Technical Report 20, Departement of Computer Science, Duke University, 1992.

    Google Scholar 

  14. J.A. Robinson. A machine-oriented logic based on the resolution principle. JACM, 12(1):23–41, 1965.

    Article  MATH  Google Scholar 

  15. I. Stéphan. Nouvelles fondations pour la programmation en logique disjonctive. PhD thesis, Université de Rennes 1, 1995.

    Google Scholar 

  16. M.E. Stickel. A Prolog technology theorem prover: a new exposition and implementation. Theorical Computer Science, 104:109–128, 1992.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculte des Sciences, LERIA, 2 boulevard Lavoisier, F-49045, Angers Cedex 01, France

    Igor Stéphan

Authors
  1. Igor Stéphan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Fausto Giunchiglia

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Stéphan, I. (1998). A new abstract logic programming language and its quantifier elimination method for disjunctive logic programming. In: Giunchiglia, F. (eds) Artificial Intelligence: Methodology, Systems, and Applications. AIMSA 1998. Lecture Notes in Computer Science, vol 1480. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0057462

Download citation

  • DOI: https://doi.org/10.1007/BFb0057462

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64993-9

  • Online ISBN: 978-3-540-49793-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics