Paliath Narendran

Proceedings of the Frontiers of Combining Systems - 12th International Symposium, 2019

Unification Modulo Lists with Reverse Relation with Certain Word Equations.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction - CADE 27, 2019

Asymmetric Unification and Disunification.

[BibT_eX]

[DOI]

Veena Ravishankar

Kimberly A. Cornell

Proceedings of the Description Logic, Theory Combination, and All That, 2019

2017

On Problems Dual to Unification.

[BibT_eX]

[DOI]

Zümrüt Akçam

Daniel S. Hono II

CoRR, 2017

2016

Lynch-Morawska Systems on Strings.

[BibT_eX]

[DOI]

Daniel S. Hono II

Rafael Veras

CoRR, 2016

Notes on Lynch-Morawska Systems.

[BibT_eX]

[DOI]

CoRR, 2016

2015

On Unification Modulo One-Sided Distributivity: Algorithms, Variants and Asymmetry.

[BibT_eX]

[DOI]

Catherine A. Meadows

Log. Methods Comput. Sci., 2015

Unification and Matching in Hierarchical Combinations of Syntactic Theories.

[BibT_eX]

[DOI]

Proceedings of the Frontiers of Combining Systems - 10th International Symposium, 2015

2014

Foreword to the special issue on security and rewriting techniques.

[BibT_eX]

[DOI]

Steve Kremer

Inf. Comput., 2014

Obituary Robert McNaughton 1924 - 2014.

[BibT_eX]

[DOI]

John Corcoran

Wolfgang Thomas

Bull. EATCS, 2014

Unification modulo a 2-sorted Equational theory for Cipher-Decipher Block Chaining.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2014

Theories of Homomorphic Encryption, Unification, and the Finite Variant Property.

[BibT_eX]

[DOI]

Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming, 2014

On Asymmetric Unification and the Combination Problem in Disjoint Theories.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2014

2013

Hierarchical Combination of Unication Algorithms (Extended Abstract).

[BibT_eX]

[DOI]

Shreyaben Brahmakshatriya

Proceedings of the 27th International Workshop on Unification, 2013

Unication Problems Modulo a Theory of Until.

[BibT_eX]

[DOI]

Sushma Danturi

Kimberly A. Gero

Proceedings of the 27th International Workshop on Unification, 2013

On Forward Closure and the Finite Variant Property.

[BibT_eX]

[DOI]

Proceedings of the Frontiers of Combining Systems, 2013

Hierarchical Combination.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction - CADE-24, 2013

Asymmetric Unification: A New Unification Paradigm for Cryptographic Protocol Analysis.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction - CADE-24, 2013

2012

Unification Modulo Homomorphic Encryption.

[BibT_eX]

[DOI]

J. Autom. Reason., 2012

Unification Modulo Chaining.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2012

Effective Symbolic Protocol Analysis via Equational Irreducibility Conditions.

[BibT_eX]

[DOI]

Proceedings of the Computer Security - ESORICS 2012, 2012

New Algorithms for Unification Modulo One-Sided Distributivity and Its Variants.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning - 6th International Joint Conference, 2012

Some Notes on Basic Syntactic Mutation.

[BibT_eX]

[DOI]

Kimberly A. Gero

Christopher Bouchard

Proceedings of the UNIF 2012 Post-Worskhop Proceedings. The 26th International Workshop on Unification, 2012

The use of types in designing unification algorithms: two case studies.

[BibT_eX]

[DOI]

Serdar Erbatur

Santiago Escobar

Proceedings of the UNIF 2012 Post-Worskhop Proceedings. The 26th International Workshop on Unification, 2012

Unification Modulo Synchronous Distributivity.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning - 6th International Joint Conference, 2012

2011

Unification over Distributive Exponentiation (Sub)Theories.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2011

String Rewriting and Security Analysis: An Extension of a Result of Book and Otto.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2011

Protocol analysis in Maude-NPA using unification modulo homomorphic encryption.

[BibT_eX]

[DOI]

Proceedings of the 13th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2011

2010

On the Complexity of the Tiden-Arnborg Algorithm for Unification modulo One-Sided Distributivity

[BibT_eX]

[DOI]

Bibhu Mahapatra

Proceedings of the Proceedings 24th International Workshop on Unification, 2010

Unification modulo a partial theory of exponentiation

[BibT_eX]

[DOI]

Proceedings of the Proceedings 24th International Workshop on Unification, 2010

Cap unification: application to protocol security modulo homomorphic encryption.

[BibT_eX]

[DOI]

Proceedings of the 5th ACM Symposium on Information, 2010

2009

On Extended Regular Expressions.

[BibT_eX]

[DOI]

Benjamin Carle

Proceedings of the Language and Automata Theory and Applications, 2009

2008

Unification and Matching Modulo Leaf-Permutative Equational Presentations.

[BibT_eX]

[DOI]

Thierry Boy de la Tour

Mnacho Echenim

Proceedings of the Automated Reasoning, 4th International Joint Conference, 2008

2007

Intruders with Caps.

[BibT_eX]

[DOI]

Proceedings of the Term Rewriting and Applications, 18th International Conference, 2007

2005

Closure properties and decision problems of dag automata.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2005

A Unification Algorithm for Analysis of Protocols with Blinded Signatures.

[BibT_eX]

[DOI]

Lida Wang

Proceedings of the Mechanizing Mathematical Reasoning, 2005

2004

Unification Modulo <i>ACUI</i> Plus Distributivity Axioms.

[BibT_eX]

[DOI]

J. Autom. Reason., 2004

2003

Deciding the confluence of ordered term rewrite systems.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2003

An E-unification Algorithm for Analyzing Protocols That Use Modular Exponentiation.

[BibT_eX]

[DOI]

Lida Wang

Proceedings of the Rewriting Techniques and Applications, 14th International Conference, 2003

ACID-Unification Is NEXPTIME-Decidable.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

Unification Modulo ACU I Plus Homomorphisms/Distributivity.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction - CADE-19, 19th International Conference on Automated Deduction Miami Beach, FL, USA, July 28, 2003

2002

Guest Editorial.

[BibT_eX]

[DOI]

Inf. Comput., 2002

2001

Unification of Concept Terms in Description Logics.

[BibT_eX]

[DOI]

Franz Baader

J. Symb. Comput., 2001

Unification Theory.

[BibT_eX]

[DOI]

Franz Baader

Wayne Snyder

Manfred Schmidt-Schauß

Klaus U. Schulz

Proceedings of the Handbook of Automated Reasoning (in 2 volumes), 2001

2000

Decidability and complexity of simultaneous rigid E-unification with one variable and related results.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Book review: Term Rewriting and all that by Franz Baader and Tobias Nipkow (Cambridge Univ . Press, 313 pages).

[BibT_eX]

[DOI]

SIGACT News, 2000

Complexity of Nilpotent Unification and Matching Problems.

[BibT_eX]

[DOI]

Qing Guo

David A. Wolfram

Inf. Comput., 2000

The Theory of Total Unary RPO Is Decidable.

[BibT_eX]

[DOI]

Proceedings of the Computational Logic, 2000

1998

Equational Unification, Word Unification, and 2nd-Order Equational Unification.

[BibT_eX]

[DOI]

Daniel J. Dougherty

Theor. Comput. Sci., 1998

Unification and Matching in Process Algebras.

[BibT_eX]

[DOI]

Qing Guo

Sandeep K. Shukla

Proceedings of the Rewriting Techniques and Applications, 9th International Conference, 1998

The Decidability of Simultaneous Rigid <i>E</i>-Unification with One Variable.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 9th International Conference, 1998

Decision Problems in Ordered Rewriting.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

RPO Constraint Solving Is in NP.

[BibT_eX]

[DOI]

Rakesh M. Verma

Proceedings of the Computer Science Logic, 12th International Workshop, 1998

1997

On the Unification Problem for Cartesian Closed Categories.

[BibT_eX]

[DOI]

Frank Pfenning

Richard Statman

J. Symb. Log., 1997

Single Versus Simultaneous Equational Unification and Equational Unification for Variable-Permuting Theories.

[BibT_eX]

[DOI]

J. Autom. Reason., 1997

The Word Matching Problem Is Undecidable For Finite Special String-Rewriting Systems That Are Confluent.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

1996

Any Ground Associative-Commutative Theory Has a Finite Canonical System.

[BibT_eX]

[DOI]

J. Autom. Reason., 1996

Unification Modulo ACI + 1 + 0.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1996

Solving Linear Equations over Polynomial Semirings.

[BibT_eX]

[DOI]

Proceedings of the Proceedings, 1996

Unification and Matching Modulo Nilpotence.

[BibT_eX]

[DOI]

Qing Guo

David A. Wolfram

Proceedings of the Automated Deduction - CADE-13, 13th International Conference on Automated Deduction, New Brunswick, NJ, USA, July 30, 1996

1995

Some Independent Results for Equational Unification.

[BibT_eX]

[DOI]

Daniel J. Dougherty

Proceedings of the Rewriting Techniques and Applications, 6th International Conference, 1995

The All-Minors VCCS Matrix Tree Theorem, Half-Resistors and Applications in Symbolic Simulation.

[BibT_eX]

[DOI]

Seth Chaiken

Proceedings of the 1995 IEEE International Symposium on Circuits and Systems, ISCAS 1995, Seattle, Washington, USA, April 30, 1995

1994

Codes Modulo Finite Monadic String-Rewriting Systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

Ground Temporal Logic: A Logic for Hardware Verification.

[BibT_eX]

[DOI]

David Cyrluk

Proceedings of the Computer Aided Verification, 6th International Conference, 1994

1993

On Weakly Confluent Monadic String-Rewriting Systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1993

An Algorithm for Finding Canonical Sets of Ground Rewrite Rules in Polynomial Time.

[BibT_eX]

[DOI]

J. ACM, 1993

The Unifiability Problem in Ground AC Theories

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual Symposium on Logic in Computer Science (LICS '93), 1993

1992

Complexity of Unification Problems with Associative-Commutative Operators.

[BibT_eX]

[DOI]

J. Autom. Reason., 1992

Theorem Proving Using Equational Matings and Rigid E-Unification.

[BibT_eX]

[DOI]

J. ACM, 1992

Double-exponential Complexity of Computing a Complete Set of AC-Unifiers

[BibT_eX]

[DOI]

Proceedings of the Seventh Annual Symposium on Logic in Computer Science (LICS '92), 1992

1991

Semi-Unification.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

Automating Inductionless Induction Using Test Sets.

[BibT_eX]

[DOI]

J. Symb. Comput., 1991

It is undecidable whether a finite special string-rewriting system presents a group.

[BibT_eX]

[DOI]

Colm Ó'Dúnlaing

Discret. Math., 1991

Sufficient-Completeness, Ground-Reducibility and their Complexity.

[BibT_eX]

[DOI]

Daniel J. Rosenkrantz

Acta Informatica, 1991

Any Gound Associative-Commutative Theory Has a Finite Canonical System.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 4th International Conference, 1991

A Specialized Completion Procedure for Monadic String-Rewriting Systems Presenting Groups.

[BibT_eX]

[DOI]

Klaus Madlener

Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991

1990

On Ground-Confluence of Term Rewriting Systems

[BibT_eX]

[DOI]

Inf. Comput., May, 1990

It is Decidable Whether a Monadic Thue System is Canonical Over a Regular Set.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1990

Rigid E-Unification: NP-Completeness and Applications to Equational Matings

[BibT_eX]

[DOI]

Inf. Comput., 1990

Some Results on Equational Unification.

[BibT_eX]

[DOI]

Proceedings of the 10th International Conference on Automated Deduction, 1990

1989

Some Polynomial-Time Algorithms for Finite Monadic Church-Rosser Thue Systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1989

Cancellativity in Finitely Presented Semigroups.

[BibT_eX]

[DOI]

Colm Ó'Dúnlaing

J. Symb. Comput., 1989

It is Undecidable Whether the Knuth-Bendix Completion Procedure Generates a Crossed Pair.

[BibT_eX]

[DOI]

Jonathan Stillman

Proceedings of the STACS 89, 1989

1988

Only Prime Superpositions Need be Considered in the Knuth-Bendix Completion Procedure.

[BibT_eX]

[DOI]

David R. Musser

J. Symb. Comput., 1988

Church-Rosser Thue systems and formal languages.

[BibT_eX]

[DOI]

J. ACM, 1988

Preperfectness is Undecidable for Thue Systems Containing Only Length-Reducing Rules and a Single Commutation Rule.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1988

Elements of Finite Order for Finite Weight-Reducing and Confluent Thue Systems.

[BibT_eX]

[DOI]

Acta Informatica, 1988

Rigid E-Unification is NP-Complete

[BibT_eX]

[DOI]

Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988

Formal Verification of the Sobel Image Processing Chip.

[BibT_eX]

[DOI]

Jonathan Stillman

Proceedings of the 25th ACM/IEEE Conference on Design Automation, 1988

Finding Canonical Rewriting Systems Equivalent to a Finite Set of Ground Equations in Polynomial Time.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Automated Deduction, 1988

1987

Complexity of Matching Problems.

[BibT_eX]

[DOI]

Dan Benanav

J. Symb. Comput., 1987

Matching, unification and complexity.

[BibT_eX]

[DOI]

SIGSAM Bull., 1987

On Sufficient-Completeness and Related Properties of Term Rewriting Systems.

[BibT_eX]

[DOI]

Acta Informatica, 1987

It is Decidable in Polynomial Time Whether a Monoid Presented by a Finite Weight-Reducing and Confluent Thue System is Torsion-Free.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 1987

1986

The Problems of Cyclic Equality and Conjugacy for Finite Complete Rewriting Systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1986

On the Equivalence Problem for Regular Thue Systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1986

Complexity of Sufficient-Completeness.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1986

Proof by Induction Using Test Sets.

[BibT_eX]

[DOI]

Proceedings of the 8th International Conference on Automated Deduction, Oxford, England, July 27, 1986

NP-Completeness of the Set Unification and Matching Problems.

[BibT_eX]

[DOI]

Proceedings of the 8th International Conference on Automated Deduction, Oxford, England, July 27, 1986

1985

Complexity Results on the Conjugacy Problem for Monoids.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1985

On Recursive Path Ordering.

[BibT_eX]

[DOI]

Mukkai S. Krishnamoorthy

Theor. Comput. Sci., 1985

The Church-Rosser Property and Special Thue Systems.

[BibT_eX]

[DOI]

Mukkai S. Krishnamoorthy

Theor. Comput. Sci., 1985

A Finite Thue System with Decidable Word Problem and without Equivalent Finite Canonical System.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1985

An O(|T|3) Algorithm for Testing the Church-Rosser Property of Thue Systems.

[BibT_eX]

[DOI]

Mukkai S. Krishnamoorthy

Theor. Comput. Sci., 1985

The Knuth-Bendix Completion Procedure and Thue Systems.

[BibT_eX]

[DOI]

SIAM J. Comput., 1985

Complexity of Certain Decision Problems about Congruential Languages.

[BibT_eX]

[DOI]

Colm Ó'Dúnlaing

Heinrich Rolletschek

J. Comput. Syst. Sci., 1985

A Path Ordering for Proving Termination of Term Rewriting Systems.

[BibT_eX]

[DOI]

G. Sivakumar

Proceedings of the Mathematical Foundations of Software Development, 1985

An Ideal-Theoretic Approach to Work Problems and Unification Problems over Finitely Presented Commutative Algebras.

[BibT_eX]

[DOI]

Abdelilah Kandri-Rody

Proceedings of the Rewriting Techniques and Applications, First International Conference, 1985

An Equational Approach to Theorem Proving in First-Order Predicate Calculus.

[BibT_eX]

[DOI]

Proceedings of the 9th International Joint Conference on Artificial Intelligence. Los Angeles, 1985

Reasoning about three dimensional space.

[BibT_eX]

[DOI]

Proceedings of the 1985 IEEE International Conference on Robotics and Automation, 1985

1984

The Undecidability of the Preperfectness of Thue Systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1984

The Uniform Conjugacy Problem for Finite Church-Rosser Thue Systems is NP-Complete

[BibT_eX]

[DOI]