2035 search results - page 180 / 407 » On the complexity of stratified logics |
149
click to vote
COLING
2002
15 years 6 months ago
2002
: Motivated by a systematic representation of the Chinese aspect forms that explores their intrinsic semantics and temporal logical relations, we are constructing a Chinese aspect ...
219
click to vote
IBERAMIA
2010
Springer
15 years 4 months ago
2010
Springer
In a recent paper [2] the authors have formalized a recursive semantics for warranted conclusions in a general defeasible argumentation framework based on a propositional logic. Th...
165
click to vote
CSL
2005
Springer
16 years 2 hour ago
2005
Springer
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...
176
click to vote
CSL
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
188
click to vote
LFCS
2007
Springer
16 years 18 days ago
2007
Springer
We present a general algorithm scheme for model checking logics of knowledge, common knowledge and linear time, based on simulations to a class of structures that capture the way t...