Combination of constraint solvers for free and quasi-free structures
From MaRDI portal
Publication:1127338
DOI10.1016/S0304-3975(97)00147-3zbMath0895.68019WikidataQ57383727 ScholiaQ57383727MaRDI QIDQ1127338
Publication date: 13 August 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
On the cooperation of the constraint domains ℋ, ℛ, and ℱ in CFLP, Deciding the word problem in the union of equational theories., Decidability and combination results for two notions of knowledge in security protocols, Combination of constraint systems II: Rational amalgamation, Editors' introduction to the special issue on combining logics, Unions of non-disjoint theories and combinations of satisfiability procedures
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unification in a combination of arbitrary disjoint equational theories
- Combination techniques and decision problems for disunification
- Termination of rewriting
- Equational problems and disunification
- Complexity, convexity and combinations of theories
- Instantiation theory. On the foundations of automated deduction
- Model theoretic algebra. Selected topics
- A feature constraint system for logic programming with entailment
- Combining unification algorithms
- Combining symbolic constraint solvers on algebraic domains
- A resolution principle for a logic with restricted quantifiers
- Generalized varieties
- Simplification by Cooperating Decision Procedures
- A Unification Algorithm for Associative-Commutative Functions
- A Practical Decision Procedure for Arithmetic with Function Symbols
- DECIDABILITY OF THE POSITIVE THEORY OF A FREE COUNTABLY GENERATED SEMIGROUP
- Universal domains and the amalgamation property
- Records for logic programming
- Combination of constraint solving techniques: An algebraic point of view
- How to win a game with features
- Combination of constraint systems II: Rational amalgamation
