Model generation and state generation for disjunctive logic programs

Journal of Logic Programming

Volumn 32, Issue 1, 1997, Pages 49-69

  Seipel, Dietmar ^a   Minker, Jack ^b   Ruiz, Carolina ^b,c  

^a UNIVERSITY OF WÜRZBURG   (Germany)

^b University of Maryland   (United States)

^c Worcester Polytechnic Institute   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTATIONAL METHODS; CONVERGENCE OF NUMERICAL METHODS; ITERATIVE METHODS; MATHEMATICAL MODELS;

DISJUNCTIVE LOGIC PROGRAMS; MODEL GENERATION; PERFECT MODEL SEMANTICS; STATE GENERATION;

LOGIC PROGRAMMING;

EID: 0031192271     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0743-1066(96)00116-1     Document Type: Article

References (28)

1. Bry, F. and Yahya, A., Minimal Model Generation with Unit Hyper-Resolution Tableau, in: Proceedings of the Fifth Workshop of Analytic Tableaux and Related Methods, Lecture Notes in Computer Science 1071, Springer-Verlag, Berlin/New York, 1996, pp. 143-159.
2. Davey, B. A. and Priestley, H. A., Introduction to Lattices and Order, Cambridge University Press, 1990.
3. Fernández, J. A., Disjunctive Deductive Databases, Ph.D. Thesis, University of Maryland, 1993.
4. Fernández, J. A., Lobo, J., Minker, J., and Subrahmanian, V. S., Disjunctive LP + Integrity Constraints = Stable Model Semantics, Ann. Mathematics and Artificial Intelligence 8(3/4):449-474 (1993).
5. Fernández, J. A. and Minker, J., Bottom-Up Evaluation of Hierarchical Disjunctive Deductive Databases, in: Proceedings of the Eighth International Conference on Logic Programming, MIT Press, Cambridge, MA, 1991, pp. 660-675.
6. Fernández, J. A. and Minker, J., Bottom-Up Computation of Perfect Models for Disjunctive Theories, J. Logic Programming 25(1):33-51 (1995).
7. Gelfond, M. and Lifschitz, V., The Stable Model Semantics for Logic Programming, in: Proceedings of the Fifth International Conference and Symposium on Logic Programming, MIT Press, Cambridge, MA, 1988, pp. 1070-1080.
8. Inoue, K., Koshimura, M., and Hasegawa, R., Embedding Negation as Failure into a Model Generation Theorem Prover, in: Proceedings of the International Conference on Automated Deduction, 1992, pp. 400-415.
9. Kleene, S. C., Introduction to MetaMathematics, Van Nostrand, New York, 1962.
10. Knaster, B., Un théorèm sur les fonctions d'ensembles, Annals Soc. Pol. Math. 6:133-134 (1928).
11. Lloyd, J. W., Foundations of Logic Programming, 2nd ed., Springer-Verlag, Berlin/New York, 1987.
12. Lobo, J., Minker, J., and Rajasekar, A., Foundations of Disjunctive Logic Programming, MIT Press, Cambridge, MA, 1992.
13. Loveland, D., Reed, D., and Wilson, D., SATCHMORE: SATCHMO with RElevance, J. Automated Reasoning 14:325-351 (1995).
14. Manthey, R. and Bry, F., SATCHMO: A Theorem Prover Implemented in Prolog, in: Proceedings of the Ninth Conference on Automated Deduction, 1988, pp. 456-459.
15. Minker, J., On Indefinite Databases and the Closed World Assumption, in: Proceedings of the Conference on Automated Deduction 1982, Lecture Notes in Computer Science 138, Springer-Verlag, Berlin/New York, 1982, pp. 292-308.
16. Minker, J. and Rajasekar, A., A Fixpoint Semantics for Disjunctive Logic Programs, J. Logic Programming 9(1):45-74 (1990).
17. Niemelä, I., A Tableau Calculus for Minimal Model Reasoning, in: Proceedings of the Fifth Workshop of Analytic Tableaux and Related Models, Lecture Notes in Computer Science 1071, Springer-Verlag, Berlin/New York, 1996, pp. 278-294.
18. Przymusinski, T. C., On the Declarative Semantics of Deductive Databases and Logic Programming, in: J. Minker (ed.), Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, Los Altos, CA, 1988, pp. 193-216.
19. Przymusinski, T. C., Extended Stable Semantics for Normal and Disjunctive Programs, in: Proceedings of the International Conference on Logic Programming, 1990, pp. 459-477.
20. Przymusinski, T. C., Stable Semantics for Disjunctive Programs, New Generation Computing 9:401-424 (1991).
21. Robinson, J. A., Automatic Deduction with Hyper-Resolution, Int. J. Computer Mathematics 1:227-234 (1965).
22. Ruiz, C. and Minker, J., Computing Stable and Partial Stable Models of Extended Disjunctive Logic Programs, in: J. Dix, L. M. Pereira, and T. C. Przymusinski (eds.), Nonmonotonic Extensions of Logic Programming, Lecture Notes in Computer Science 927, Springer-Verlag, Berlin/New York, 1995, pp. 205-229.
23. Seipel, D., Efficient Reasoning in Disjunctive Deductive Databases, Habilitation Thesis, University of Tübingen, 1995.
24. Seipel, D. and Güntzer, U., Mixed Fixpoint Theory for Disjunctive Deductive Data, in: Proceedings of the International Workshop on Logic Programming, 1995, pp. 227-236.
25. Seipel, D. and Thöne, H., DISLOG - A System for Reasoning in Disjunctive Deductive Databases, in: Proceedings of the International Workshop on the Deductive Approach to Information Systems and Databases, 1994, pp. 325-343.
26. Tarski, A., A Lattice-Theoretical Fixpoint Theorem and Its Applications, Pacific J. Mathematics 5:285-309 (1995).
27. van Emden, M. H. and Kowalski, R. A., The Semantics of Predicate Logic as a Programming Language, J. ACM 23(4):733-742 (1976).
28. Van Gelder, A., Ross, K. A., and Schlipff, J. S., Unfounded Sets and Well-Founded Semantics for General Logic Programs, in: Proceedings of the Seventh ACM Symposium on Principles of Database Systems, 1988, pp. 221-230.