846 search results - page 44 / 170 » On the Computational Complexity of Spatio-Temporal Logics |
132
click to vote
JSAI
2007
Springer
15 years 5 months ago
2007
Springer
CF-induction is a sound and complete hypothesis finding procedure for full clausal logic which uses the principle of inverse entailment to compute a hypothesis that logically expl...
APAL
2010
14 years 11 months ago
2010
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in...
133
click to vote
DIMACS
1996
15 years 13 days ago
1996
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
AAAI
2007
15 years 1 months ago
2007
This paper presents both a semantic and a computational model for multi-agent belief revision. We show that these two models are equivalent but serve different purposes. The seman...
108
click to vote
IPPS
2007
IEEE
15 years 5 months ago
2007
IEEE
This paper presents a new and retargetable method to identify patterns of instructions with direct support in coarsegrained processing elements (PEs). The method uses a three-addr...