Coping with indefinite and negative data in deductive databases: A survey

Bidoit, 1986, Positivism vs. minimalism in deductive databases, 123 Bidoit, 1987, Minimalism subsumes default logic and circumscription in stratified logic programming, 350 Bossu, 1984, Nonmonotonic reasoning and databases, Vol. 2, 239 Bossu, 1985, Saturation, nonmonotonic reasoning and the closed-world assumption, Artificial Intelligence, 25, 13, 10.1016/0004-3702(85)90040-2 Clark, 1978, Negations as failure, 293 Codd, 1970, A relational model of data for large shared data banks, Comm. ACM, 13, 377, 10.1145/362384.362685 van Emden, 1976, The semantics of predicate logic as a programming language, J. ACM, 23, 733, 10.1145/321978.321991 Etherington, 1985, On the adequacy of predicate circumscription for closed-world reasoning, Comput. Intelligence, 1, 11, 10.1111/j.1467-8640.1985.tb00055.x Frost, 1986 Gabbay, 1986, Negation as inconsistency I, J. Logic Programming, 3, 1, 10.1016/0743-1066(86)90002-6 Gallaire, 1984, Logic and databases: a deductive approach, ACM Comput. Surveys, 16, 153, 10.1145/356924.356929 Gelfond, 1986, Negation as failure: Careful Closure Procedure, Artificial Intelligence, 30, 273, 10.1016/0004-3702(86)90001-9 Grant, 1986, Answering queries in indefinite databases and the null value problem, Adv. Comput. Res., 3, 247 Levesque, 1986, Making believers out of computers, Artificial Intelligence, 30, 81, 10.1016/0004-3702(86)90068-8 Lifschitz, 1985, Closed world databases and circumscription, Artificial Intelligence, 27, 229, 10.1016/0004-3702(85)90055-4 Lifschitz, 1985, Computing circumscription, Vol. 1 Lifschitz, 1986, On the satisfiability of circumscription, Artificial Intelligence, 28, 17, 10.1016/0004-3702(86)90028-7 Lipski, 1984, Incomplete information in databases, 77 Lloyd, 1984 Lloyd, 1984, Making Prolog more expensive, J. Logic Programming, 1, 225, 10.1016/0743-1066(84)90011-6 Lloyd, 1985, A basis for deductive database systems, J. Logic Programming, 2, 93, 10.1016/0743-1066(85)90013-5 Lloyd, 1986, A basis for deductive database systems II, J. Logic Programming, 3, 55, 10.1016/0743-1066(86)90004-X Loveland, 1978 McCarthy, 1980, Circumscription — a form of non-monotonic reasoning, Artificial Intelligence, 13, 27, 10.1016/0004-3702(80)90011-9 McCarthy, 1980, Circumscription and other non-monotononic formalisms, Artificial Intelligence, 13, 171, 10.1016/0004-3702(80)90016-8 McCarthy, 1986, Applications of circumscription to formalizing common-sense knowledge, Artificial Intelligence, 28, 89, 10.1016/0004-3702(86)90032-9 Minker, 1982, On indefinite databases and the closed world assumption, 138, 292 Minker, 1984, Applications of protected circumscription Minker, 1985, Computing protected circumscription, J. Logic Programming, 2, 235, 10.1016/S0743-1066(85)80002-9 Naqvi, 1986, Some extensions to the closed-world assumption in databases Przymusinski, 1986, On the semantics of stratified deductive databases Reiter, 1978, On closed world data bases, 55 Reiter, 1982, Circumscription implies predicate completion (Sometimes), 418 Robinson, 1965, A machine-oriented logic based on the resolution principle, J. ACM, 12, 23, 10.1145/321250.321253 Vardi, 1985, Querying logical databases, 57 Yahya, 1985, Deduction in non-Horn databases, J. Automated Reasoning, 1, 141, 10.1007/BF00244994