12 search results - page 2 / 3 » Complete Axiomatizations of Finite Syntactic Epistemic State... |
BIRTHDAY
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We study a process algebra which combines both nondeterministic and probabilistic behavior in the style of Segala and Lynch’s simple probabilistic automata. We consider...
AMAI
2002
Springer
13 years 4 months ago
2002
Springer
Blocks World (BW) has been one of the most popular model domains in AI history. However, there has not been serious work on axiomatizing the state constraints of BW and giving jus...
FOSSACS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We study a process calculus which combines both nondeterministic and probabilistic behavior in the style of Segala and Lynch’s probabilistic automata. We consider vario...
CORR
2002
Springer
13 years 4 months ago
2002
Springer
Sound and complete axiomatizations are provided for a number of different logics involving modalities for knowledge and time. These logics arise from different choices for various ...
TARK
2007
Springer
13 years 11 months ago
2007
Springer
In this paper we show how coalition logic can be reduced to the fusion of a normal modal STIT logic for agency and a standard normal temporal logic for discrete time, and how this...