Pages that link to "Item:Q1124372"
From MaRDI portal
The following pages link to Equational problems and disunification (Q1124372):
Displaying 50 items.
- Deducibility constraints and blind signatures (Q462488) (← links)
- Matching - a special case of unification? (Q582272) (← links)
- Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness (Q582891) (← links)
- Complete axiomatizations of some quotient term algebras (Q685393) (← links)
- Proof methods of declarative properties of definite programs (Q685395) (← links)
- Anti-patterns for rule-based languages (Q968527) (← links)
- Combination of constraint solvers for free and quasi-free structures (Q1127338) (← links)
- Narrowing based procedures for equational disunification (Q1197097) (← links)
- A method for simultaneous search for refutations and models by equational constraint solving (Q1198235) (← links)
- Equivalence-preserving first-order unfold/fold transformation systems (Q1200980) (← links)
- A new method for undecidability proofs of first order theories (Q1209623) (← links)
- Negation elimination in empty or permutative theories (Q1264437) (← links)
- How to win a game with features (Q1271569) (← links)
- Weighted systems of equations (Q1311966) (← links)
- Equational formulae with membership constraints (Q1333268) (← links)
- What is failure? An approach to constructive negation (Q1346220) (← links)
- The first-order theory of lexicographic path orderings is undecidable (Q1392274) (← links)
- Unification of infinite sets of terms schematized by primal grammars (Q1392278) (← links)
- Extracting models from clause sets saturated under semantic refinements of the resolution rule. (Q1401929) (← links)
- Model building with ordered resolution: Extracting models from saturated clause sets (Q1404975) (← links)
- On the complexity of equational problems in CNF (Q1404988) (← links)
- Parameterized provability in equational logic (Q1694478) (← links)
- Semantically-guided goal-sensitive reasoning: inference system and completeness (Q1707598) (← links)
- On deciding subsumption problems (Q1777407) (← links)
- Quantifier elimination for infinite terms (Q1812980) (← links)
- Explicit versus implicit representations of subsets of the Herbrand universe. (Q1853582) (← links)
- Working with ARMs: Complexity results on atomic representations of Herbrand models (Q1854418) (← links)
- The first order theory of primal grammars is decidable (Q1882903) (← links)
- Positive and negative results for higher-order disunification (Q1914170) (← links)
- On inductive inference of cyclic structures (Q1924733) (← links)
- A procedure for deciding symbolic equivalence between sets of constraint systems (Q2013557) (← links)
- On solving nominal disunification constraints (Q2219072) (← links)
- Nominal equational problems (Q2233392) (← links)
- Combining induction and saturation-based theorem proving (Q2303240) (← links)
- Decision procedures for term algebras with integer constraints (Q2432767) (← links)
- Equational formulas and pattern operations in initial order-sorted algebras (Q2628298) (← links)
- Generalizing DPLL and satisfiability for equalities (Q2643080) (← links)
- Extending Unification in $\mathcal{EL}$ to Disunification: The Case of Dismatching and Local Disunification (Q2974785) (← links)
- (Q3129297) (← links)
- On the cooperation of the constraint domains ℋ, ℛ, and ℱ in CFLP (Q3183129) (← links)
- Symbolic Protocol Analysis with Disequality Constraints Modulo Equational Theories (Q3460872) (← links)
- Accepting/rejecting propositions from accepted/rejected propositions: A unifying overview (Q3537540) (← links)
- Superposition for Fixed Domains (Q3540186) (← links)
- Deciding the Inductive Validity of ∀ ∃ * Queries (Q3644758) (← links)
- (Q3839876) (← links)
- Simplifying and generalizing formulae in tableaux. Pruning the search space and building models (Q4610336) (← links)
- An improved lower bound for the elementary theories of trees (Q4647523) (← links)
- Rewrite semantics for production rule systems: Theory and applications (Q4647544) (← links)
- Variant-Based Satisfiability in Initial Algebras (Q4686604) (← links)
- (Q4790398) (← links)
