528 search results - page 12 / 106 » Transition Logic Revisited |
105
click to vote
TARK
2005
Springer
15 years 7 months ago
2005
Springer
We analyze a model of interactive unawareness introduced by Heifetz, Meier and Schipper (HMS). We consider two axiomatizations for their model, which capture different notions of ...
116
click to vote
ECP
1997
Springer
15 years 6 months ago
1997
Springer
In 1969 Cordell Green presented his seminal description of planning as theorem proving with the situation calculus. The most pleasing feature of Green's account was the negli...
105
Voted
DLOG
2009
14 years 11 months ago
2009
Abstract. We show that the description logic SOQ with number restrictions on transitive roles is decidable by a terminating tableau calculus. The language decided by the calculus i...
144
Voted
DALT
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We describe a model-checking based approach to verification of programs written in the agent programming language Dribble. We define a logic (an extension of the branch...
111
Voted
LICS
1999
IEEE
15 years 6 months ago
1999
IEEE
An important open question in complexity theory is whether the circuit complexity class TC0 is (strictly) weaker than LOGSPACE. This paper considers this question from the viewpoi...