Skip to main content
SpringerLink
Log in

DisLoP: A disjunctive logic programming system based on PROTEIN theorem prover

  • Conference paper
  • First Online:
KI-96: Advances in Artificial Intelligence (KI 1996)

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

Included in the following conference series:

Abstract

In this paper, we describe a disjunctive logic programming system, referred to as DisLoP, based on PROTEIN theorem prover. PROTEIN supports certain theorem proving calculi, such as restart model elimination and hyper tableaux, that are suitable for working with positive disjunctive logic programs. In particular, restart model elimination calculus is answer complete for postive queries. The DisLoP project started at this point with the aim of extending this further to minimal model reasoning and query processing wrt normal disjunctive logic programming too. The first phase of the project is complete and DisLoP can now perform minimal model reasoning with positive disjunctive logic programs, using both bottom-up and top-down strategies.

The author is not the only one involved in this project and is just reporting the work done by all members of DisLoP project. More information on this project can be obtained from the web site <http://www.uni-koblenz.de/ag-ki/DLP/>

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.

Similar content being viewed by others

References

  1. Aravindan, C: An abductive framework for negation in disjunctive logic programming. Technical Report 9-96, Universität Koblenz-Landau, Koblenz, Germany, 1996. (to appear in proc. of JELIA'96)

    Google Scholar 

  2. Baumgartner, P.: Refinements of theory model elimination and a variant without contrapositives. In: A.G. Cohn (ed.), Proc. of ECAI '94, Wiley, 1994.

    Google Scholar 

  3. Baumgartner, P., Furbach, U.: PROTEIN: A PROver with a Theory Extension/INterface. In: A. Bundy (ed.), Proc. of CADE-12, LNAI 814, Springer-Verlag, 1994, pp. 769–773.

    Google Scholar 

  4. Baumgartner, P., Furbach, U.: Model elimination without contrapositives and its application to PTTP. Journal of automated reasoning, 13:339–359, 1994.

    Google Scholar 

  5. Baumgartner, P., Furbach, U., Niemelä, I.: Hyper Tableau. Technical Report 8-96, Universität Koblenz-Landau, Koblenz, Germany, 1996. (to appear in proc. of JELIA'96)

    Google Scholar 

  6. Baumgartner, P., Furbach, U., Stolzenburg, F.: Model elimination, Logic programming, and Computing answers. In: Proc. of IJCAI '95, Vol. 1, 1995. (to appear in Artificial Intelligence)

    Google Scholar 

  7. Baumgartner, P., Stolzenburg, F.: Constraint model elimination and a PTTP implementation. In: Proc. of the 4th workshop on theorem proving with analytic tableaux and related methods, LNAI 918, Springer-Verlag, 1995, pp. 201–216.

    Google Scholar 

  8. Brass, S., Dix, J.: Disjunctive semantics based upon partial and bottom-up evaluation. In: Proc. of the 12th int. conf. on logic programming, MIT Press, 1995, pp. 199–213.

    Google Scholar 

  9. Brass, S., Dix, J.: Characterizing D-WFS: Confluence and iterated GCWA. To appear in proc. of JELIA'96.

    Google Scholar 

  10. Brass, S., Dix, J., Przymusinski, T.: Characterizations and implementation of static semantics of disjunctive programs. Technical report 4-96, Universität Koblenz-Landau, Koblenz, Germany, 1996.

    Google Scholar 

  11. Lobo, J., Minker, J., Rajasekar, A.: Foundations of disjunctive logic programming. MIT Press, 1992.

    Google Scholar 

  12. Niemelä, I.: A tableau calculus for minimal model reasoning. In: Proc. of the 5th workshop on theorem proving with analytic tableaux and related methods, LNAI 1071, Springer-Verlag, 1996, pp. 278–294.

    Google Scholar 

  13. Niemelä, I.: Implementing circumscription using a tableau calculus. Technical report 6-96, Universität Koblenz-Landau, Koblenz, Germany, 1996. (to appear in proc. of ECAI '96)

    Google Scholar 

  14. Przymusinski, T.: Static semantics for normal and disjunctive logic programs. Annals of mathematics and artificial intelligence, Special issue on disjunctive programs, 1995.

    Google Scholar 

  15. Smullyan, R. M.: First-Order Logic. Springer-Verlag, 1968.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, Universität Koblenz-Landau, Rheinau 1, D-56075, Koblenz, Germany

    Chandrabose Aravindan

Authors
  1. Chandrabose Aravindan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Günther Görz Steffen Hölldobler

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aravindan, C. (1996). DisLoP: A disjunctive logic programming system based on PROTEIN theorem prover. In: Görz, G., Hölldobler, S. (eds) KI-96: Advances in Artificial Intelligence. KI 1996. Lecture Notes in Computer Science, vol 1137. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61708-6_42

Download citation

  • DOI: https://doi.org/10.1007/3-540-61708-6_42

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61708-2

  • Online ISBN: 978-3-540-70669-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation