Combining matching algorithms: The regular case
TLDR
It is shown that the combined matching problem is in general undecidable but that it becomes decidable if all theories are regular and an efficient combination algorithm is developed.About:
This article is published in Journal of Symbolic Computation.The article was published on 1991-12-01 and is currently open access. It has received 55 citations till now. The article focuses on the topics: Word problem (mathematics) & Disjoint sets.read more
Citations
More filters
Journal ArticleDOI
Maude: specification and programming in rewriting logic
Manuel Clavel,Francisco Durán,Steven Eker,Patrick Lincoln,Narciso Martí-Oliet,José Meseguer,José F. Quesada +6 more
TL;DR: The paper outlines the principles underlying the Maude system implementation, including its semicompilation techniques, and explains and illustrates with examples the main concepts of Maude's language design including its underlying logic, functional, system and object-oriented modules, as well as parameterized modules, theories, and views.
Book ChapterDOI
A pattern matching compiler for multiple target languages
TL;DR: This paper introduces a pattern matching compiler (TOM): a set of primitives which add pattern matching facilities to imperative languages such as C, Java, or Eiffel, and shows that this tool is extremely non-intrusive, lightweight and useful to implement tree transformations.
Journal ArticleDOI
Unions of non-disjoint theories and combinations of satisfiability procedures
TL;DR: This paper describes a general combination method which, given a procedure that decides constraint satisfiability with respect to a constraint theory T1 and one that decides constraints Satisfiability T2, produces a procedure which (semi-)decides constraint satisfiable with respectto the union of T 1 and T2.
Dissertation
An executable theory of multi-agent systems refinement
TL;DR: The aim of this thesis is to adapt formal techniques to the agent-oriented methodology into an executable theory of refinement, and proposes a weakest precondition calculus as a deductive method based on assertions which allow to prove correctness of in-time state agents.
References
More filters
Journal ArticleDOI
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems
TL;DR: This paper gives new results, and presents old ones, concerning ChurchRosser theorems for rewrmng systems, depending solely on axioms for a binary relatton called reduction, and how these criteria yield new methods for the mechanizaUon of equattonal theories.
Journal ArticleDOI
An Efficient Unification Algorithm
Arabella Martelli,Ugo Montanari +1 more
TL;DR: A new unification algorithm, characterized by having the acyclicity test efficiently embedded into it, is derived from the nondeterministic one, and a PASCAL implementation is given.
Book ChapterDOI
Equations and rewrite rules: a survey
Gérard Huet,Derek C. Oppen +1 more
TL;DR: The problem of "solving" equations, the problem of proving termination of sets of rewrite rules, and the decidability and complexity of word problems and of combinations of equational theories are discussed.
Proceedings ArticleDOI
Conflunt reductions: Abstract properties and applications to term rewriting systems
TL;DR: This paper gives new results, and presents old ones in a unified formalism, concerning Church-Rosser theorems for rewriting systems, and shows how these results yield efficient methods for the mechanization of equational theories.
Journal ArticleDOI
Proving termination with multiset orderings
Nachum Dershowitz,Zohar Manna +1 more
TL;DR: The multiset ordering enables the use of relatively simple and intuitive termination functions in otherwise difficult termination proofs, and is used to prove the termination of production systems, programs defined in terms of sets of rewriting rules.