346 search results - page 30 / 70 » Logical omniscience as a computational complexity problem |
AGI
2008
13 years 9 months ago
2008
Inhabiting the complex and dynamic environments of modern computer games with autonomous agents capable of intelligent timely behaviour is a significant research challenge. We illu...
AMAI
2004
Springer
13 years 7 months ago
2004
Springer
We introduce the notion of combinatorial vote, where a group of agents (or voters) is supposed to express preferences and come to a common decision concerning a set of non-independ...
CONCUR
2007
Springer
13 years 11 months ago
2007
Springer
We re-examine vacuity in temporal logic model checking. We note two disturbing phenomena in recent results in this area. The first indicates that not all vacuities detected in prac...
KI
2007
Springer
14 years 1 months ago
2007
Springer
Axiom pinpointing has been introduced in description logics (DLs) to help the user understand the reasons why consequences hold by computing minimal subsets of the knowledge base t...
LICS
2005
IEEE
14 years 1 months ago
2005
IEEE
In recent work Baader has shown that a certain description logic with conjunction, existential quantification and with circular definitions has a polynomial time subsumption pro...