846 search results - page 15 / 170 » On the Computational Complexity of Spatio-Temporal Logics |
ATAL
2006
Springer
14 years 2 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...
FOSSACS
2007
Springer
14 years 2 months ago
2007
Springer
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
FUIN
2007
13 years 10 months ago
2007
Abstract. Our previous research presents a methodology of cooperative problem solving for beliefdesire-intention (BDI) systems, based on a complete formal theory called TEAMLOG. Th...
FSTTCS
2005
Springer
14 years 4 months ago
2005
Springer
We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Light Affine Logic, Elementary Affine Logic, LFPL and Soft Af...
EUROCOLT
1999
Springer
14 years 3 months ago
1999
Springer
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...