846 search results - page 43 / 170 » On the Computational Complexity of Spatio-Temporal Logics |
108
Voted
FOCS
1998
IEEE
15 years 3 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
JEC
2006
14 years 11 months ago
2006
Modern digital systems consist of a complex mix of computational resources, e.g. microprocessors, memory elements and reconfigurable logic. System partitioning
FOSSACS
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We introduce an extension of Hoare logic for call-by-value higherorder functions with ML-like local reference generation. Local references may be generated dynamically an...
86
Voted
ICALP
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
KR
1998
Springer
15 years 3 months ago
1998
Springer
Description Logics form a family of formalisms closely related to semantic networks but with the distinguishing characteristic that the semantics of the concept description langua...