Predicate Completion for non-Horn Clause Sets
From MaRDI portal
Publication:5200033
DOI10.1007/978-3-642-22438-6_24zbMath1341.68022OpenAlexW89475911MaRDI QIDQ5200033
Publication date: 29 July 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22438-6_24
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Equational problems and disunification
- A logic for default reasoning
- Equational formulae with membership constraints
- Non-Horn clause logic programming
- Induction = I-axiomatization + first-order consistency.
- Superposition for fixed domains
- Disunification for Ultimately Periodic Interpretations
- Representing action and change by logic programs
- Rewrite-based Equational Theorem Proving with Selection and Simplification
- Decidability Results for Saturation-Based Model Building
- System Description: SPASS-FD
This page was built for publication: Predicate Completion for non-Horn Clause Sets
