827 search results - page 100 / 166 » Proof-Theoretic Soundness and Completeness |
INFORMATICALT
2007
14 years 10 months ago
2007
In this paper we consider branching time temporal logics of knowledge and belief. These logics involve the discrete time linear temporal logic operators “next” and “until” ...
AMAI
2004
Springer
14 years 10 months ago
2004
Springer
Sequential von Neumann-Morgernstern (VM) games are a very general formalism for representing multi-agent interactions and planning problems in a variety of types of environments. ...
ENTCS
2002
14 years 10 months ago
2002
Building on previous work [15,8], this paper describes two syntactic ways of defining `well-behaved' operational semantics for timed processes. In both cases, the rules are d...
ENTCS
2002
14 years 10 months ago
2002
We present a variant of the linear logical framework LLF that avoids the restriction l-typed terms be in pre-canonical form and adds -abstraction at the level of families. We aban...
JLP
2000
14 years 9 months ago
2000
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...