257 search results - page 12 / 52 » The Complexity of Model Checking for Propositional Default L... |
PRICAI
2004
Springer
14 years 29 days ago
2004
Springer
In this paper, we extend our earlier work on modelling the mental states of PRS-like agents by considering the dynamics of belief and modelling of action attempts. The major constr...
AAAI
2008
13 years 10 months ago
2008
Many real-world problems are characterized by complex relational structure, which can be succinctly represented in firstorder logic. However, many relational inference algorithms ...
ATAL
2006
Springer
13 years 11 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...
LPAR
2000
Springer
13 years 11 months ago
2000
Springer
In this paper, we determine the complexity of propositional theory curbing. Theory Curbing is a nonmonotonic technique of common sense reasoning that is based on model minimality b...
TABLEAUX
2009
Springer
14 years 2 months ago
2009
Springer
Memory logics are modal logics whose semantics is specified in terms of relational models enriched with additional data structure to represent memory. The logical language is then...