Combination of constraint solvers for free and quasi-free structures

DOI10.1016/S0304-3975(97)00147-3zbMATH Open0895.68019WikidataQ57383727 ScholiaQ57383727MaRDI QIDQ1127338FDOQ1127338

Authors: Franz Baader, K. U. Schulz 

Publication date: 13 August 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Recommendations

• Combination of constraint systems II: Rational amalgamation
• Negation in combining constraint systems
• Combination of constraint solving techniques: An algebraic point of view

zbMATH Keywords

combinationuniversal algebraunificationconstraint solving

Mathematics Subject Classification ID

Logic programming (68N17) Applications of universal algebra in computer science (08A70)

Cites Work

• Complexity, convexity and combinations of theories
• Simplification by Cooperating Decision Procedures
• Universal domains and the amalgamation property
• Title not available (Why is that?)
• Title not available (Why is that?)
• Termination of rewriting
• Title not available (Why is that?)
• A Unification Algorithm for Associative-Commutative Functions
• A resolution principle for a logic with restricted quantifiers
• Unification in a combination of arbitrary disjoint equational theories
• Combining unification algorithms
• Combining symbolic constraint solvers on algebraic domains
• Model theoretic algebra. Selected topics
• Equational problems and disunification
• Records for logic programming
• A feature constraint system for logic programming with entailment
• Combination techniques and decision problems for disunification
• Combination of constraint solving techniques: An algebraic point of view
• Generalized varieties
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Practical Decision Procedure for Arithmetic with Function Symbols
• Instantiation theory. On the foundations of automated deduction
• Title not available (Why is that?)
• DECIDABILITY OF THE POSITIVE THEORY OF A FREE COUNTABLY GENERATED SEMIGROUP
• How to win a game with features
• Combination of constraint systems II: Rational amalgamation

Cited In (6)

• On the cooperation of the constraint domains ℋ, ℛ, and ℱ in CFLP
• Combination of constraint systems II: Rational amalgamation
• Decidability and combination results for two notions of knowledge in security protocols
• Deciding the word problem in the union of equational theories.
• Unions of non-disjoint theories and combinations of satisfiability procedures
• Editors' introduction to the special issue on combining logics

This page was built for publication: Combination of constraint solvers for free and quasi-free structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127338)