论文信息 - Nonmonotonic Reasoning and Databases

Nonmonotonic Reasoning and Databases

A system of nonmonotonic reasoning, called subimplication, has been defined in Bossu and Siegel [1981]. In this chapter we show that it is possible to set up a logical model of databases using subimplication and two sets of stable formulas. This model allows the construction of a system for creating, updating and querying databases that is totally transparent to the user.

Pierre Siegel | Genevieve Bossu | P. Siegel | Genevieve Bossu

[1] Raymond Reiter,et al. A Logic for Default Reasoning , 1987, Artif. Intell..

[2] Roger C. Lyndon,et al. Notes on Logic , 1966 .

[3] Jack Minker,et al. Logic and Data Bases , 1978, Springer US.

[4] Jack Minker,et al. On Indefinite Databases and the Closed World Assumption , 1987, CADE.

[5] Raymond Reiter. On Closed World Data Bases , 1977, Logic and Data Bases.

[6] Robert A. DiPaola. The relational data file and the decision problem for classes of proper formulas , 1971 .

[7] J. A. Robinson,et al. A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[8] John McCarthy,et al. Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..

[9] William F. Clocksin,et al. Programming in Prolog , 1981, Springer Berlin Heidelberg.

[10] J. Leblanc. THÈSE DE 3ÈME CYCLE , 1978 .

[11] Robert A. Kowalski,et al. The Semantics of Predicate Logic as a Programming Language , 1976, JACM.