H. Comon. Constraints in term algebras. In M. Nivat, C. Rattray, T. Rus, and G. Scollo, editors, Proceedings 3rd International Conference on Algebraic Methodology and Software Technology, Enschede (The Netherlands), pages 97--108. SpringerVerlag, June 1993.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....If we consider theories also with other predicates than equality, we can think of theories generated by an infinite set of disequations or inequations. The former appear in complement problems and disunification [CL89, Com91] the latter appear in the presence of symbolic ordering constraints [Com90, Com93, KKR90]. The Knuth Bendix completion procedure [DJ90] often generates an infinite family of rewrite rules in an attempt to produce a confluent and terminating rewrite system. Infinite sets of objects are not considered always as undesired products, but they may have been introduced intentionally. This is ....

....system and P for a primal unification problem. Given a unification problem P, the occur check relation P is the relation on ordinary variables of P defined as the smallest reflexive transitive relation which contains x P y when there is an equation x = t in P with x 2 Var(t) cf. [Com93]) Let us define the precedence = on the signature H as follows: 40 1. for the symbols = and we define = 2. every constructor symbols from K is greater that the equation symbol = 8f 2 K (f = 3. every defined symbol from D is greater than every ....

H. Comon. Constraints in term algebras. In M. Nivat, C. Rattray, T. Rus, and G. Scollo, editors, Proceedings 3rd International Conference on Algebraic Methodology and Software Technology, Enschede (The Netherlands), pages 97--108. SpringerVerlag, June 1993.

....generally, reasoning) outside the specific constraint domain, a constraint solver alone is not enough. An emerging deductive paradigm, which comes in many incarnations and flavors (Theory Resolution [Sti85] the Substitutional Framework [Fri91] Constrained Resolution [B 94] Constrained Logic [Com93] Constraint Logic Programming [JM94, HS88] Deduction With Constraints [KKR90] T resolution [FP95] Theory Consolution [BFP92] tries to combine the advantages of both general purpose and specialized problem solving by providing hybrid frameworks in which a generalpurpose reasoner is ....

Hubert Comon. Constraints in term algebras (A short survey). In M. Nivat, C. Rattay, T. Rus, and G. Scollo, editors, Proceedings of Algebraic Methodology and Software Technology, pages 145--152, Enschede, Netherlands, June 1993.

....of this survey paper. The set P now involves, besides equality, a binary predicate symbol . This symbol is interpreted as an ordering on trees; we will discuss later which kind of interpretations are relevant. ffl many other systems, like set constraints, feature constraints etc. We refer to [7] for a short survey. Symbolic constraints, besides their own interest, can be used together with a logical language, hence leading to constrained formulae. A constrained formula is a pair (OE; c) actually written OEjc) where OE is a formula in some first order logic built upon a set Q of ....

H. Comon. Constraints in term algebras (short survey). In T. R. M. Nivat, C. Rattray and G. Scollo, editors, Proc. Conf. on Algebraic Methodology and Software Technology, Univ. of Twente, 1993. Springer Verlag, series Workshop in Computing. Invited talk.

....of this survey paper. The set P now involves, besides equality, a binary predicate symbol . This symbol is interpreted as an ordering on trees; we will discuss later which kind of interpretations are relevant. many other systems, like set constraints, feature constraints etc. We refer to [7] for a short survey. Symbolic constraints, besides their own interest, can be used together with a logical language, hence leading to constrained formulae. A constrained formula is a pair (OE; c) actually written OEjc) where OE is a formula in some first order logic built upon a set Q of ....

H. Comon. Constraints in term algebras (short survey). In T. R. M. Nivat, C. Rattray and G. Scollo, editors, Proc. Conf. on Algebraic Methodology and Software Technology, Univ. of Twente, 1993. Springer Verlag, series Workshop in Computing. Invited talk.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC