Semantic Scholar uses AI to extract papers important to this topic.
Fixpoint semantics are provided for ambiguity blocking and propagating variants of Nute’s defeasible logic. The semantics are… Expand Boolean grammars [A. Okhotin, Boolean grammars, Information and Computation 194 (1) (2004) 19-48] are a promising extension of… Expand We propose a solution to a long-standing problem in the foundations of well-founded semantics (WFS) for logic programs. The… Expand The Smodels system is a C++ implementation of the well-founded and stable model semantics for range-restricted function-free… Expand The paper describes an extension of well-founded semantics for logic programs with two types of negation. In this extension… Expand We address methods of speeding up the calculation of the well-founded semantics for normal propositional logic programs. We first… Expand A general logic program (abbreviated to "program" hereafter) is a set of roles that have both positive and negative subgoals. It… Expand Classical fixpoint semantics for logic programs is based on the T P immediate consequence operator. The Kripke/Kleene, three… Expand We introduce 3-valued stable models which are a natural generalization of standard (2-valued) stable models. We show that every… Expand A general logic program (abbreviated to “program” hereafter) is a set of rules that have both positive and negative subgoals. It… Expand