10 search results - page 2 / 2 » Undecidability of Multi-modal Hybrid Logics |
CADE
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. We investigate the computational behaviour of `two-dimensional' propositional temporal logics over (N, <) (with and without the next-time operator ?) that are cap...
JAPLL
2010
13 years 3 days ago
2010
The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments. In this p...
ENTCS
2007
13 years 5 months ago
2007
Description Logics (DLs) are a family of logic based knowledge representation formalisms. Although they have a range of applications, they are perhaps best known as the basis for ...
TABLEAUX
2009
Springer
13 years 11 months ago
2009
Springer
Memory logics are modal logics whose semantics is specified in terms of relational models enriched with additional data structure to represent memory. The logical language is then...
RR
2007
Springer
13 years 11 months ago
2007
Springer
The well-founded semantics (WFS) for logic programs is one of the few major paradigms for closed-world reasoning. With the advent of the Semantic Web, it is being used as part of r...