A logic for object-oriented logic programming
Michael Kifer, James C. Wu · Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems · 1989
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.
Cited by 103 works. doi:10.1145/73721.73758
Authors
References
- Computers and Intractability: A Guide to the Theory of NP-Completeness
- Principles of database and knowledge-base systems
- Foundations of Logic Programming
- Principles of database and knowledge-base systems, Vol. I
- Symbolic Logic and Mechanical Theorem Proving
- Object-oriented programming: Themes and variations
- The role of frame-based representation in reasoning
- Foundations of logic programming; (2nd extended ed.)
- Modern Uses of Multiple-Valued Logic
- Login: a logic programming language with built-in inheritance