Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
Negation as failure using tight derivations for general logic programs
Foundations of deductive databases and logic programming
On the declarative semantics of deductive databases and logic programs
Foundations of deductive databases and logic programming
Satisfiability of systems of ordinal notations with the subterm property is decidable
Proceedings of the 18th international colloquium on Automata, languages and programming
Handbook of theoretical computer science (vol. B)
Simple LPO constraint solving methods
Information Processing Letters
Oriented equational logic programming is complete
Journal of Symbolic Computation
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
A Decision Procedure for the Existential Theory of Term Algebras with the Knuth-Bendix Ordering
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
The design and implementation of VAMPIRE
AI Communications - CASC
The design and implementation of VAMPIRE
AI Communications - CASC
Reasoning support for expressive ontology languages using a theorem prover
FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
| Hi-index | 0.00 |
We introduce a calculus of stratified resolution, in which special attention is paid to clauses that "define" relations. If such clauses are discovered in the initial set of clauses, they are treated using the rule of definition unfolding, i.e. the rule that replaces defined relations by their definitions. Stratified resolution comes with a powerful notion of redundancy: a clause to which definition unfolding has been applied can be removed from the search space. To prove the completeness of stratified resolution with redundancies, we use a novel combination of Bachmair and Ganzinger's model construction technique and a hierarchical construction of orderings and least fixpoints.