A transformational approach to negation in logic programming

DOI10.1016/0743-1066(90)90023-XzbMath0796.68056MaRDI QIDQ4713088

Franco Turini, Dino Pedreschi, Roberto Barbuti, Paolo Mancarella

Publication date: 25 June 1992

Published in: The Journal of Logic Programming (Search for Journal in Brave)

zbMATH Keywords

completenesslogic programmingsoundnessnegation as failurenegative informationSLDN refutation

Mathematics Subject Classification ID

Logic programming (68N17) General topics in the theory of software (68N01)

Related Items

Implementing specifications by dynamic inheritance, A necessary condition for constructive negation in constraint logic programming, Implementing constructive intensional negation, Synthesis of positive logic programs for checking a class of definitions with infinite quantification, What is failure? An approach to constructive negation, Automated reasoning with restricted intensional sets, Eliminating negation from normal logic programs, An operator for composing deductive data bases with theories of constraints, αCheck: A mechanized metatheory model checker, Model building with ordered resolution: Extracting models from saturated clause sets, Transforming normal logic programs to constraint logic programs, Equivalence-preserving first-order unfold/fold transformation systems, Constructive negation and constraint logic programming with sets, Extending Constructive Logic Negation with Types, Probabilistic Horn abduction and Bayesian networks, Sound and complete partial deduction with unfolding based on well-founded measures