Sciweavers

5 search results - page 1 / 1
» Approximations of modal logics: K and beyond
Sort
View
APAL
2008
159views more  APAL 2008»
13 years 9 months 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
ENTCS
2006
159views more  ENTCS 2006»
13 years 9 months 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
LOGCOM
2002
124views more  LOGCOM 2002»
13 years 9 months ago
Modal Logics Between Propositional and First-order
One can add the machinery of relation symbols and terms to a propositional modal logic without adding quantifiers. Ordinarily this is no extension beyond the propositional. But if...
Melvin Fitting
CSL
2009
Springer
14 years 3 months ago
Model Checking FO(R) over One-Counter Processes and beyond
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...
Anthony Widjaja To
PLILP
1998
Springer
14 years 1 months ago
Logic Programming and Model Checking
We report on the current status of the LMC project, which seeks to deploy the latest developments in logic-programming technology to advance the state of the art of system speci ca...
Baoqiu Cui, Yifei Dong, Xiaoqun Du, K. Narayan Kum...