DisLoP: Towards a disjunctive logic programming system

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1265, Issue , 1997, Pages 341-352

  Aravindan, Chandrabose ^a   Dix, Jürgen ^a   Niemelä, Ilkka ^a  

^a University of Koblenz Rheinau 1 ^*  (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS;

DISJUNCTIVE LOGIC PROGRAMMING; HIGH LEVEL DESCRIPTION; RESEARCH ACTIVITIES;

LOGIC PROGRAMMING;

EID: 84946741319     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63255-7_25     Document Type: Conference Paper

References (28)

1. Chandrabose Aravindan and Peter Baumgartner. A rational and efficient algorithm for view deletion in databases. Technical Report RR-10-97, Fachbereich Informatik, Universität Koblenz-Landau, Koblenz, Germany, 1997.
2. C. Aravindan, P. Baumgartner, J. Dix, U. Furbach, G. Neugebauer, I. Niemeläi, D. Schäfer, and F. Stolzenburg. On merging theorem proving and logic programming paradigms. In M. Maher, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming, page 546, Bonn, Germany, September 1996. The MIT Press.
3. Chandrabose Aravindan and Phan Minh Dung. Knowledge base dynamics, abduction, and database updates. Journal of Applied Non-Classical Logics, 5(1):51-76, 1995. A related report is available on the web from .
4. Chandrabose Aravindan. An abductive framework for negation in disjunctive logic programming. In J. J. Alferes, L. M. Pereira, and E. Orlowska, editors, Proceedings of Joint European workshop on Logics in AI, Lecture Notes in Artificial Intelligence 1126, pages 252-267. Springer-Verlag, 1996. A related report is available on the web from .
5. Chandrabose Aravindan. DisLoP: A disjunctive logic programming system based on PROTEIN theorem prover. In G. Görz and S. Hölldobler, editors, Proc. of KI’96, Lecture Notes in Artificial Intelligence 1137, pages 19-23. Springer-Verlag, 1996.
6. Stefan Brass and Jürgen Dix. A General Approach to Bottom-Up Computation of Disjunctive Semantics. In J. Dix, L. Pereira, and T. Przymusinski, editors, Nonmonotonic Extensions of Logic Programming, LNAI 927, pages 127-155. Springer, Berlin, 1995.
7. Stefan Brass and Jürgen Dix. Disjunctive Semantics based upon Partial and Bottom-Up Evaluation. In Leon Sterling, editor, Proceedings of the 12th Int. Conf. on Logic Programming, Tokyo, pages 199-213. MIT Press, June 1995.
8. Stefan Brass and Jürgen Dix. Characterizing D-WFS: Confluence and Iterated GCWA. In L.M. Pereira J.J. Alferes and E. Orlowska, editors, Logics in Artificial Intelligence (JELIA '96), LNCS 1126, pages 268-283. Springer, 1996.
9. Stefan Brass and Jürgen Dix. Characterizations of the Disjunctive Wellfounded Semantics: Confluent Calculi and Iterated GCWA. Journal of Automated Reasoning, to appear, 1997. (Extended abstract appeared in:Characterizing D-WFS: Confluence and Iterated GCWA. Logics in Artificial Intelligence, JELIA '96, pages 268-283, 1996. Springer, LNCS 1126.).
10. Stefan Brass and Jürgen Dix. Semantics of Disjunctive Logic Programs Based on Partial Evaluation. Journal of Logic Programming, accepted for publication, 1997.
11. Stefan Brass, Jürgen Dix, Ilkka Niemelä, and Teodor. C. Przymusinski. Comparison and Efficient Computation of the Static and the Disjunctive WFS. In Gerd Brewka, Emil Weydert, and Cees Witteveen, editors, Proceedings of the third Dutch-German Workshop on Nonmonotonic Reasoning and its Applications, pages 37-42. February 1997.
12. Stefan Brass, Jürgen Dix, and Teodor. C. Przymusinski. Super Logic Programs. In L. C. Aiello, J. Doyle, and S. C. Shapiro, editors, Principles of Knowledge Representation and Reasoning: Proceedings of the Fifth International Conference (KR '96), pages 529-541. San Francisco, CA, Morgan Kanfmann, 1996.
13. P. Banmgartner and U. Furbach. Model Elimination without Contrapositives and its Application to PTTP. Journal of Automated Reasoning, 13:339-359, 1994. Short version in: Proceedings of CADE-12, Springer LNAI 814, 1994, pp 87-101.
14. P. Banmgartner and U. Furbach. PROTEIN: A PROver with a Theory Extension Interface. In A. Bundy, editor, Automated Deductzon - CADE-12, volume 814 of LNAI, pages 769-773. Springer, 1994. Available in the WWW, URL: http://www. uni-koblenz, de/ag-ki/Systems/PROTEIN/.
15. Peter Baumgartner, Peter Fröhlich, Ulrich Furbach, and Wolfgang Nejdl. Semantically Guided Theorem Proving for Diagnosis Applications. In Proc. of IJCAI '97. IJCAI, 1997. To appear.
16. Peter Banmgartner, Peter Fröhlich, Ulrich Furbach, and Wolfgang Nejdl. Tableaux for Diagnosis Applications. In Tableaux '97, LNAI. Springer, 1997. To appear.
17. Peter Baumgartner, Ulrich Furbach, and Ilkka Niemelä. Hyper tableaux. In José Júilio Alferes, Luís Moniz Pereira, and Ewa Orlowska, editors, Proceedings of the European Workshop on Logics in Artificial Intelligence (JELIA '96), pages 1-17, Évora, Portugal, September/October 1996. Springer-Verlag.
18. P. Baumgartner, U. Furbach, and F. Stolzenburg. Model Elimination, Logic Programming and Computing Answers. In 14th International Joint Conference on Artificial Intelligence (IJCAI 95), volume 1, 1995. (Long version in: Research Report 1/95, University of Koblenz, Germany. To appear in Artificial Intelligence).
19. Jürgen Dix and Frieder Stolzenburg. Computation of Non-Ground Disjunctive Well-Founded Semantics with Constraint Logic Programming (preliminary report). In J. Dix, L. Pereira, and T. Przymusinski, editors, Nonmonotonic Extensions of Logic Programming,LNAI 1216, pages 202-226. Springer, Berlin, 1997.
20. Jürgen Dix and Frieder Stolzenburg. A Framework to incorporate Nonmonotonic Reasoning into Constraint Logic Programming. Journal of Logic Programming, 1998. Special Issue on Constraint Logic Programming, Guest Editors: Kim Marriott and Peter Stuckey, to appear.
21. J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, second extended edition, 1987.
22. Jorge Lobo, Jack Minker, and Arcot Rajasekar. Foundations of disjunctive logic programming. MIT Press, 1992.
23. Jack Minker. On indefinite databases and the closed world assumption. In Lecture Notes in Computer Science 138, pages 292-308. Springer-Verlag, 1982.
24. I. Niemelä. Implementing circumscription using a tableau method. In Proceedings of the European Conference on Artificial Intelligence, pages 80-84, Budapest, Hungary, August 1996. John Wiley.
25. I. Niemelä. A tableau calculus for minimal model reasoning. In Proceedings of the Fifth Workshop on Theorem Proving wzth Analytic Tableaux and Related Methods, pages 278-294, Terrasini, Italy, May 1996. Springer-Verlag.
26. Arcot Rajasekar, Jorge Lobo, and Jack Minker. Weak generalized closed world assumption. Journal of Automated Reasoning, 5:293-307, 1989.
27. K. A. Ross and R. W. Topor. Inferring negative information from disjunctive databases. Journal of Automated Reasoning, 4(2):397-424, 1988.
28. Frieder Stolzenburg and Bernd Thomas. Analysing rule sets for the calculation of banking fees by a theorem prover with constraints. In Proceedings of the 2nd International Conference on Practical Application of Constraint Technology, pages 269-282, London, 1996. Practical Application Company.