Sciweavers

7988 search results - page 10 / 1598
» A Useful Undecidable Theory
Sort
View
ATAL
2010
Springer
13 years 8 months ago
Strategic planning for probabilistic games with incomplete information
Alternating-time Temporal Logic (ATL) [1] is used to reason about strategic abilities of agents. Aiming at strategies that can realistically be implemented in software, many varia...
Henning Schnoor
CORR
2007
Springer
99views Education» more  CORR 2007»
13 years 7 months ago
Periodic complementary sets of binary sequences
Let PCSN p denote a set of p binary sequences of length N such that the sum of their periodic auto-correlation functions is a δ-function. In the 1990, B¨omer and Antweiler addres...
Dragomir Z. Djokovic
FORMATS
2005
Springer
14 years 1 months ago
Reachability Problems on Extended O-Minimal Hybrid Automata
Within hybrid systems theory, o-minimal automata are often considered on the border between decidability and undecidability. In such classes of hybrid automata, the constraint of h...
Raffaella Gentilini
POPL
2002
ACM
14 years 7 months ago
The first-order theory of subtyping constraints
We investigate the first-order theory of subtyping constraints. We show that the first-order theory of nonstructural subtyping is undecidable, and we show that in the case where a...
Zhendong Su, Alexander Aiken, Joachim Niehren, Tim...
KGC
1997
Springer
13 years 11 months ago
Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory
Rice’s Theorem says that every nontrivial semantic property of programs is undecidable. In this spirit we show the following: Every nontrivial absolute (gap, relative) counting p...
Bernd Borchert, Frank Stephan