Sciweavers

JOLLI
2008
83views more  JOLLI 2008»
14 years 11 days ago
Inessential Features, Ineliminable Features, and Modal Logics for Model Theoretic Syntax
While monadic second-order logic (MSO) has played a prominent role in model theoretic syntax, modal logics have been used in this context since its inception. When comparing propos...
Hans-Jörg Tiede
IANDC
2006
117views more  IANDC 2006»
14 years 12 days ago
A modular approach to defining and characterising notions of simulation
We propose a modular approach to defining notions of simulation, and modal logics which characterise them. We use coalgebras to model state-based systems, relators to define notio...
Corina Cîrstea
ENTCS
2006
159views more  ENTCS 2006»
14 years 13 days ago
Approximations of Modal Logic K
Inspired by the recent work on approximating classical logic, we present a procedure that approximates the modal logic K by determining a maximum limit of introspection. This proc...
Guilherme de Souza Rabello, Marcelo Finger
CORR
2006
Springer
130views Education» more  CORR 2006»
14 years 13 days ago
Characterizing the NP-PSPACE Gap in the Satisfiability Problem for Modal Logic
There has been a great deal of work on characterizing the complexity of the satisfiability and validity problem for modal logics. In particular, Ladner showed that the consistency...
Joseph Y. Halpern, Leandro Chaves Rêgo
APAL
2006
89views more  APAL 2006»
14 years 14 days ago
On modal logic of deductive closure
A new modal logic D is introduced. It describes properties of provability by interpreting modality as a deductive closure operator on sets of formulas. Logic D is proven to be dec...
Pavel Naumov
AML
2006
49views more  AML 2006»
14 years 14 days ago
No Escape from Vardanyan's theorem
Vardanyan's Theorem states that the set of PA-valid principles of Quantified Modal Logic, QML, is complete 0 2. We generalize this result to a wide class of theories. The cru...
Albert Visser, Maartje de Jonge
CORR
2008
Springer
148views Education» more  CORR 2008»
14 years 15 days ago
The craft of model making: PSPACE bounds for non-iterative modal logics
The methods used to establish PSPACE-bounds for modal logics can roughly be grouped into two classes: syntax driven methods establish that exhaustive proof search can be performed...
Lutz Schröder, Dirk Pattinson
APAL
2008
159views more  APAL 2008»
14 years 16 days ago
Approximations of modal logics: K and beyond
Inspired by recent work on approximations of classical logic, we present a method that approximates several modal logics in a modular way. Our starting point is the limitation of ...
Guilherme de Souza Rabello, Marcelo Finger
AMAI
2007
Springer
14 years 16 days ago
A new modal logic for reasoning about space: spatial propositional neighborhood logic
It is widely accepted that spatial reasoning plays a central role in artificial intelligence, for it has a wide variety of potential applications, e.g., in robotics, geographical...
Antonio Morales, Isabel Navarrete, Guido Sciavicco
ICFP
2010
ACM
14 years 1 months ago
Higher-order representation of substructural logics
We present a technique for higher-order representation of substructural logics such as linear or modal logic. We show that such logics can be encoded in the (ordinary) Logical Fra...
Karl Crary