Treffer: Combination of constraint systems II: Rational amalgamation

Title:
Combination of constraint systems II: Rational amalgamation
Authors:
SCHULZ, Klaus U, KEPSER, Stephan
Source:
Theoretical computer science. 266(1-2):113-157
Publisher Information:
Amsterdam: Elsevier, 2001.
Publication Year:
2001
Physical Description:
print, 18 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Logique mathématique, fondements, théorie des ensembles, Mathematical logic, foundations, set theory, Logique et fondements, Logic and foundations, Théorie des modèles, Model theory, Algèbre, Algebra, Systèmes algébriques généraux, General algebraic systems, Algèbre universelle, Universal algebra, Algebra universal, Amalgamation, Amalgamación, Programmation logique avec contrainte, Constraint logic programming, Programación lógica con restricción, Unification, Unificación, Combinaison, Combination, Système contrainte, Constraint system
Document Type:
Fachzeitschrift Article
File Description:
text
Language:
English
Author Affiliations:
CIS, Universität München, Oettingenstr. 67, 80538 München, Germany
SfS, Universität Tübingen, Wilhelmstr. 113, 72074 Tübingen, Germany
ISSN:
0304-3975
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=14071447
Rights:
Copyright 2002 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Mathematics
Accession Number:
edscal.14071447
Database:
PASCAL Archive

Weitere Informationen

In two earlier papers (Baader, Schulz, in: U. Montanari, F. Rossi (Eds.), Proc. CP'95 Springer Lecture Notes in Computer Science, vol. 976, Springer, Berlin, pp. 380-397; Theoret. Comput. Sci 192 (1998) 107-161), the concept of free amalgamation has been introduced as a general methodology for interweaving solution structures for symbolic constraints, and it was shown how constraint solvers for two components can be lifted to a constraint solver for the free amalgam. Here we discuss a second general way for combining solution domains, called rational amalgamation. In praxis, rational amalgamation seems to be the preferred combination principle if the two solution structures to be combined are rational or non-wellfounded domains. It represents, e.g., the way how rational trees and rational lists are interwoven in the solution domain of Prolog III, and a variant has been used by W. Rounds for combining feature structures and hereditarily finite non-wellfounded sets. We show that rational amalgamation is a general combination principle, applicable to a large class of structures. As in the case of free amalgamation, constraint solvers for two component structures can be combined to a constraint solver for their rational amalgam. From this algorithmic point of view, rational amalgamation seems to be interesting since the combination technique for rational amalgamation avoids one source of non-determinism that is needed in the corresponding scheme for free amalgamation.