21 search results - page 3 / 5 » Complexity of semi-stable and stage semantics in argumentati... |
RR
2010
Springer
13 years 7 months ago
2010
Springer
Defeasible reasoning has been studied extensively in the last two decades and many different and dissimilar approaches are currently on the table. This multitude of ideas has made...
AI
2002
Springer
13 years 8 months ago
2002
Springer
Systems provide a rich abstraction within which divers concepts of reasoning, acceptability and defeasibility of arguments, etc., may be studied using a unified framework. Two imp...
WISE
2009
Springer
14 years 5 months ago
2009
Springer
The visual creation tools in the mashup frameworks are supposed to be simple and accessible. Yet at the same time there is a need to extend the capabilities and complexity of mashu...
KBSE
2007
IEEE
14 years 2 months ago
2007
IEEE
Achieving high structural coverage such as branch coverage in objectoriented programs is an important and yet challenging goal due to two main challenges. First, some branches inv...
ICFP
1999
ACM
14 years 25 days ago
1999
ACM
Run-time type dispatch enables a variety of advanced optimization techniques for polymorphic languages, including tag-free garbage collection, unboxed function arguments, and fla...