291 search results - page 4 / 59 » On the Complexity of Fragments of Modal Logics |
FOSSACS
2006
Springer
13 years 11 months ago
2006
Springer
In recent years, a tight connection has emerged between modal logic on the one hand and coalgebras, understood as generic transition systems, on the other hand. Here, we prove tha...
ICLP
2004
Springer
14 years 1 months ago
2004
Springer
We introduce our implemented modal logic programming system MProlog. This system is written in Prolog as a module for Prolog. Codes, libraries, and most features of Prolog can be u...
STACS
2007
Springer
14 years 1 months ago
2007
Springer
Hybrid logics extend modal logics by first-order concepts, in particular they allow a limited use of variables. Unfortunately, in general, satisfiability for hybrid formulas is u...
JAPLL
2010
13 years 6 months ago
2010
We provide complete axiomatizations for several fragments of XPath: sets of equivalences from which every other valid equivalence is derivable. Specifically, we axiomatize downwar...
TIME
2009
IEEE
14 years 2 months ago
2009
IEEE
We investigate fragments of Halpern-Shoham’s interval logic HS involving the modal operators for the relations of left or right overlap of intervals. We prove that most of these...