A logic for object-oriented logic programming
Authors:
Open Access
- 29 March 1989
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 379-393
Abstract
We present a logic for reasoning about complex objects, which is a revised and significantly extended version of Maier's O-logic [Mai86]. The logic naturally supports complex objects, object identity, deduction, is tolerant to inconsistent data, and has many other interesting features. It elegantly combines the object-oriented and value-oriented paradigms and, in particular, contains all of the predicate calculus as a special case. Our treatment of sets is also noteworthy: it is more general than ELPS [Kup87] and COL [AbG87], yet it avoids the semantic problems encountered in LDL [BNS87]. The proposed logic has a sound and complete resolution-based proof procedure.Keywords
This publication has 15 references indexed in Scilit:
- O2, an object-oriented data model1988
- ON SAFETY, DOMAIN INDEPENDENCE, AND CAPTURABILITY OF DATABASE QUERIES* (Preliminary Report)*Research sponsored in part by the NSF grant DCR-8603676.1988
- On first-order-logic databasesACM Transactions on Database Systems, 1987
- Database theory—past and future1987
- Login: a logic programming language with built-in inheritanceThe Journal of Logic Programming, 1986
- The role of frame-based representation in reasoningCommunications of the ACM, 1985
- A calculus for complex objects1985
- A new approach to database logic1984
- Horn clauses and database dependenciesJournal of the ACM, 1982
- The decision problem for database dependenciesInformation Processing Letters, 1981