133 search results - page 12 / 27 » Decidable Fragments of Many-Sorted Logic |
ENTCS
2010
13 years 9 months ago
2010
The validity/satisfiability problem for most propositional interval temporal logics is (highly) undecidable, under very weak assumptions on the class of interval structures in whi...
RR
2009
Springer
14 years 4 months ago
2009
Springer
Open Answer Set Programming (OASP) can be seen as a framework to represent tightly integrated combined knowledge bases of ontologies and rules that are not necessarily DL-safe. The...
FSTTCS
2000
Springer
14 years 1 months ago
2000
Springer
: A pushdown system is a graph G(P) of configurations of a pushdown automaton P. The model checking problem for a logic L is: given a pushdown automaton P and a formula L decide ...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
The paper proposes and studies temporal logics for attributed words, that is, data words with a (finite) set of (attribute,value)-pairs at each position. It considers a basic logi...
CSL
2010
Springer
13 years 10 months ago
2010
Springer
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...