52 search results - page 5 / 11 » Algorithmic correspondence and completeness in modal logic |
AAAI
1998
13 years 9 months ago
1998
The paper presents a constructive 3-valued semantics for autoepistemic logic (AEL). We introduce a derivation operator and de ne the semantics as its least xpoint. The semantics is...
POPL
2006
ACM
14 years 8 months ago
2006
ACM
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
LICS
1994
IEEE
14 years 2 days ago
1994
IEEE
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...
TABLEAUX
2009
Springer
14 years 15 days ago
2009
Springer
Abstract. Bi-intuitionistic logic is a conservative extension of intuitionistic logic with a connective dual to implication, called exclusion. We present a sound and complete cut-f...
DEON
2008
Springer
13 years 9 months ago
2008
Springer
The security policy of an information system may include a wide range of different requirements. The literature has primarily focused on access and information flow control require...