Results 1  10
of
26
Disunification: a Survey
 Computational Logic: Essays in Honor of Alan
, 1991
"... Solving an equation in an algebra of terms is known as unification. Solving more complex formulas combining equations and involving in particular negation is called disunification. With such a broad definition, many works fall into the scope of disunification. The goal of this paper is to survey the ..."
Abstract

Cited by 56 (9 self)
 Add to MetaCart
Solving an equation in an algebra of terms is known as unification. Solving more complex formulas combining equations and involving in particular negation is called disunification. With such a broad definition, many works fall into the scope of disunification. The goal of this paper is to survey these works and bring them together in a same framework. R'esum'e On appelle habituellement (algorithme d') unification un algorithme de r'esolution d'une 'equation dans une alg`ebre de termes. La r'esolution de formules plus complexes, comportant en particulier des n'egations, est appel'ee ici disunification. Avec une d'efinition aussi 'etendue, de nombreux travaux peuvent etre consid'er'es comme portant sur la disunification. L'objet de cet article de synth`ese est de rassembler tous ces travaux dans un meme formalisme. Laboratoire de Recherche en Informatique, Bat. 490, Universit'e de ParisSud, 91405 ORSAY cedex, France. Email: comon@lri.lri.fr i Contents 1 Syntax 5 1.1 Basic Defini...
Solving Symbolic Ordering Constraints
, 1990
"... We show how to solve boolean combinations of inequations s ? t in the Herbrand Universe, assuming that is interpreted as a lexicographic path ordering extending a total precedence. In other words, we prove that the existential fragment of the theory of a lexicographic path ordering which extends a ..."
Abstract

Cited by 50 (11 self)
 Add to MetaCart
We show how to solve boolean combinations of inequations s ? t in the Herbrand Universe, assuming that is interpreted as a lexicographic path ordering extending a total precedence. In other words, we prove that the existential fragment of the theory of a lexicographic path ordering which extends a total precedence is decidable. Keywords: simplification orderings, ordered strategies, term algebras, constraint solving. 1. Introduction The first order theory of term algebras over a language (or alphabet) with no relational symbol (other than equality) has been shown to be decidable 1;2 . See also Refs 3 and 4. Introducing into the language a binary relational symbol interpreted as the subterm ordering makes the theory undecidable 5 . Venkataraman also shows in the latter paper that the purely existential fragment of the theory, i.e. the subset of sentences whose prenex form does not contain 8, is decidable. Venkataraman was concerned with some applications in functional programm...
The finite variant property: How to get rid of some algebraic properties
 In Proceedings of RTA’05, LNCS 3467
, 2005
"... Abstract. We consider the following problem: Given a term t, a rewrite system R, a finite set of equations E ′ such that R is E ′convergent, compute finitely many instances of t: t1,..., tn such that, for every substitution σ, there is an index i and a substitution θ such that tσ ↓ =E ′ tiθ (wher ..."
Abstract

Cited by 39 (9 self)
 Add to MetaCart
Abstract. We consider the following problem: Given a term t, a rewrite system R, a finite set of equations E ′ such that R is E ′convergent, compute finitely many instances of t: t1,..., tn such that, for every substitution σ, there is an index i and a substitution θ such that tσ ↓ =E ′ tiθ (where tσ ↓ is the normal form of tσ w.r.t. →E ′ \R). The goal of this paper is to give equivalent (resp. sufficient) conditions for the finite variant property and to systematically investigate this property for equational theories, which are relevant to security protocols verification. For instance, we prove that the finite variant property holds for Abelian Groups, and a theory of modular exponentiation and does not hold for the theory ACUNh (Associativity, Commutativity, Unit, Nilpotence, homomorphism).
On Equality Upto Constraints over Finite Trees, Context Unification, and OneStep Rewriting
"... We introduce equality upto constraints over finite trees and investigate their expressiveness. Equality upto constraints subsume equality constraints, subtree constraints, and onestep rewriting constraints. ..."
Abstract

Cited by 27 (7 self)
 Add to MetaCart
We introduce equality upto constraints over finite trees and investigate their expressiveness. Equality upto constraints subsume equality constraints, subtree constraints, and onestep rewriting constraints.
Combination Techniques and Decision Problems for Disunification
 Theoretical Computer Science
"... Previous work on combination techniques considered the question of how to combine unification algorithms for disjoint equational theories E 1 ; : : : ; E n in order to obtain a unification algorithm for the union E 1 [ : : : [ E n of the theories. Here we want to show that variants of this method m ..."
Abstract

Cited by 21 (6 self)
 Add to MetaCart
Previous work on combination techniques considered the question of how to combine unification algorithms for disjoint equational theories E 1 ; : : : ; E n in order to obtain a unification algorithm for the union E 1 [ : : : [ E n of the theories. Here we want to show that variants of this method may be used to decide solvability and ground solvability of disunification problems in E 1 [ : : : [E n . Our first result says that solvability of disunification problems in the free algebra of the combined theory E 1 [ : : : [E n is decidable if solvability of disunification problems with linear constant restrictions in the free algebras of the theories E i (i = 1; : : : ; n) is decidable. In order to decide ground solvability (i.e., solvability in the initial algebra) of disunification problems in E 1 [ : : : [ E n we have to consider a new kind of subproblem for the particular theories E i , namely solvability (in the free algebra) of disunification problems with linear constant restricti...
Ordering Constraints on Trees
 Colloquium on Trees in Algebra and Programming
, 1994
"... . We survey recent results about ordering constraints on trees and discuss their applications. Our main interest lies in the family of recursive path orderings which enjoy the properties of being total, wellfounded and compatible with the tree constructors. The paper includes some new results, in p ..."
Abstract

Cited by 20 (1 self)
 Add to MetaCart
. We survey recent results about ordering constraints on trees and discuss their applications. Our main interest lies in the family of recursive path orderings which enjoy the properties of being total, wellfounded and compatible with the tree constructors. The paper includes some new results, in particular the undecidability of the theory of lexicographic path orderings in case of a nonunary signature. 1 Symbolic Constraints Constraints on trees are becoming popular in automated theorem proving, logic programming and in other fields thanks to their potential to represent large or even infinite sets of formulae in a nice and compact way. More precisely, a symbolic constraint system, also called a constraint system on trees, consists of a fragment of firstorder logic over a set of predicate symbols P and a set of function symbols F , together with a fixed interpretation of the predicate symbols in the algebra of finite trees T (F) (or sometimes the algebra of infinite trees I(F)) ov...
Open Problems in Rewriting
 Proceeding of the Fifth International Conference on Rewriting Techniques and Application (Montreal, Canada), LNCS 690
, 1991
"... Introduction Interest in the theory and applications of rewriting has been growing rapidly, as evidenced in part by four conference proceedings #including this one# #15, 26, 41,66#; three workshop proceedings #33, 47, 77#; #ve special journal issues #5,88, 24, 40, 67#; more than ten surveys #2,7,27 ..."
Abstract

Cited by 19 (2 self)
 Add to MetaCart
Introduction Interest in the theory and applications of rewriting has been growing rapidly, as evidenced in part by four conference proceedings #including this one# #15, 26, 41,66#; three workshop proceedings #33, 47, 77#; #ve special journal issues #5,88, 24, 40, 67#; more than ten surveys #2,7,27, 28, 44, 56,57,76, 82, 81#; one edited collection of papers #1#; four monographs #3, 12,55,65#; and seven books #four of them still in progress# #8,9, 35, 54, 60,75, 84#. To encourage and stimulate continued progress in this area, wehave collected #with the help of colleagues# a number of problems that appear to us to be of interest and regarding whichwe do not know the answer. Questions on rewriting and other equational paradigms have been included; manyhave not aged su#ciently to be accorded the appellation #open problem". Wehave limited ourselves to theoretical questions, though there are certainly many additional interesting questions relating to applications and implementation
The FirstOrder Theory of Ordering Constraints over Feature Trees
 Discrete Mathematics and Theoretical Computer Science
, 2001
"... The system FT of ordering constraints over feature trees has been introduced as an extension of the system FT of equality constraints over feature trees. We investigate the firstorder theory of FT and its fragments, both over finite trees and over possibly infinite trees. We prove that the firstor ..."
Abstract

Cited by 19 (5 self)
 Add to MetaCart
The system FT of ordering constraints over feature trees has been introduced as an extension of the system FT of equality constraints over feature trees. We investigate the firstorder theory of FT and its fragments, both over finite trees and over possibly infinite trees. We prove that the firstorder theory of FT is undecidable, in contrast to the firstorder theory of FT which is wellknown to be decidable. We determine the complexity of the entailment problem of FT with existential quantification to be PSPACEcomplete, by proving its equivalence to the inclusion problem of nondeterministic finite automata. Our reduction from the entailment problem to the inclusion problem is based on a new alogrithm that, given an existential formula of FT , computes a finite automaton which accepts all its logic consequences.
Rewrite Proofs and Computations
 Proof and Computation
, 1995
"... . Rewriting is a general paradigm for expressing computations in various logics, and we focus here on rewriting techniques in equational logic. When used at the proof level, rewriting provides with a very powerful methodology for proving completeness results, a technique that is illustrated here. We ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
. Rewriting is a general paradigm for expressing computations in various logics, and we focus here on rewriting techniques in equational logic. When used at the proof level, rewriting provides with a very powerful methodology for proving completeness results, a technique that is illustrated here. We also consider whether important properties of rewrite systems such as confluence and termination can be proved in a modular way. Finally, we stress the links between rewriting and tree automata. Previous surveys include [21; 18; 37; 12; 45; 46]. The present one owes much to [21]. Keywords. completion, confluence, critical pair, ground reducibility, inductive completion, local confluence, modularity, narrowing, ordersorted algebras, rewrite rule, rewriting, term algebra, termination, tree automata. 1 Introduction The use of equations is traditional in mathematics. Its use in computer science has culminated with the success of algebraic specifications, a method of specifying software by enc...