746 search results - page 64 / 150 » Connectionist Propositional Logic |
TABLEAUX
2009
Springer
15 years 4 months ago
2009
Springer
We develop a general criterion for cut elimination in sequent calculi for propositional modal logics, which rests on absorption of cut, contraction, weakening and inversion by the ...
101
Voted
CADE
1998
Springer
15 years 2 months ago
1998
Springer
Abstract. Higher-order representation techniques allow elegant encodings of logics and programming languages in the logical framework LF, but unfortunately they are fundamentally i...
AAAI
2004
14 years 11 months ago
2004
Model checking is a promising approach to automatic verification, which has concentrated on specification expressed in temporal logic. Comparatively little attention has been give...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Autoepistemic logic extends propositional logic by the modal operator L. A formula that is preceded by an L is said to be "believed". The logic was introduced by Moore ...
68
Voted
JANCL
2007
14 years 10 months ago
2007
The aim of this paper is to give new kinds of modal logics suitable for reasoning about regions in discrete spaces. We call them dynamic logics of the region-based theory of discr...