4978 search results - page 123 / 996 » Logical models of argument |
130
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
The methods used to establish PSPACE-bounds for modal logics can roughly be grouped into two classes: syntax driven methods establish that exhaustive proof search can be performed...
115
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Diagrammatic logics were introduced in 2002, with emphasis on the notions of specifications and models. In this paper we improve the description of the inference process, which i...
145
click to vote
LFCS
2007
Springer
15 years 10 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...
167
click to vote
CONCUR
2011
Springer
14 years 3 months ago
2011
Springer
Probabilistic nondeterministic processes are commonly modeled as probabilistic LTSs (PLTSs, a.k.a. probabilistic automata). A number of logical characterizations of the main behavi...