Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2009

2009

Fixpoint semantics are provided for ambiguity blocking and propagating variants of Nute’s defeasible logic. The semantics are… Expand

2009

2009

Boolean grammars [A. Okhotin, Boolean grammars, Information and Computation 194 (1) (2004) 19-48] are a promising extension of… Expand

2006

2006

We propose a solution to a long-standing problem in the foundations of well-founded semantics (WFS) for logic programs. The… Expand

Highly Cited

1997

Highly Cited

1997

The Smodels system is a C++ implementation of the well-founded and stable model semantics for range-restricted function-free… Expand

Highly Cited

1996

Highly Cited

1996

The paper describes an extension of well-founded semantics for logic programs with two types of negation. In this extension… Expand

1995

1995

We address methods of speeding up the calculation of the well-founded semantics for normal propositional logic programs. We first… Expand

Highly Cited

1991

Highly Cited

1991

A general logic program (abbreviated to "program" hereafter) is a set of roles that have both positive and negative subgoals. It… Expand

1991

1991

Classical fixpoint semantics for logic programs is based on the T P immediate consequence operator. The Kripke/Kleene, three… Expand

Highly Cited

1990

Highly Cited

1990

We introduce 3-valued stable models which are a natural generalization of standard (2-valued) stable models. We show that every… Expand

Highly Cited

1988

Highly Cited

1988

A general logic program (abbreviated to “program” hereafter) is a set of rules that have both positive and negative subgoals. It… Expand