Professional Documents
Culture Documents
Satisability in /Lc
US
the combination of tense logic with K
m
over a
linear, unbounded, and discrete temporal structure has the same complexity
as its base (PSPACE-complete).
Satisability in /LcQ1
US
with ABox the combination of tense logic with
/LcQ1 with ABox over a linear, unbounded, and discrete temporal
structure has the same complexity as its base (EXPTIME-complete).
(2/9)
HS: Interval Temporal Propositional Modal Logic
Mortal
.
= LivingBeing after). LivingBeing
Ho
x TN(
x).
@x
/Lc is decidable
(PSPACE-hard); satisability is PSPACE-complete.
Logical implication in Ho
T is NP-complete.
Stack
.
= 3(x y z v w) ( nishes x)( meets y)( meets z)(v overlaps )(wnishes )(v meets w).
((OBJECT2 : Clear-Block)@x
(OBJECT1ON = OBJECT2)@y
(OBJECT1 : Clear-Block)@v
(OBJECT1 : Holding-Block)@w
(OBJECT1 : Clear-Block)@z)
(5/9)
L
n
FOL fragments
L
n
is the set of function-free FOL formulas with equality and constants, with
only unary and binary predicates, and which can be expressed using at most
n variable symbols.
Satisability of
L
3
formulas is undecidable.
Satisability of
L
2
formulas is NEXPTIME-complete.
(6/9)
The DL description logic
/Lc1 + propositional calculus on roles,
+ the concept (R S).
The TL
L
2
are equally expressive.
Many important model theoretic properties which hold for FOL and the modal
fragment, do hold also for GF and LGF