On narrowing, refutation proofs and constraints
From MaRDI portal
Publication:5055818
Recommendations
Cites work
- scientific article; zbMATH DE number 3921947 (Why is no real title available?)
- scientific article; zbMATH DE number 3688776 (Why is no real title available?)
- scientific article; zbMATH DE number 1348468 (Why is no real title available?)
- scientific article; zbMATH DE number 1348470 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- A precedence-based total AC-compatible ordering
- AC-superposition with constraints: no AC-unifiers needed
- An optimal narrowing strategy for general canonical systems
- Associative-commutative deduction with constraints
- Basic narrowing revisited
- Completion of first-order clauses with equality by strict superposition
- Foundations of equational logic programming
- Narrowing vs. SLD-resolution
- Rewrite-based Equational Theorem Proving with Selection and Simplification
Cited in
(5)- Narrowing based inductive proof search
- Decidability and complexity analysis by basic paramodulation
- Narrowing, Abstraction and Constraints for Proving Properties of Reduction Relations
- On the connection between narrowing and proof by consistency
- scientific article; zbMATH DE number 4164122 (Why is no real title available?)
This page was built for publication: On narrowing, refutation proofs and constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055818)