On the sequential nature of unification
Journal of Logic Programming
Complete sets of unifiers and matchers in equational theories
Theoretical Computer Science
On unification: Equational theories are not bounded
Journal of Symbolic Computation
Sufficient completeness, term rewriting systems and “anti-unification”
Proc. of the 8th international conference on Automated deduction
Decidability of the purely existential fragment of the theory of term algebras
Journal of the ACM (JACM)
A general complete E-unification procedure
on Rewriting techniques and applications
Explicit representation of terms defined by counter examples
Journal of Automated Reasoning
Unification problems with one-sided distributivity
Journal of Symbolic Computation
A note on a canonical theory with undecidable unification and matching problem
Journal of Automated Reasoning
Foundations of deductive databases and logic programming
Boolean unification - The story so far
Journal of Symbolic Computation
Journal of Symbolic Computation
Equational problems anddisunification
Journal of Symbolic Computation
On equational theories, unification, and (Un)decidability
Journal of Symbolic Computation
Constrained equational reasoning
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Matching - A special case of unification?
Journal of Symbolic Computation
Complete sets of transformations for general E-unification
Theoretical Computer Science - Second Conference on Rewriting Techniques and Applications, Bordeaux, May 1987
Foundations of Equational Logic Programming
Foundations of Equational Logic Programming
An improved general E-unification method
CADE-10 Proceedings of the tenth international conference on Automated deduction
Some results on equational unification
CADE-10 Proceedings of the tenth international conference on Automated deduction
Satisfiability of systems of ordinal notations with the subterm property is decidable
Proceedings of the 18th international colloquium on Automata, languages and programming
Unification, weak unification, upper bound, lower bound, and generalization problems
RTA-91 Proceedings of the 4th international conference on Rewriting techniques and applications
Handbook of theoretical computer science (vol. B)
Handbook of theoretical computer science (vol. B)
Handbook of theoretical computer science (vol. B)
Journal of the ACM (JACM)
Logic programming with functions and predicates: the language Babel
Journal of Logic Programming
A new method for undecidability proofs of first order theories
Journal of Symbolic Computation
Complete axiomatizations of some quotient term algebras
Theoretical Computer Science
Simple LPO constraint solving methods
Information Processing Letters
Equational formulae with membership constraints
Information and Computation
Syntacticness, cycle-syntacticness, and shallow theories
Information and Computation
RTA-93 Selected papers of the fifth international conference on Rewriting techniques and applications
Tree automata help one to solve equational formulae in AC-theories
Journal of Symbolic Computation
Theorem proving with ordering and equality constrained clauses
Journal of Symbolic Computation
Information and Computation
Automata for reduction properties solving
Journal of Symbolic Computation
An automata-theoretic approach to linear temporal logic
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Languages, automata, and logic
Handbook of formal languages, vol. 3
Feature trees over arbitrary structures
Specifying syntactic structures
Completion of rewrite systems with membership constraints. Part II: constraint solving
Journal of Symbolic Computation - Special issue: order-sorted rewriting
Dynamically typed computations for order-sorted equational presentations
Journal of Symbolic Computation - Special issue: order-sorted rewriting
Term rewriting and all that
Negation elimination in empty of permutative theories
Journal of Symbolic Computation
Set constraints and logic programming
Information and Computation
Rule-based constraint programming
Fundamenta Informaticae - Special issue on foundations of constraint programming
Building constraint satisfaction problem solvers using rewrite rules and strategies
Fundamenta Informaticae - Special issue on foundations of constraint programming
A Methodological View of Constraint Solving
Constraints
Negation Elimination in Equational Formulae
MFCS '92 Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science
Incremental Construction of Unification Algorithms in Equational Theories
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Pumping, Cleaning and Symbolic Constraints Solving
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Equality and Disequality Constraints on Direct Subterms in Tree Automata
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
Solving Systems of Set Constraints using Tree Automata
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Ground Reducibility and Automata with Disequality Constraints
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Type Reconstruction with Recursive Types and Atomic Subtyping
TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Unification in Extension of Shallow Equational Theories
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
Ordering Constraints over Feature Trees Expressed in Second-Order Monadic Logic
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
Inductive Proofs by Specification Transformation
RTA '89 Proceedings of the 3rd International Conference on Rewriting Techniques and Applications
Encompassment Properties and Automata with Constraints
RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
On Narrowing, Refutation Proofs and Constraints
RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
Prototyping Combination of Unification Algorithms with the ELAN Rule-Based Programming Language
RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
A Comparison of Presburger Engines for EFSM Reachability
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Symbolic Constraints and Tree Automata
CCL '94 Proceedings of the First International Conference on Constraints in Computational Logics
ALP '94 Proceedings of the 4th International Conference on Algebraic and Logic Programming
An Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract)
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Higher-Order Matching and Tree Automata
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
RPO Constraint Solving Is in NP
Proceedings of the 12th International Workshop on Computer Science Logic
Diophantine Equations, Presburger Arithmetic and Finite Automata
CAAP '96 Proceedings of the 21st International Colloquium on Trees in Algebra and Programming
Canonical Forms and Unification
Proceedings of the 5th Conference on Automated Deduction
Universal Unification and a Classification of Equational Theories
Proceedings of the 6th Conference on Automated Deduction
Proceedings of the 7th International Conference on Automated Deduction
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
Soft Typing for Ordered Resolution
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Some new Decidability Results on Positive and Negative Set Constraints
CCL '94 Proceedings of the First International Conference on Constraints in Computational Logics
Simultaneous Rigid E-Unification and Related Algorithmic Problems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Ground Reducibility is EXPTIME-complete
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Complete sets of transformations for general unification
Complete sets of transformations for general unification
Solving systems of set constraints with negated subset relationships
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Associative commutative pattern matching
IJCAI'79 Proceedings of the 6th international joint conference on Artificial intelligence - Volume 1
Language and Automata Theory and Applications
Incremental variable splitting
Journal of Symbolic Computation
| Hi-index | 0.00 |