On the combination of symbolic constraints, solution domains, and constraint solvers-Reference-Cited by-同舟云学术

On the combination of symbolic constraints, solution domains, and constraint solvers

Published:1995 Issue: Volume: Page:380-397
ISSN:0302-9743
Container-title:Principles and Practice of Constraint Programming — CP '95
language:
Short-container-title:

Author:

Baader Franz,Schulz Klaus U.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-60299-2_23.pdf

Reference24 articles.

1. P. Aczel, “Non-well-founded Sets,” CSLI Lecture Notes 14, Stanford University, 1988.

2. H. Ait-Kaci, A. Podelski, and G. Smolka, “A feature-based constraint system for logic programming with entailment,” Theoretical Comp. Science 122, 1994, pp. 263–283.

3. F. Baader and K.U. Schulz, “Unification in the union of disjoint equational theories: Combining decision procedures,” in: Proc. CADE-11, LNAI 607, 1992, pp. 50–65.

4. F. Baader and K.U. Schulz, “Combination techniques and decision problems for disunification,” in: Proc. RTA-9S, LNCS 690, 1993.

5. F. Baader and K.U. Schulz, “Combination of Constraint Solving Techniques: An Algebraic Point of View,” Research Report CIS-Rep-94-75, University Munich, 1994; short version in: Proc. RTA'95, Springer LNCS 914, 1995.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Unions of non-disjoint theories and combinations of satisfiability procedures;Theoretical Computer Science;2003-01

2. SoleX: A domain-independent scheme for constraint solver extension;Artificial Intelligence and Symbolic Computation;1998

3. Constraint Logic Programming over unions of Constraint theories;Lecture Notes in Computer Science;1996

4. Combination of constraint systems II: Rational amalgamation;Lecture Notes in Computer Science;1996