Theoretical Computer Science
Orderings for term-rewriting systems
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Mixing abstract and concrete modules: specification, development and prototyping
ICSE '90 Proceedings of the 12th international conference on Software engineering
On word problems in horn theories
Journal of Symbolic Computation
Deductive and inductive synthesis of equational programs
Journal of Symbolic Computation - Special issue on automatic programming
Higher-order equational logic programming
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Functional and constraint logic programming
Constraints in computational logics
On a Generalised Logicality Theorem
AISC '02/Calculemus '02 Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation
Operational termination of conditional term rewriting systems
Information Processing Letters
Simultaneous checking of completeness and ground confluence for algebraic specifications
ACM Transactions on Computational Logic (TOCL)
Ordering-based strategies for horn clauses
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Operational termination of conditional term rewriting systems
Information Processing Letters
Termination Of Term Rewriting By Semantic Labelling
Fundamenta Informaticae
Contextual Rewriting In Automated Reasoning
Fundamenta Informaticae
| Hi-index | 0.00 |
In the field of conditional term rewriting systems, the reduction of a given term involves recursive reduction of the premises of the rule currently applied, which leads to intractability, In this paper, we introduce simplifying systems, that allow to control this recursivity. Our approach enables the extension of several results for non-conditional rewriting to the conditional fmmework. In particular, we obtain results about the correctness of evaluation procedures, unification in conditional theories, termination and confluence, together with Knuth-Bendix theorem proving methods. Finally, the extension of such results to fully general conditional systems is discussed.