Three-valued completion for abductive logic programs
From MaRDI portal
Publication:671511
DOI10.1016/0304-3975(96)00044-8zbMath0872.68020OpenAlexW2119966759MaRDI QIDQ671511
Publication date: 27 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/2192
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Model theory.
- On the Relationship Between Abduction and Deduction
- A kripke-kleene semantics for logic programs*
- Negation in logic programming
- SLDNFA: An abductive procedure for abductive logic programs
- Short note preferred extensions are partial stable models
- Representing Incomplete Knowledge in Abductive Logic Programming
- Abductive Logic Programming
This page was built for publication: Three-valued completion for abductive logic programs
