97 search results - page 14 / 20 » A Systematic Proof Theory for Several Modal Logics |
99
Voted
CSL
2009
Springer
15 years 6 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...
102
click to vote
STOC
1999
ACM
15 years 4 months ago
1999
ACM
The width of a Resolution proof is defined to be the maximal number of literals in any clause of the proof. In this paper, we relate proof width to proof length (ϭsize), in both g...
147
Voted
CAV
1998
Springer
15 years 3 months ago
1998
Springer
As a pedagogical exercise in ACL2, we formalize and prove the correctness of a write invalidate cache scheme. In our formalization, an arbitrary number of processors, each with its...
ATAL
2008
Springer
15 years 1 months ago
2008
Springer
In the last few years, argumentation frameworks have been successfully applied to multi agent systems. Recently, argumentation has been used to provide a framework for reasoning a...
KR
2000
Springer
15 years 3 months ago
2000
Springer
Though overriding as a single and default mode of inheritance is adequate for most knowledge bases, a large class of applications naturally requires several inheritance modes and ...