A new class of theories for which circumscription can be obtained via the predicate completion

Journal of Experimental and Theoretical Artificial Intelligence

Volumn 8, Issue 2, 1996, Pages 191-205

  Kundu, Sukhamay ^a   Chen, Jianhua ^a  

^a Louisiana State University   (United States)

Author keywords

Circumscription predicate completion finitary theory

Indexed keywords

EID: 0030532343     PISSN: 0952813X     EISSN: 13623079     Source Type: Journal    
DOI: 10.1080/095281396147456     Document Type: Article

References (15)

1. Bossu, G. and Siegel, P. (1985) Saturation, non-mono tonic reasoning and the closed world assumption. Artificial Intelligence, 25, 13-63.
2. Clark, K. L. (1978) Negation as failure, in H. Gallaireand J. M inker (eds), Logic and Databases, New York: Plenum Press, pp. 293-322.
3. Gelfond, M., Przymusinska, H. and Przymusinsky, T. (1986) The extended closed world assumption and its relationship to parallel circumscription. Proceedings of Symposium on Principles of Database Systems, Cambridge, MA, pp. 133-139.
4. Gelfond, M., Przymusinska, H. and Przymusinsksy, T. (1989) On the relationship between circumscription and negation as a failure. Artificial Intelligence, 38, 75-94.
5. Imielinski, T. (1987) Results on translating defaults to circumscription. Artificial Intelligence, 32, 131-146.
6. Kundu, S. and Chen, J. (1990) A new and simple method for explicit computation of circumscription. Proceedings of GWAI-90, German Workshop on Artificial Intelligence, September 1990, Geske, W. Germany.
7. Lifschitz, V. (1985a) Computing circumscription. Proceedings ICJAL-85, Los Angeles, CA, pp. 121-127.
8. Lifschitz, V. (1985b) Close-world databases and circumscription. Artificial Intelligence, 27, 229-235.
9. Lifschitz, V. (1986) On the satisfiability of circumscription. Artificial Intelligence, 28, 17-27.
10. McCarthy, J. (1980) Circumscription-a form of non-monotonic reasoning. Artificial Intelligence, 13, 27-39.
11. McCarthy, J. (1986) Applications of circumscription to formalizeing common-sense knowledge. Artificial Intelligence, 28, 89-116.
12. Przymusinsky, T. (1989) An algorithm to compute circumscription. Artificial Intelligence, 38, 49-73.
13. Rabinov, A. (1989) A generalization of collapsible cases of circumscription. Artificial Intelligence, 38, 111-117.
14. Reiter, R. (1982) Circumscription implies predicate completion (sometimes). Proceedings AAAI-82, Pittsburgh, PA, pp. 418-420.
15. Shepherdson, J. (1984) Negation as failure: a comparison of Clark's completed databases and Reiter's closed world assumption. Journal of Logic Programming, 1, 51-79.