Nondeterminism through well-founded choice


AbstractThis paper introduces nondeterminism into logic programs with negation by associating functional dependencies with some predicates, and develops the well-founded choice semantics. Each program has at least one well-founded choice model. The well-founded choice semantics extends the well-founded semantics with nondeterminism, while maintaining the robustness and polynomial time data complexity of the well-founded semantics. It generalizes the stable model semantics of Datalog with choice to logic programs with negation, and yet avoids the problem of NP-completeness of the existence of stable models in general. Although model-theoretic in nature, the well-founded choice semantics expresses precisely nondeterministic polynomial-time queries (NDB-PTIME). We present a nondeterministic fixpoint semantics that is sound and complete with respect to the well-founded choice semantics

Similar works

Full text


Elsevier - Publisher Connector

Provided original full text link
Last time updated on 6/5/2019

This paper was published in Elsevier - Publisher Connector .

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.