Abstract
We present a new and simple method for explicit computation of a circumscription CIRC(T, P, Q) by constructing a set of clauses T0 such that CIRC(T, P, Q) = Th(T⋃T0). The advantage of an explicit form of CIRC(T, P, Q) is that one can apply an ordinary inferencing method to T ⋃ T0 to answer a query. The particular features of our algorithm are: (1) We show that the search for the clauses T0 can be restricted to the subset of clauses which consist of at least one negative literal in the predicates P and zero or more literals in the predicates Q. This is an improvement over the related results in [3]. (2) We do not use the equality predicate as is done in [7, 18], and (3) We compute the clauses T0 by using predicate completion [4] based on a small subset of the clauses in Th(T) which consist of at least one positive literal in P and zero or more literals in Q. We assume in this paper that the theory T is given by a set of ground clauses without function symbols.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Przymusinsky, T„ An algorithm to compute circumscription, Artificial Intelligence 38(1989), pp. 49–73.
Ginsberg, M. L., A circumscriptive theorem prover, Artificial Intelligence 39 (1989), pp. 209–230.
Gelfond, M., Przymusinska, H. and Przymusinsky, T., On the relationship between circumscription and negation as failure, Artificial Intelligence 38 (1989), pp. 75–94.
Clark, K.L., Negation as failure, in H. Gallaire and J. Minker (Eds.), Logic and Databases, Plenum Press, New York, (1978), pp. 293–322.
McCarthy, J., Circumscription — a form of non-monotonic reasoning, Artificial Intelligence 13 (1980), pp. 27–39.
McCarthy, J., Applications of circumscription to formalizing common-sense knowledge, Artificial Intelligence 28 (1986), pp. 89–116.
Lifschitz, V., Computing circumscription, Proceedings IJCAL-85, Los Angeles, CA (1985), pp. 121–127.
Lifschitz, V., Pointwise circumscription, Proceedings AAAI-86, Philadelphia, PA (1986), pp. 406–410.
Apt, K., Blair, H. and Walker, A., Towards a theory of declarative knowledge, in J. Minker (Ed.), Foundations of Deductive databases and Logic Programming Morgan Kaufmann, Los Altos, CA (1988), pp. 89–148.
Reiter, R., Circumscription implies predicate completion (sometimes), Proceedings AAAI-82, Pittsburgh, PA (1982), pp. 418–420.
Gelfond, M., Przymusinska, H. and Przymusinsky, T., The extended closed world assumption and its relationship to parallel circumscription, Proceedings of Symposium on Principles of Database Systems, Cambridge, MA (1986), pp. 133–139.
Shepherdson, J., Negation as failure: a comparison of Clark’s completed databases and Reiter’s closed world assumption, Journal of Logic programming, 1 (1984), pp. 51–79.
Lifschitz, V., Close-world databases and circumscription, Artificial Intelligence 27 (1985), pp. 229–235.
Bossu, G and Siegel, P., Saturation, non-monotonic reasoning and the closed world assumption, Artificial Intelligence 25 (1985), pp. 13–63.
Etherington, D., Mercer, R. and Reiter, R., On the adequacy of predicate circumscription for closed-world reasoning, Computational Intelligence, 1(1985), pp. 11–15.
Gelfond, M. and Przymusinska, H., On the relationship between autoepistemic logic and parallel circumscription, Proceedings of Symposium on Principles of Database Systems, Cambridge, MA (1986), pp. 133–139.
Imielinski, T., Results on translating defaults to circumscription, Artificial Intelligence 32 (1987), pp. 131–146.
Rabinov, A., A generalization of collapsible cases of circumscription, artificial Intelligence, 38(1989), pp. 111–117
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kundu, S., Chen, J. (1990). A New and Simple Method for Explicit Computation of a Circumscription. In: Marburger, H. (eds) GWAI-90 14th German Workshop on Artificial Intelligence. Informatik-Fachberichte, vol 251. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-76071-6_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-76071-6_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53132-6
Online ISBN: 978-3-642-76071-6
eBook Packages: Springer Book Archive