778 search results - page 19 / 156 » Expressiveness and complexity of graph logic |
AI
2000
Springer
15 years 8 days ago
2000
Springer
Over the years increasingly sophisticated planning algorithms have been developed. These have made for more efficient planners, but unfortunately these planners still suffer from ...
150
click to vote
DIMACS
1996
15 years 1 months 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...
112
click to vote
MFCS
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. The description of a single state of a modelled system is often complex in practice, but few procedures for synthesis address this problem in depth. We study systems in w...
101
click to vote
CIE
2008
Springer
15 years 2 months ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
107
Voted
ENTCS
2000
15 years 8 days ago
2000
Substitution plays an important role in Hoare Logic, as it is used in interpreting assignments. When writing a computer-based realization of Hoare Logic, it is therefore important...