Proc. of the first international conference on Rewriting techniques and applications
Applications of circumscription to formalizing common-sense knowledge
Artificial Intelligence
Equational problems anddisunification
Journal of Symbolic Computation
Equational formulae with membership constraints
Information and Computation
Non-Horn clause logic programming
Artificial Intelligence
Induction = I-axiomatization + first-order consistency
Information and Computation - Special issue on RTA-98
Generalized Predicate Completion
KBCS '89 Proceedings of the International Conference on Knowledge Based Computer Systems
Inductive Theorem Proving by Consistency for First-Order Clauses
CTRS '92 Proceedings of the Third International Workshop on Conditional Term Rewriting Systems
Decidability Results for Saturation-Based Model Building
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Resolution-Based Model Construction for PLTL
TIME '09 Proceedings of the 2009 16th International Symposium on Temporal Representation and Reasoning
Superposition for fixed domains
ACM Transactions on Computational Logic (TOCL)
Disunification for ultimately periodic interpretations
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
CADE'11 Proceedings of the 23rd international conference on Automated deduction
CADE'11 Proceedings of the 23rd international conference on Automated deduction
| Hi-index | 0.00 |
The standard semantics of a logical program described by a set of predicative Horn clauses is minimal model semantics. To reason about negation in this context, Clark proposed to enrich the description in such a way that all Herbrand models but the minimal one are excluded. This predicate completion is used in explicit negation as failure, and also for example by Comon and Nieuwenhuis in inductive theorem proving. In this article, I extend predicate completion to a class of non-Horn clause sets. These may have several minimal models and I show how predicate completion with respect to a ground total reduction ordering singles out the same model as the model construction procedure by Bachmair and Ganzinger.