LFCS
2007
Springer
14 years 7 months ago
2007
Springer
We combine first-order dynamic logic for reasoning about possible behaviour of hybrid systems with temporal logic for reasoning about the temporal behaviour during their operation...
LFCS
2007
Springer
14 years 7 months ago
2007
Springer
LP can be seen as a logic of knowledge with justifications. Artemov’s Realization Theorem says justifications can be extracted from validities in the more conventional Hintikk...
LFCS
2007
Springer
14 years 7 months ago
2007
Springer
LFCS
2007
Springer
14 years 7 months ago
2007
Springer
Density elimination by substitutions is introduced as a uniform method for removing applications of the Takeuti-Titani density rule from proofs in firstorder hypersequent calculi....
LFCS
2007
Springer
14 years 7 months ago
2007
Springer
Interval-based temporal logics are an important research area in computer science and artificial intelligence. In this paper we investigate decidability and expressiveness issues ...
LFCS
2007
Springer
14 years 7 months ago
2007
Springer
Abstract. In order to verify programs with pointer variables, we introduce a temporal logic LTLmem whose underlying assertion language is the quantifier-free fragment of separatio...