Order-sorted completion: the many-sorted way
TAPSOFT '89 2nd international joint conference on Theory and practice of software development
Logic programming with functions and predicates: the language Babel
Journal of Logic Programming
Lazy narrowing: strong completeness and eager variable elimination
TAPSOFT '95 Selected papers from the 6th international joint conference on Theory and practice of software development
A unified computation model for functional and logic programming
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Term rewriting and all that
A deterministic lazy narrowing calculus
Journal of Symbolic Computation
Journal of Symbolic Computation
Logicality of conditional rewrite systems
Theoretical Computer Science - Trees in algebra and programming
Journal of the ACM (JACM)
Advanced topics in term rewriting
Advanced topics in term rewriting
Solving Higher-Order Equations: From Logic to Programming
Solving Higher-Order Equations: From Logic to Programming
Standardization Theorem Revisited
ALP '96 Proceedings of the 5th International Conference on Algebraic and Logic Programming
Constructor-based conditional narrowing
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming
Conditional narrowing without conditions
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
A simple rewrite notion for call-time choice semantics
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
| Hi-index | 0.00 |
We show the completeness of the lazy conditional narrowing calculus (LCNC) with leftmost selection for the class of deterministic conditional rewrite systems (CTRSs). Deterministic CTRSs permit extra variables in the right-hand sides and conditions of their rewrite rules. From the completeness proof we obtain several insights to make the calculus more deterministic. Furthermore, and similar to the refinements developed for the unconditional case, we succeeded in removing all nondeterminism due to the choice of the inference rule of LCNC by imposing further syntactic conditions on the participating CTRSs and restricting the set of solutions for which completeness needs to be established.