Acceptable Programs Revisited

TL;DR: This paper analyses and characterize classes of normal logic programs that have the property that every program in the class has a unique two-valued supported model by means of operators on three-valued logics and shows that the class of Φ*-accessible programs is computationally adequate.

TL;DR: In this paper, the authors classify programs and queries according to the selection rules for which they terminate, and propose a semantics-preserving transformation from programs with bounded nondeterminism into strongly terminating programs.

TL;DR: It is shown that the immediate consequence operator associated with each logic program can be approximated by 3-layer feedforward neural networks arbitrarily well in a certain measure-theoretic sense.

TL;DR: The correspondence of the Gelfond-Lifschitz operator of P coincides with the immediate consequence operator of fix(P), and carries over to standard operators used for characterizing the well-founded and the Kripke-Kleene semantics.

TL;DR: This book discusses Negation in Logic Programming, a Theory of Declarative Knowledge, and its Applications in Deductive Databases and Implementation, as well as other topics.

TL;DR: The use of conventional classical logic is misleading for characterizing the behavior of logic programs because a logic program, when queried, will do one of three things: succeed with the query, fail with it, or not respond because it has fallen into infinite backtracking.