Sciweavers

11 search results - page 1 / 3
» Frame Based Formulas for Intermediate Logics
Sort
View
SLOGICA
2008
77views more  SLOGICA 2008»
13 years 4 months ago
Frame Based Formulas for Intermediate Logics
In this paper we define a new notion of frame based formulas. We show that the well-known examples of formulas arising from a finite frame, such as the Jankov-de Jongh formulas, s...
Nick Bezhanishvili
JAPLL
2010
131views more  JAPLL 2010»
13 years 2 months ago
Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA
The previously introduced algorithm SQEMA computes first-order frame equivalents for modal formulae and also proves their canonicity. Here we extend SQEMA with an additional rule...
Willem Conradie, Valentin Goranko, Dimiter Vakarel...
ISSTA
2004
ACM
13 years 9 months ago
An optimizing compiler for batches of temporal logic formulas
Model checking based on validating temporal logic formulas has proven practical and effective for numerous software engineering applications. As systems based on this approach ha...
James Ezick
AIML
2006
13 years 5 months ago
A General Semantics for Quantified Modal Logic
In [9] we developed a semantics for quantified relevant logic that uses general frames. In this paper, we adapt that model theory to treat quantified modal logics, giving a complet...
Robert Goldblatt, Edwin D. Mares
ECAI
2006
Springer
13 years 8 months ago
Elaborating Domain Descriptions
Abstract. In this work we address the problem of elaborating domain descriptions (alias action theories), in particular those that are expressed in dynamic logic. We define a gener...
Andreas Herzig, Laurent Perrussel, Ivan José...