Christophe Ringeissen  Home/Search
Context Related
| inria.fr/INRIA/publicat...RR2753.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: indiana.edu/pub/ucstri/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: : Constraint programming is strongly based on the use of solvers which are able to check satisfiability of constraints. We show in this paper a rule-based algorithm for solving in a modular way the satisfiability problem w.r.t. a class of theories Th. The case where Th is the union of two disjoint theories Th 1 and Th 2 is known for a long time but we study here different cases where function symbols are shared by Th 1 and Th 2 . The chosen approach leads to a highly non-deterministic... (Update)
Context of citations to this paper: More
.... SOLVER COLLABORATIONS BALI [21] is an environment for solver collaboration (i.e. solver cooperation [25, 14] and solver combination [26, 29]) that separates constraint programming (the host language) from constraint solving (the solver collaboration language) The host...
.... An important example is the combination problem of two constraint solvers known for signature disjoint theories T 1 and T 2 [36, 44, 50]. A solution to this problem consists of a solver able to handle heterogeneous constraints for the union of theories T 1 [ T 2 . More...
Cited by: More
Basic Components for Constraint Solver Cooperations - Monfroy, Castro (2003) (Correct)
A New Approach for Combining Decision Procedures for the Word .. - Baader, Tinelli (1997) (Correct)
Improving the Efficiency of Reasoning Through Structure-Based .. - Amir, Mcllraith (2000) (Correct)
Similar documents (at the sentence level):
40.3%: Cooperation of Decision Procedures for the Satisfiability Problem - Ringeissen (1996) (Correct)
Active bibliography (related documents): More All
0.5: Unification Theory - Baader, Snyder (1999) (Correct)
0.4: A New Correctness Proof Of The Nelson-Oppen Combination.. - Tinelli, Harandi (1996) (Correct)
0.4: Unification in the Union of Disjoint Equational Theories.. - Baader, Schulz (1992) (Correct)
Similar documents based on text: More All
0.2: Unions of Non-Disjoint Theories and Combinations of.. - Tinelli, Ringeissen (2001) (Correct)
0.2: Non-Disjoint Unions of Theories and Combinations of.. - Tinelli, Ringeissen (1998) (Correct)
0.2: Rule-Based Constraint Programming - Kirchner, Ringeissen (1998) (Correct)
Related documents from co-citation: More All
13: Simplification by cooperating decision procedures (context) - Nelson, Oppen - 1979
9: Combining symbolic constraint solvers on algebraic domains - Kirchner, Ringeissen - 1994
8: Implementing non-linear constraints with cooperative solvers - Monfroy, Rusinowitch et al. - 1996
BibTeX entry: (Update)
C. Ringeissen. Cooperation of decision procedures for the satisfiability problem. In Proceedings of the First International Workshop Frontiers of Combining Systems FroCoS'96, Munich, Mar. 1996. To appear. http://citeseer.ist.psu.edu/article/ringeissen96cooperation.html More
@inproceedings{ ringeissen96cooperation,
author = "Christophe Ringeissen",
title = "Cooperation of Decision Procedures for the Satisfiability Problem",
booktitle = "Frontiers of Combining Systems: Proceedings of the 1st International Workshop, Munich (Germany)",
publisher = "Kluwer Academic Publishers",
editor = "F.~Baader and K. U.~Schulz",
pages = "121--140",
year = "1996",
url = "citeseer.ist.psu.edu/article/ringeissen96cooperation.html" }
Citations (may not include all citations):154 Simplification by cooperating decision procedures (context) - Nelson, Oppen - 1979
125 Solving equations in abstract algebras: a rule-based survey .. (context) - Jouannaud, Kirchner - 1991
121 Deciding combination of theories (context) - Shostak - 1984
74 the structure of abstract algebras (context) - Birkhoff - 1935
71 Unification in the union of disjoint equational theories: Co.. - Baader, Schulz - 1992
64 A practical decision procedure for arithmetic with function .. (context) - Shostak - 1979
44 Combination techniques for non-disjoint equational theories - Domenjoud, Klay et al. - 1994
37 Combining symbolic constraint solvers on algebraic domains - Kirchner, Ringeissen - 1994
34 Theoretical Computer Science (context) - Oppen, convexity et al. - 1980
27 the combination of symbolic constraints (context) - Baader, Schulz - 1995
26 Combination techniques and decision problems for disunificat.. - Baader, Schulz - 1995
26 Combination of unification algorithms (context) - Schmidt-Schau - 1989
22 Combination of constraint solving techniques: An algebraic p.. - Baader, Schulz - 1995
8 Unification in boolean rings and abelian groups (context) - Boudet, Jouannaud et al. - 1990
6 Extending the CLP scheme to unions of constraint theories (context) - Tinelli - 1995
4 ese de Doctorat d (context) - Ringeissen, de Contraintes - 1993
4 Combination of Unification Algorithms in Equational Theories (context) - Herold - 1987
4 First-order unification in combinations of equational theori.. (context) - Tiden - 1986
2 Xerox Palo Research Center California USA (context) - Nelson, program et al. - 1981
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.indiana.edu/pub/ucstri/index): More
Environment Modelling for Mobile Robots: Neural Learning for.. - van Dam (1998) (Correct)
Broadcasting in Butterfly and DeBruijn Networks - Klasing, Monien, Peine, Stöhr (1992) (Correct)
ILFA - A Project in Experimental Logic Computation - Dunker, Flögel, Büning.. (Correct)
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