A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
A Human Oriented Logic for Automatic Theorem-Proving
Journal of the ACM (JACM)
Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
Journal of the ACM (JACM)
Complete Sets of Reductions for Some Equational Theories
Journal of the ACM (JACM)
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
A short survey on the state of the art in matching and unification problems
ACM SIGSAM Bulletin
Automated theorem proving: A logical basis (Fundamental studies in computer science)
Automated theorem proving: A logical basis (Fundamental studies in computer science)
On unification: Equational theories are not bounded
Journal of Symbolic Computation
An algebraic approach to unification under associativity and commutativity
Journal of Symbolic Computation
Associative-commutative unification
Journal of Symbolic Computation
History and basic features of the critical-pair/completion procedure
Journal of Symbolic Computation
Unification in combinations of collapse-free regular theories
Journal of Symbolic Computation
Complexity of matching problems
Journal of Symbolic Computation
Embedding boolean expressions into logic programming
Journal of Symbolic Computation
Only prime superpositions need be considered in the Knuth-Bendix completion procedure
Journal of Symbolic Computation
Unification in a combination of arbitrary disjoint equational theories
Journal of Symbolic Computation
Efficient solution of linear diophantine equations
Journal of Symbolic Computation
Adventures in associative-commutative unification
Journal of Symbolic Computation
Unification in Boolean Rings and Abelian Groups
Journal of Symbolic Computation
Unification in commutative theories
Journal of Symbolic Computation
Unification in permutative equational theories is undecidable
Journal of Symbolic Computation
Completion of integral polynomials by AC-term completion
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Fundamentals of Deductive Program Synthesis
IEEE Transactions on Software Engineering
Unification in commutative theories, Hilbert's basis theorem, and Gröbner bases
Journal of the ACM (JACM)
Z-module reasoning: an equality-oriented proving method with built-in ring axioms
Journal of the ACM (JACM)
On solving equations and disequations
Journal of the ACM (JACM)
Optimal unification of bound simple set-terms
CIKM '96 Proceedings of the fifth international conference on Information and knowledge management
Experiments with subdivision of search in distributed theorem proving
PASCO '97 Proceedings of the second international symposium on Parallel symbolic computation
Rewriting of rules containing set terms in a logic data language LDL
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Constraints in computational logics
On the complexity of recognizing the Hilbert basis of a linear diophantine system
Theoretical Computer Science
Array form representation of idiom recognition system for numerical programs
Proceedings of the 2001 conference on APL: an arrays odyssey
Journal of Automated Reasoning
Solution of the Robbins Problem
Journal of Automated Reasoning
Computational Complexity of Simultaneous Elementary Matching Problems
Journal of Automated Reasoning
General Algorithms for Permutations in Equational Inference
Journal of Automated Reasoning
What You Always Wanted to Know About Datalog (And Never Dared to Ask)
IEEE Transactions on Knowledge and Data Engineering
An Intelligent Tutoring System for the Dijkstra-Gries Methodology
IEEE Transactions on Software Engineering
On the Complexity of Counting the Hilbert Basis of a Linear Diophnatine System
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine System
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
LDL: A Logic-Based Data Language
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Combining Decision Procedures for Positive Theories Sharing Constructors
RTA '02 Proceedings of the 13th 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
Schema recognition for program transformations
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
On the Complexity of Deduction Modulo Leaf Permutative Equations
Journal of Automated Reasoning
Pattern matching algebraic identities
ACM SIGSAM Bulletin
Permutative rewriting and unification
Information and Computation
Alternating two-way AC-tree automata
Information and Computation
Unification and Matching Modulo Leaf-Permutative Equational Presentations
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Web Services Orchestrations Evolution: A Merge Process for Behavioral Evolution
ECSA '08 Proceedings of the 2nd European conference on Software Architecture
A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Church-rosser properties of weakly terminating term rewriting systems
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
Associative-commutative rewriting
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
Equational reasoning using AC constraints
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Linear groupoids and the associated wreath products
Journal of Symbolic Computation
Challenges for action theories
Challenges for action theories
Workflow design using fragment composition: crisis management system design through ADORE
Transactions on aspect-oriented software development VII
Workflow design using fragment composition: crisis management system design through ADORE
Transactions on aspect-oriented software development VII
Service-oriented architecture modeling: bridging the gap between structure and behavior
Proceedings of the 14th international conference on Model driven engineering languages and systems
Basis of solutions for a system of linear inequalities in integers: computation and applications
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
A provably correct compiler for efficient model checking of mobile processes
PADL'05 Proceedings of the 7th international conference on Practical Aspects of Declarative Languages
Rule-Based Constraint Programming
Fundamenta Informaticae
UNIFICATION MODULO ACI + 1 + 0
Fundamenta Informaticae
"Adore", a logical meta-model supporting business process evolution
Science of Computer Programming
| Hi-index | 0.01 |