The following pages link to (Q4264721):
Displaying 22 items.
- Redundancy criteria for constrained completion (Q673620) (← links)
- A total AC-compatible ordering based on RPO (Q673623) (← links)
- Simple LPO constraint solving methods (Q685481) (← links)
- Superposition theorem proving for abelian groups represented as integer modules (Q1275020) (← links)
- The first-order theory of lexicographic path orderings is undecidable (Q1392274) (← links)
- Practical algorithms for deciding path ordering constraint satisfaction. (Q1400710) (← links)
- Linear and unit-resulting refutations for Horn theories (Q1923821) (← links)
- Extensional higher-order paramodulation in Leo-III (Q2666959) (← links)
- (Q4222859) (← links)
- R n - and G n -logics (Q4645806) (← links)
- Theorem proving in cancellative abelian monoids (extended abstract) (Q4647536) (← links)
- Harald Ganzinger’s Legacy: Contributions to Logics and Programming (Q4916069) (← links)
- About the theory of tree embedding (Q5044749) (← links)
- Redundancy criteria for constrained completion (Q5055781) (← links)
- A precedence-based total AC-compatible ordering (Q5055808) (← links)
- Polynomial time termination and constraint satisfaction tests (Q5055810) (← links)
- On narrowing, refutation proofs and constraints (Q5055818) (← links)
- Superposition theorem proving for abelian groups represented as integer modules (Q5055850) (← links)
- Local simplification (Q5096297) (← links)
- Solving simplification ordering constraints (Q5096318) (← links)
- Associative-commutative deduction with constraints (Q5210795) (← links)
- AC-superposition with constraints: No AC-unifiers needed (Q5210796) (← links)
