A Decision Procedure for the Existential Theory of Term Algebras with the Knuth-Bendix Ordering

Authors:
Konstantin Korovin;Andrei Voronkov
Affiliations:
-;-
Venue:
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Year:
2000

Citing 16
Cited 13

Decidability of the purely existential fragment of the theory of term algebras

Journal of the ACM (JACM)
How to choose the weights in the Knuth Bendix ordering

on Rewriting techniques and applications
Negation in logic programming

Journal of Logic Programming
Equational problems anddisunification

Journal of Symbolic Computation
Automating the Knuth Bendix ordering

Acta Informatica
Simple LPO constraint solving methods

Information Processing Letters
The first-order theory of lexicographic path orderings is undecidable

Theoretical Computer Science
Term rewriting and all that

Term rewriting and all that
The CADE-16 ATP System Competition

Journal of Automated Reasoning
Solved Forms for Path Ordering Constraints

RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
On the Use of Constraints in Automated Deduction

Selected Papers from Constraint Programming: Basics and Trends
RPO Constraint Solving Is in NP

Proceedings of the 12th International Workshop on Computer Science Logic
Ordering Constraints on Trees

CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
Vampire

CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Invited Talk: Rewrite-based Deduction and Symbolic Constraints

CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Combining superposition, sorts and splitting

Handbook of automated reasoning

Knuth-Bendix Constraint Solving Is NP-Complete

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
The Decidability of the First-Order Theory of the Knuth-Bendix Order in the Case of Unary Signatures

FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Verifying Orientability of Rewrite Rules Using the Knuth-Bendix Order

RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Algorithms, Datastructures, and other Issues in Efficient Automated Deduction

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
CCE: Testing Ground Joinability

IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Orienting rewrite rules with the Knuth--Bendix order

Information and Computation - RTA 2001
Stratified resolution

Journal of Symbolic Computation - Special issue: First order theorem proving
Constraint Solving for Term Orderings Compatible with Abelian Semigroups, Monoids and Groups

Constraints
Knuth--bendix constraint solving is NP-complete

ACM Transactions on Computational Logic (TOCL)
Decision procedures for term algebras with integer constraints

Information and Computation - Special issue: Combining logical systems
Verifying Balanced Trees

LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
The decidability of the first-order theory of knuth-bendix order

CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Decidability of term algebras extending partial algebras

CSL'05 Proceedings of the 19th international conference on Computer Science Logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show the decidability of the existential theory of term algebras with any Knuth-Bendix ordering by giving a procedure for solving Knuth-Bendix ordering constraints.