Unification modulo lists with reverse relation with certain word equations

DOI10.1007/978-3-030-29436-6_1OpenAlexW2965292668MaRDI QIDQ2305403

Siva Anantharaman, Michaël Rusinowitch, Peter Hibbs, Paliath Narendran

Publication date: 10 March 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-29436-6_1

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (1)

Unification modulo lists with reverse relation with certain word equations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding all solutions of equations in free groups and monoids with involution
• On word equations in one variable
• Proof by consistency
• Universality of a reversible two-counter machine
• Unification in the union of disjoint equational theories: Combining decision procedures
• Unification modulo lists with reverse relation with certain word equations
• An efficient algorithm for solving word equations
• A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings
• Deciding Combinations of Theories
• Abstract Data Type Specification in the Affirm System
• Simplification by Cooperating Decision Procedures
• Reasoning About Recursively Defined Data Structures
• Abstract data types and software validation
• Term Rewriting and All That
• New results on rewrite-based satisfiability procedures

This page was built for publication: Unification modulo lists with reverse relation with certain word equations