2022 search results - page 184 / 405 » Complexity of Non-Monotonic Logics |
220
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...
183
click to vote
ICFEM
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
168
click to vote
CSL
2005
Springer
16 years 2 days 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...
182
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...
190
click to vote
LFCS
2007
Springer
16 years 21 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...