Simultaneous Rigid E-Unification and Related Algorithmic Problems

Authors:
Anatoli Degtyarev;Yuri Matiyasevich;Andrei Voronkov
Affiliations:
-;-;-
Venue:
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Year:
1996

Citing 16
Cited 5

Complexity of matching problems

Journal of Symbolic Computation
First-order modal tableaux

Journal of Automated Reasoning
Rigid E-unification: NP-completeness and applications to equational matings

Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
Rewrite systems

Handbook of theoretical computer science (vol. B)
Theorem proving using equational matings and rigid E-unification

Journal of the ACM (JACM)
The undecidability of simultaneous rigid E-unification

Theoretical Computer Science
Mechanical Theorem-Proving by Model Elimination

Journal of the ACM (JACM)
Theorem Proving via General Matings

Journal of the ACM (JACM)
An Order Theory Resolution Calculus

LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
A Complete Connection Calculus with Rigid E-Unification

JELIA '94 Proceedings of the European Workshop on Logics in Artificial Intelligence
Investigations on Equations in a Free Group

IWWERT '90 Proceedings of the First International Workshop on Word Equations and Related Topics
An Improved Method for Adding Equality to Free Variable Semantic Tableaux

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Proof-Search in Intuitionistic Logic with Equality, or Back to Simultaneous Rigid E-Unification

CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Complexity of finitely presented algebras

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Complexity of unification in free groups and free semi-groups

SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Positive first-order logic is NP-complete

IBM Journal of Research and Development

Constraint solving on terms

Constraints in computational logics
What You Always Wanted to Know about Rigid E-Unification

Journal of Automated Reasoning
Decidable Fragments of Simultaneous Rigid Reachability

ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Decidability Problems for the Prenex Fragment of Intuitionistic Logic

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Strategies in rigid-variable methods

IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

The notion of simultaneous rigid E-unification was introduced in 1987 in the area of automated theorem proving with equality in sequent-based methods, for example the connection method or the tableau method. Recently, simultaneous rigid E-unification was shown undecidable. Despite the importance of this notion, for example in theorem proving in intuitionistic logic, very little is known of its decidable fragments. We prove decidability results for fragments of monadic simultaneous rigid E-unification and show the connections between this notion and some algorithmic problems of logic and computer science.