Sciweavers

40 search results - page 2 / 8
» Nonmonotonic Reasoning with Well Founded Semantics
Sort
View
RR
2007
Springer
13 years 11 months ago
Decidability Under the Well-Founded Semantics
The well-founded semantics (WFS) for logic programs is one of the few major paradigms for closed-world reasoning. With the advent of the Semantic Web, it is being used as part of r...
Natalia Cherchago, Pascal Hitzler, Steffen Hö...
CADE
2001
Springer
14 years 5 months ago
A Top-Down Procedure for Disjunctive Well-Founded Semantics
Abstract. Skepticism is one of the most important semantic intuitions in artificial intelligence. The semantics formalizing skeptical reasoning in (disjunctive) logic programming i...
Kewen Wang
LPNMR
2001
Springer
13 years 9 months ago
A Comparative Study of Well-Founded Semantics for Disjunctive Logic Programs
Much work has been done on extending the well-founded semantics to general disjunctive logic programs and various approaches have been proposed. However, no consensus has been reac...
Kewen Wang
ASP
2001
Springer
13 years 9 months ago
Well Founded Semantics as Two dimensional Here and There
This workpresents a newlogical characterization of well foundedsemanticsthat provides, as interesting innovation, a fully semantic-oriented treatment of programconnectives without...
Pedro Cabalar
ICLP
2009
Springer
14 years 1 days ago
An Engine for Computing Well-Founded Models
The seemingly simple choice of whether to use call variance or call subsumption in a tabled evaluation deeply affects an evaluation’s properties. Most tabling implementations hav...
Terrance Swift