846 search results - page 55 / 170 » On the Computational Complexity of Spatio-Temporal Logics |
AGI
2008
15 years 18 days 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...
LICS
2008
IEEE
15 years 5 months ago
2008
IEEE
We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well a...
105
click to vote
LICS
2005
IEEE
15 years 4 months ago
2005
IEEE
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
135
click to vote
CSL
2007
Springer
15 years 5 months ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ...
106
click to vote
PPDP
2010
Springer
14 years 9 months ago
2010
Springer
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...