Equality and abductive residua for Horn clauses
From MaRDI portal
Publication:689280
DOI10.1016/0304-3975(93)90243-MzbMath0788.68133MaRDI QIDQ689280
P. T. Cox, Emanuel Knill, Tomasz Pietrzykowski
Publication date: 20 December 1993
Published in: Theoretical Computer Science (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Quantifier-Free Equational Logic and Prime Implicate Generation ⋮ A superposition calculus for abductive reasoning ⋮ Probabilistic Horn abduction and Bayesian networks
Cites Work
- Abduction versus closure in causal theories.
- Incorporating equality into logic programming via surface deduction
- A logical framework for default reasoning
- Linear unification
- Foundations of equational logic programming
- A logical reconstruction of Prolog II
- Proving Theorems with the Modification Method
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Equality and abductive residua for Horn clauses
