Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
On the declarative semantics of deductive databases and logic programs
Foundations of deductive databases and logic programming
F-logic: a higher-order language for reasoning about objects, inheritance, and scheme
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Object identity as a query language primitive
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Stable models and non-determinism in logic programs with negation
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Unfounded sets and well-founded semantics for general logic programs
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
An annotated bibliography on object-orientation and deduction
ACM SIGMOD Record
Logical foundations of object-oriented and frame-based languages
Journal of the ACM (JACM)
Semantics and expressiveness of disjunctive ordered logic
Annals of Mathematics and Artificial Intelligence
A Deductive Environment for Dealing with Objects and Nonmonotonic Reasoning
IEEE Transactions on Knowledge and Data Engineering
Updates in a Rule-Based Language for Objects
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
A Logical Framework for Reasoning on Data Access Control Policies
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
On properties of update sequences based on causal rejection
Theory and Practice of Logic Programming
Hi-index | 0.00 |
An extension of logic programming, called “ordered logic programming”, which includes some abstractions of the object-oriented paradigm, is presented. An ordered program consists of a number of modules (objects), where each module is composed by a number of rules possibly with negated head predicates. A sort of “isa” hierarchy can be defined among the modules in order to allow for rule inheritance. Therefore, every module sees its own rules as local rules and the rules of the other modules to which it is connected by the “isa” hierarchy as global rules. In this way, as local rules may hide global rules, it is possible to deal with default properties and exceptions. This new approach represents a novel attempt to combine the logic paradigm with the object-oriented one in knowledge base systems. Moreover, this approach provides a new ground for explaining some recent proposals of semantics for classical logic programs with negation in the rule bodies and gives an interesting semantics to logic programs with negated rule heads.