On narrowing, refutation proofs and constraints

DOI10.1007/3-540-59200-8_47zbMATH Open1503.03019OpenAlexW1576882193MaRDI QIDQ5055818FDOQ5055818

Authors: Robert Nieuwenhuis 

Publication date: 9 December 2022

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59200-8_47

Recommendations

• scientific article; zbMATH DE number 549952
• scientific article; zbMATH DE number 1765670
• On the connection between narrowing and proof by consistency
• Conditional narrowing modulo a set of equations
• A needed narrowing strategy

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35)

Cites Work

• Rewrite-based Equational Theorem Proving with Selection and Simplification
• Title not available (Why is that?)
• Title not available (Why is that?)
• AC-superposition with constraints: no AC-unifiers needed
• Basic narrowing revisited
• Title not available (Why is that?)
• Narrowing vs. SLD-resolution
• Foundations of equational logic programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• A precedence-based total AC-compatible ordering
• Completion of first-order clauses with equality by strict superposition
• Associative-commutative deduction with constraints
• An optimal narrowing strategy for general canonical systems

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
• Title not available (Why is that?)

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)