Pages that link to "Item:Q1124372"
From MaRDI portal
The following pages link to Equational problems and disunification (Q1124372):
Displaying 24 items.
- (Q5020661) (← links)
- Redundancy criteria for constrained completion (Q5055781) (← links)
- Encompassment properties and automata with constraints (Q5055805) (← links)
- AC complement problems: Satisfiability and negation elimination (Q5055807) (← links)
- Combination of constraint solving techniques: An algebraic point of view (Q5055842) (← links)
- An equivalence preserving first order unfold/fold transformation system (Q5096195) (← links)
- A matching process modulo a theory of categorical products (Q5096201) (← links)
- First order data types and first order logic (Q5096240) (← links)
- Higher order disunification: Some decidable cases (Q5096304) (← links)
- How to win a game with features (Q5096316) (← links)
- Negation elimination in equational formulae (Q5096830) (← links)
- Decidability of affine solution problems (Q5158360) (← links)
- Decidability Results for Saturation-Based Model Building (Q5191116) (← links)
- Predicate Completion for non-Horn Clause Sets (Q5200033) (← links)
- System Description: SPASS-FD (Q5200034) (← links)
- A method for building models automatically. Experiments with an extension of OTTER (Q5210763) (← links)
- Partial matching for analogy discovery in proofs and counter-examples (Q5234724) (← links)
- Building proofs or counterexamples by analogy in a resolution framework (Q5235252) (← links)
- Analogy in Automated Deduction: A Survey (Q5739522) (← links)
- Equational Formulas and Pattern Operations in Initial Order-Sorted Algebras (Q5743584) (← links)
- Completion for constrained term rewriting systems (Q5881204) (← links)
- Combining enumeration and deductive techniques in order to increase the class of constructible infinite models (Q5927982) (← links)
- Speeding up algorithms on atomic representations of Herbrand models via new redundancy criteria (Q5927983) (← links)
- Computation of non-ground disjunctive well-founded semantics with constraint logic programming (Q6623800) (← links)
