Titlebook: Word Equations and Related Topics; Second International Habib Abdulrab,Jean-Pierre Pécuchet Conference proceedings 1993 Springer-Verlag Ber

conquer

The naming problem for left distributivity,ibe an algorithm for solving this question using conjugacy in a free group. The correctness of the algorithm is reduced to a conjecture involving some particular words. A skew version of the conjecture is established.

恸哭

Theorem proving by combinatorial optimization,wn that this problem can be formulated as a constraint satisfaction problem (CSP), whose system has a generalized covering type (we recall that a CSP consists in proving the emptiness of a domain defined by a set of diophantinc constraints, or the existence of a solution). We propose a new method -d

Osteoporosis

Solving string equations with constant restrictions,, ..} of variables and a string equation ..... where .., .. ε (. ∪ .).. Furthermore sets .(..) ∈ ., 1 ≤ . <- ., are given which are called constant restrictions. A substitution . solves the equation s.... and satisfies the constant restrictions ..), 1 ≤ ., if σ(..) = .(..) and σ(..) . ((..)) ∪ .). f

分开

,LOP: Toward a new implementation of Makanin’s Algorithm,t express in a very natural way all the programming concepts needed in such an implementation..Then we describe a programming system LOP (Logic, Objects and Parallelism) aimed at integrating these paradigms.

青石板

Engaging

Unification in the combination of disjoint theories,titution unifies . if σ(.) . σ(.), i.e. σ(.), σ(.) are equivalent modulo theory ...In particular we give a unification algorithm for theories . = .. ∪ ⋯ ∪ .. which are combinations of theories with disjoint signatures, ε(..) ∩ ε(..) = Φ for . ≠ .. Our method works if for each theory .. there exists

防锈

DRAFT

conduct

Solving string equations with constant restrictions,ing the decision algorithm of Makanin we obtain an algorithm which decides whether or not a given string equation has a solution satisfying the constant restrictions. Furthermore we think that we have, as a by-product, a very nice presentation of Makanin‘s algorithm.

lipids

0302-9743 hesubsets of rank two in a freemonoid (a fast decision algorithm), and a solution of thecomplement problem in associative-commutative theories.978-3-540-56730-1978-3-540-47636-8Series ISSN 0302-9743 Series E-ISSN 1611-3349