SLDNFA: An abductive procedure for abductive logic programs
- 28 February 1998
- journal article
- Published by Elsevier in The Journal of Logic Programming
- Vol. 34 (2) , 111-167
- https://doi.org/10.1016/s0743-1066(97)00074-5
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- The IFF proof procedure for abductive logic programmingThe Journal of Logic Programming, 1997
- Representing Incomplete Knowledge in Abductive Logic ProgrammingJournal of Logic and Computation, 1995
- What is failure? An approach to constructive negationActa Informatica, 1995
- A new definition of SLDNF-resolutionThe Journal of Logic Programming, 1994
- Abductive Logic ProgrammingJournal of Logic and Computation, 1992
- Updating knowledge bases IINew Generation Computing, 1991
- On the Relationship Between Abduction and DeductionJournal of Logic and Computation, 1991
- Negation in logic programmingThe Journal of Logic Programming, 1987
- A kripke-kleene semantics for logic programs*The Journal of Logic Programming, 1985
- Properties of substitutions and unificationsJournal of Symbolic Computation, 1985