FROCOS
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. We investigate the extension of modal logics by bisimulation quantifiers and present a class of modal logics which is decidable when augmented with bisimulation quanti...
IAT
2008
IEEE
14 years 6 months ago
2008
IEEE
Defeasible logic is a non-monotonic formalism that deals with incomplete and conflicting information. Modal logic deals with necessity and possibility, exhibiting defeasibility; t...
LFCS
2009
Springer
14 years 6 months ago
2009
Springer
Memory logics are a family of modal logics in which standard relational structures are augmented with data structures and additional operations to modify and query these structure...
LFCS
2009
Springer
14 years 6 months ago
2009
Springer
The admissible rules of a logic are those rules under which the set of theorems of the logic is closed. In a previous paper by the authors, formal systems for deriving the admissib...
TACAS
2010
Springer
14 years 6 months ago
2010
Springer
Deciding whether a modal formula is satisfiable with respect to a given set of (global) assumptions is a question of fundamental importance in applications of logic in computer sc...