Sciweavers

206 search results - page 6 / 42
» Specification and Complexity of Strategic-Based Reasoning Us...
Sort
View
IJCAI
1989
14 years 10 months ago
Preferred Subtheories: An Extended Logical Framework for Default Reasoning
We present a general framework for defining nonmonotonic systems based on the notion of preferred maximal consistent subsets of the premises. This framework subsumes David Poole&#...
Gerhard Brewka
STOC
2005
ACM
130views Algorithms» more  STOC 2005»
15 years 9 months ago
From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
Eli Gafni, Rachid Guerraoui, Bastian Pochon
ECAI
1992
Springer
15 years 1 months ago
On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning
ABSTRACT. This paper investigates the problem of finding subclasses of nonmonotonic reasoning which can be implemented efficiently. The ability to "define" propositions u...
Ilkka Niemelä, Jussi Rintanen
AI
2002
Springer
14 years 9 months ago
Coherence in finite argument systems
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...
Paul E. Dunne, Trevor J. M. Bench-Capon
CLIMA
2006
14 years 11 months ago
An Argumentation-Based Negotiation for Distributed Extended Logic Programs
Abstract. The paradigm of argumentation has been used in the literature to assign meaning to knowledge bases in general, and logic programs in particular. With this paradigm, rules...
Iara Carnevale de Almeida, José Júli...