2035 search results - page 38 / 407 » On the complexity of stratified logics |
167
click to vote
LICS
1999
IEEE
15 years 10 months ago
1999
IEEE
An important open question in complexity theory is whether the circuit complexity class TC0 is (strictly) weaker than LOGSPACE. This paper considers this question from the viewpoi...
166
click to vote
FOSSACS
2008
Springer
15 years 7 months ago
2008
Springer
Coalgebras provide a uniform framework for the semantics of a large class of (mostly non-normal) modal logics, including e.g. monotone modal logic, probabilistic and graded modal l...
140
click to vote
CSMR
1998
IEEE
15 years 10 months ago
1998
IEEE
AbstractA large body of research in the measurement of software complexity has been focused on imperative programs, but little eort has been made for logic programs. In this paper,...
153
click to vote
ECCC
2007
15 years 6 months ago
2007
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
139
click to vote
ICCD
1992
IEEE
15 years 10 months ago
1992
IEEE
ct Digital's NVAX high-performance microprocessor has a complex logical design. A rigorous simulation-based verification effort was undertaken to ensure that there were no log...