A transformational approach to negation in logic programming
From MaRDI portal
Publication:4713088
DOI10.1016/0743-1066(90)90023-XzbMath0796.68056MaRDI QIDQ4713088
Dino Pedreschi, Roberto Barbuti, Franco Turini, Paolo Mancarella
Publication date: 25 June 1992
Published in: The Journal of Logic Programming (Search for Journal in Brave)
completeness; logic programming; soundness; negation as failure; negative information; SLDN refutation
Related Items
Constructive negation and constraint logic programming with sets, Implementing constructive intensional negation, Transforming normal logic programs to constraint logic programs, Equivalence-preserving first-order unfold/fold transformation systems, Probabilistic Horn abduction and Bayesian networks, Sound and complete partial deduction with unfolding based on well-founded measures, Implementing specifications by dynamic inheritance, What is failure? An approach to constructive negation, Model building with ordered resolution: Extracting models from saturated clause sets