30 search results - page 2 / 6 » SLT-Resolution for the Well-Founded Semantics |
ICLP
1991
Springer
13 years 9 months ago
1991
Springer
Well Founded Semantics is adequate to capture nonmonotonic reasoning if we interpret the Well Founded model of a program P as a (possibly incomplete) view of the world. Thus the W...
RULEML
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. In this paper we present the well founded variants of ambiguity blocking and ambiguity propagating defeasible logics. We also show how to extend SPINdle, a state of the a...
IJCAI
1989
13 years 7 months ago
1989
A modest exception allowing inheritance reasoner is presented. The reasoner allows restricted, but semantically well founded, defeasible property inheritance. Furthermore, it give...
LPNMR
2001
Springer
13 years 10 months ago
2001
Springer
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...
DOOD
1997
Springer
13 years 10 months ago
1997
Springer
Abstract. We present a well-founded semantics for deductive objectoriented database (dood) languages by applying the alternating- xpoint characterization of the well-founded model ...