Pages that link to "Item:Q3912070"
From MaRDI portal
The following pages link to A Unification Algorithm for Associative-Commutative Functions (Q3912070):
Displaying 50 items.
- Mark Stickel: his earliest work (Q287332) (← links)
- Semantically-guided goal-sensitive reasoning: model representation (Q287333) (← links)
- On the complexity of deduction modulo leaf permutative equations (Q556681) (← links)
- Unification in commutative theories (Q582071) (← links)
- Unification in Boolean rings and Abelian groups (Q582073) (← links)
- Unification in a combination of arbitrary disjoint equational theories (Q582270) (← links)
- Towards a foundation of completion procedures as semidecision procedures (Q673134) (← links)
- Complexity of unification problems with associative-commutative operators (Q688565) (← links)
- On the parameterized complexity of associative and commutative unification (Q729894) (← links)
- Refutational theorem proving using term-rewriting systems (Q802317) (← links)
- Permutative rewriting and unification (Q876048) (← links)
- A superposition oriented theorem prover (Q1060857) (← links)
- On unification: Equational theories are not bounded (Q1094131) (← links)
- Complexity of matching problems (Q1099615) (← links)
- Associative-commutative unification (Q1099648) (← links)
- Unification in combinations of collapse-free regular theories (Q1099652) (← links)
- An algebraic approach to unification under associativity and commutativity (Q1099654) (← links)
- Embedding Boolean expressions into logic programming (Q1100935) (← links)
- History and basic features of the critical-pair/completion procedure (Q1103414) (← links)
- Only prime superpositions need be considered in the Knuth-Bendix completion procedure (Q1106657) (← links)
- Unification in commutative idempotent monoids (Q1111775) (← links)
- Efficient solution of linear diophantine equations (Q1121310) (← links)
- Combination of constraint solvers for free and quasi-free structures (Q1127338) (← links)
- Completion for unification (Q1178701) (← links)
- AC-unification race: The system solving approach, implementation and benchmarks (Q1199708) (← links)
- A new method for undecidability proofs of first order theories (Q1209623) (← links)
- Completion for rewriting modulo a congruence (Q1262752) (← links)
- Adventures in associative-commutative unification (Q1262757) (← links)
- Unification problem in equational theories (Q1280985) (← links)
- Competing for the \(AC\)-unification race (Q1319390) (← links)
- Unification in partially commutative semigroups (Q1337561) (← links)
- Automated deduction with associative-commutative operators (Q1340508) (← links)
- Avoiding slack variables in the solving of linear diophantine equations and inequations (Q1391934) (← links)
- Ramification and causality (Q1399132) (← links)
- Type dependencies for logic programs using ACI-unification (Q1575243) (← links)
- Complete sets of unifiers and matchers in equational theories (Q1820760) (← links)
- Unification in permutative equational theories is undecidable (Q1825190) (← links)
- Unification algorithms cannot be combined in polynomial time. (Q1854364) (← links)
- Constructing orthogonal designs in powers of two via symbolic computation and rewriting techniques (Q2294604) (← links)
- Alternating two-way AC-tree automata (Q2373699) (← links)
- Linear groupoids and the associated wreath products. (Q2456592) (← links)
- Abstraction and resolution modulo AC: How to verify Diffie--Hellman-like protocols automatically (Q2484410) (← links)
- Unification of drags and confluence of drag rewriting (Q2683036) (← links)
- History and Prospects for First-Order Automated Deduction (Q3454079) (← links)
- Unnecessary inferences in associative-commutative completion procedures (Q3489486) (← links)
- On the unification problem for Cartesian closed categories (Q4358059) (← links)
- Unification algorithms cannot be combined in polynomial time (Q4647521) (← links)
- Complete sets of reductions modulo associativity, commutativity and identity (Q5055710) (← links)
- Consider only general superpositions in completion procedures (Q5055743) (← links)
- AC unification through order-sorted AC1 unification (Q5055752) (← links)
