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
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)
Proof-Search in Intuitionistic Logic Based on Constraint Satisfaction
TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
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
What You Always Wanted to Know About Rigid E-Unification
JELIA '96 Proceedings of the European Workshop on Logics in Artificial Intelligence
Simultaneous Rigid E-Unification and Related Algorithmic Problems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Equality elimination for the inverse method and extension procedures
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
What You Always Wanted to Know about Rigid E-Unification
Journal of Automated Reasoning
Herbrand's Theorem for Prenex Gödel Logic and its Consequences for Theorem Proving
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Decidable Fragments of Simultaneous Rigid Reachability
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
| Hi-index | 0.00 |