Results on translating defaults to circumscription

Artificial Intelligence - Tập 32 - Trang 131-146 - 1987
Tomasz Imielinski1,2
1Computer Science Department, Rutgers University, New Brunswick, NJ 08903, U.S.A.
2Polish Academy of Sciences, Warsaw, Poland

Tài liệu tham khảo

Davis, 1980, The mathematics of non-monotonic reasoning, Artificial Intelligence, 13, 73, 10.1016/0004-3702(80)90013-2 Etherington, 1985, On the adequacy of predicate circumscription, Comput. Intell., 1, 11, 10.1111/j.1467-8640.1985.tb00055.x Grosof, 1984, Default reasoning as circumscription Lifschitz, 1985, Computing circumscription McCarthy, 1980, Circumscription—A form of non-monotonic reasoning, Artificial Intelligence, 13, 27, 10.1016/0004-3702(80)90011-9 McCarthy, 1986, Applications of circumscription to formalizing common-sense knowledge, Artificial Intelligence, 28, 89, 10.1016/0004-3702(86)90032-9 McDermott, 1980, Non-monotonic logic I, Artificial Intelligence, 13, 41, 10.1016/0004-3702(80)90012-0 Perlis, 1986, Completeness results for circumscription, Artificial Intelligence, 28, 29, 10.1016/0004-3702(86)90029-9 Reiter, 1978, Deductive query answering on relational databases Reiter, 1978, On closed world databases, 55 Reiter, 1980, A logic for default reasoning, Artificial Intelligence, 13, 81, 10.1016/0004-3702(80)90014-4