150 search results - page 8 / 30 » Complexity of the Unique Extension Problem in Default Logic |
ATAL
2006
Springer
15 years 1 months ago
2006
Springer
We investigate the computational complexity of reasoning about multi-agent systems using the cooperation logic ATL of Alur, Henzinger, and Kupferman. It is known that satisfiabili...
RR
2010
Springer
14 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...
IJCAI
2003
14 years 10 months ago
2003
Disjunctive Logic Programming (DLP) is a very expressive formalism: it allows to express every property of finite structures that is decidable in the complexity class ¡£¢¤ (...
FORMATS
2008
Springer
14 years 11 months ago
2008
Springer
The common metric temporal logics for continuous time were shown to be insufficient, when it was proved in [7, 12] that they cannot express a modality suggested by Pnueli. Moreover...
123
click to vote
FROCOS
2009
Springer
15 years 4 months ago
2009
Springer
We investigate the temporal extension of the description logic DL-Lite(RN ) bool with the until operator on concepts, rigid (time-independent) and local (time-dependent) roles, and...