846 search results - page 38 / 170 » On the Computational Complexity of Spatio-Temporal Logics |
CAMP
2005
IEEE
15 years 4 months ago
2005
IEEE
Abstract— The promise of next-generation computer technologies, such as nano-electronics, implies a number of serious alterations to the design flow of digital circuits. One of ...
117
click to vote
WOLLIC
2009
Springer
15 years 5 months ago
2009
Springer
The paper provides a recipe for adequately representing a very inclusive class of finite-valued logics by way of tableaux. The only requisite for applying the method is that the o...
DAC
1996
ACM
15 years 3 months ago
1996
ACM
Logic synthesis systems are complex systems and algorithmic research in synthesis has become highly specialized. This creates a gap where it is often not clear how an advance in a...
AUSAI
2006
Springer
15 years 2 months ago
2006
Springer
This paper explores logical properties of belief-revision-based bargaining solution. We first present a syntax-independent construction of bargaining solution based on prioritized ...
LICS
2008
IEEE
15 years 5 months ago
2008
IEEE
The question of whether there is a logic that captures polynomial time is the central open problem in descriptive complexity theory. In my talk, I will review the question and the...