Combining closed world assumptions with stable negation

Fundamenta Informaticae

Volumn 32, Issue 2, 1997, Pages 163-181

  Ruiz, Carolina ^a   Minker, Jack ^b  

^a Worcester Polytechnic Institute   (United States)

^b University of Maryland ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 8344254301     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-1997-32205     Document Type: Article

References (30)

1. K.R. Apt and H.A. Blair. Arithmetic classification of perfect models of stratified programs. Fundamenta Informaticae, XIII:1-18, 1990. With addendum in vol. XIV: 339-343. 1991.
2. 3: A logic programming language with multiple default negations. In Proceedings of the Fifth International Symposium on AI, Dec. 1992.
3. C. Baral and M. Gelfond. Logic programming and knowledge representation. Journal of Logic Programming, 19/20:73-148, May/Jun 1994.
4. N. Bidoit. Negation in rule-based data languages: A survey. Theoretical Computer Science., 78, 1991.
5. 0-complete. Technical Report TR-89-036, Computer Science Dept. Univ. of North Carolina, 1989.
6. J.A. Fernández. Disjunctive Deductive Databases. PhD thesis, University of Maryland, College Park, MD 20742, USA, Dept. of Computer Science, Jan. 1994.
7. J.A. Fernández, J. Lobo, J. Minker, and V.S. Subrahmanian. Disjunctive lp + integrity constrains = stable model semantics. Annals of Mathematics and Artificial Intelligence, 8(3-4):449-474, 1993.
8. J. A. Fernández and J. Minker. Bottom-up evaluation of hierarchical disjunctive deductive databases. In Proceedings of the Eighth Intl. Conference on Logic Programming, pages 660-675. The MIT Press, 1991.
9. J. A. Fernández and J. Minker. Bottom-up computation of perfect models for disjunctive theories. Journal of Logic Programming, 25(1):33-51, December 1995.
10. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In R. Kowalski and K. Bowen, editors, Proceedings of the Fifth International Conference and Symposium on Logic Programming, pages 1070-1080, Seattle, WA, USA, Aug. 1988. The MIT Press.
11. M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365-385, 1991.
12. J. Lobo, J. Minker, and A. Rajasekar. Foundations of Disjunctive Logic Programming. The MIT Press, 1992.
13. J. McCarthy. Circumscription - a form of non-monotonic reasoning. Artificial Intelligence Journal, 13:27-39, 1980.
14. J. Minker. On indefinite databases and the closed world assumption. In Proceedings of the Sixth Conference on Automated Deduction, pages 292-308, 1982. Also in: Lecture Notes in Computer Science 138, pages 292-308. Springer Verlag, 1982.
15. J. Minker. On indefinite databases and the closed world assumption. In Proceedings of the Sixth Conference on Automated Deduction, pages 292-308, 1982. Also in: Lecture Notes in Computer Science 138, pages 292-308. Springer Verlag, 1982.
16. J. Minker and C. Ruiz. On extended disjunctive logic programs. In J. Komorowski and Z.W. Raś, editors, Proceedings of the Seventh International Symposium on Methodologies for Intelligent Systems, ISMIS'93, pages 1-18. Lecture Notes in AI. Springer-Verlag, June 1993.
17. J. Minker and C. Ruiz. Semantics for disjunctive logic programs with explicit and default negation. Fundamenta Informaticae, 20(3/4): 145-192, 1994. Anniversary Issue edited by H. Rasiowa.
18. J. Minker and C. Ruiz. Mixing a default rule with stable negation. In Proceedings of the Fourth International Symposium on Artificial Intelligence and Mathematics, pages 122-125, Jan. 1996.
19. J. Minker and C. Ruiz. Logic knowledge bases with two default rules. Annals of Mathematics and Artificial Intelligence, 1997. To appear.
20. T.C. Przymusinski. Perfect model semantics. In R. Kowalski and K. Bowen, editors, Proceedings of the Fifth International Conference and Symposium on Logic Programming, pages 1081-1096, Seattle, WA, USA, Aug. 1988. The MIT Press.
21. T.C. Przymusinski. Extended stable semantics for normal and disjunctive programs. In D.H.D. Warren and P. Szeredi, editors, Proceedings of the Seventh International Conference on Logic Programming, pages 459-477, Jerusalem, Israel, June 1990. The MIT Press.
22. T. C. Przymusinski. Stable semantics for disjunctive programs. New Generation Computing, 9:401-424, 1991.
23. R. Reiter. On closed world data bases. In H. Gallaire and J. Minker, editors, Logic and Data Bases, pages 55-76. Plenum, New York, 1978.
24. R. Reiter. A logic for default reasoning. Artificial Intelligence Journal, 13:81-132, 1980.
25. A. Rajasekar, J. Lobo, and J. Minker. Weak generalized closed world assumption. Journal of Automated Reasoning, 5:293-307, 1989.
26. A. Rajasekar and J. Minker. On stratified disjunctive programs. Annals of Mathematics and Artificial Intelligence, 1:339-357, 1990.
27. K. A. Ross and R. W. Topor. Inferring negative information from disjunctive databases. Journal of Automated Reasoning, 4(2):397-424, December 1988.
28. C. Ruiz. Semantics of Knowledge Based Systems with Multiple Forms of Negation. PhD thesis, Department of Computer Science. University of Maryland, College Park, MD 20742 USA, Aug. 1996.
29. D. Seipel, J. Minker, and C. Ruiz. Model generation and state generation for disjunctive logic programs. Journal of Logic Programming, 32(1):48-69, July 1997.
30. M.H. van Emden and R.A. Kowalski. The semantics of predicate logic as a programming language. Journal of the ACM, 23(4):733-742, 1976.