346 search results - page 17 / 70 » Logical omniscience as a computational complexity problem |
DLT
2009
13 years 6 months ago
2009
Abstract. Temporal logics are a well investigated formalism for the specification and verification of reactive systems. Using formal verification techniques, we can ensure the corr...
AUTOMATICA
2008
13 years 8 months ago
2008
This paper focuses on the NP-hard problem of reducing the complexity of piecewise polyhedral systems (e.g. polyhedral piecewise affine (PWA) systems). The results are fourfold. Fi...
DAGSTUHL
2003
13 years 10 months ago
2003
In this chapter, we summarize the research on querying inconsistent databases we have been conducting over the last five years. The formal framework we have used is based on two c...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We know that tilesets that can tile the plane always admit a quasiperiodic tiling [4, 8], yet they hold many uncomputable properties [3, 11, 21, 25]. The quasi-periodicit...
FOCS
1998
IEEE
14 years 1 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...