186 search results - page 25 / 38 » Preference-Based Default Reasoning |
ECAI
1998
Springer
13 years 11 months ago
1998
Springer
We present probabilistic logic programming under inheritance with overriding. This approach is based on new notions of entailment for reasoning with conditional constraints, which...
NMR
2004
Springer
14 years 27 days ago
2004
Springer
conflicts between goals and plans in Dung’s abstract argumentation framework. Argumentation theory has traditionally been used to deal with conflicts between defaults and beli...
IFL
2005
Springer
14 years 1 months ago
2005
Springer
In programs written in lazy functional languages such as for example Clean and Haskell, the programmer can choose freely whether particular subexpressions will be evaluated lazily ...
AIPS
2011
12 years 11 months ago
2011
Engineering complete planning domain descriptions is often very costly because of human error or lack of domain knowledge. Learning complete domain descriptions is also very chall...
ECAI
1992
Springer
13 years 11 months ago
1992
Springer
We consider non-Horn Deductive Data Bases (DDB) represented in a First Order language without function symbols. In this context the DDB is an incomplete description of the world. ...