Sciweavers

156 search results - page 15 / 32
» Decidability and Undecidability in Probability Logic
Sort
View
STACS
2007
Springer
14 years 2 months ago
Reachability in Unions of Commutative Rewriting Systems Is Decidable
We consider commutative string rewriting systems (Vector Addition Systems, Petri nets), i.e., string rewriting systems in which all pairs of letters commute. We are interested in r...
Mikolaj Bojanczyk, Piotr Hoffman
TARK
2007
Springer
14 years 2 months ago
From conditional probability to the logic of doxastic actions
We investigate the discrete (finite) case of the Popper-Renyi theory of conditional probability, introducing discrete conditional probabilistic models for (multi-agent) knowledge...
Alexandru Baltag, Sonja Smets
LICS
2010
IEEE
13 years 7 months ago
Alternating Timed Automata over Bounded Time
Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Boolean operations. They have played a key role, among others, ...
Mark Jenkins, Joël Ouaknine, Alexander Rabino...
CORR
2008
Springer
121views Education» more  CORR 2008»
13 years 8 months ago
Separability in the Ambient Logic
Abstract. The Ambient Logic (AL) has been proposed for expressing properties of process mobility in the calculus of Mobile Ambients (MA), and as a basis for query languages on semi...
Daniel Hirschkoff, Étienne Lozes, Davide Sa...
JSYML
2002
170views more  JSYML 2002»
13 years 8 months ago
Representability in Second-Order Propositional Poly-Modal Logic
A propositional system of modal logic is second-order if it contains quantifiers p and p, which, in the standard interpretation, are construed as ranging over sets of possible worl...
Gian Aldo Antonelli, Richmond H. Thomason