846 search results - page 4 / 170 » On the Computational Complexity of Spatio-Temporal Logics |
112
Voted
ICTCS
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...
FCT
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. In the paper we present a purely logical approach to estimating computational complexity of potentially intractable problems. The approach is based on descriptive complex...
68
Voted
LICS
2006
IEEE
15 years 6 months ago
2006
IEEE
83
Voted
ICLP
1992
Springer
15 years 4 months ago
1992
Springer
59
Voted
IGPL
2000
15 years 7 days ago
2000
