124 search results - page 7 / 25 » The Undecidability of the Generalized Collatz Problem |
AIML
2008
13 years 8 months ago
2008
We provide proof-theoretic results about deliberative STIT logic. First we present STIT logic for individual agents without time, where the problem of satisfiability has recently b...
ICDT
2011
ACM
12 years 11 months ago
2011
ACM
Distributed data management systems consist of peers that store, exchange and process data in order to collaboratively achieve a common goal, such as evaluate some query. We study...
TACAS
2012
Springer
12 years 2 months ago
2012
Springer
Abstract. The pairwise reachability problem for a multi-threaded program asks, given control locations in two threads, whether they can be simultaneously reached in an execution of...
LATA
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. Iterated schemata allow to define infinite languages of propositional formulae through formulae patterns. Formally, schemata extend propositional logic with new (generali...
FOSSACS
2010
Springer
14 years 2 months ago
2010
Springer
This paper presents a range of quantitative extensions for the temporal logic CTL. We enhance temporal modalities with the ability to constrain the number of states satisfying cert...