5 search results - page 1 / 1 » Rational Closure for Defeasible Description Logics |
JELIA
2010
Springer
13 years 3 months ago
2010
Springer
In the field of non-monotonic logics, the notion of rational closure is acknowledged as a landmark, and we are going to see that such a construction can be characterised by means o...
COMMA
2008
13 years 6 months ago
2008
Abstract. Possibilistic Defeasible Logic Programming (P-DeLP) is an argumentation framework based on logic programming which incorporates a treatment of possibilistic uncertainty a...
DLOG
2011
12 years 9 months ago
2011
Abstract. The preferential and rational consequence relations first studied by Lehmann and colleagues play a central role in non-monotonic reasoning, not least because they provid...
AI
1998
Springer
13 years 5 months ago
1998
Springer
This paper addresses the logical foundations of goal-regression planning in autonomous rational agents. It focuses mainly on three problems. The first is that goals and subgoals w...
AI
2007
Springer
13 years 5 months ago
2007
Springer
Argumentation theory has become an important topic in the field of AI. The basic idea is to construct arguments in favor and against a statement, to select the “acceptable” o...