7988 search results - page 25 / 1598 » A Useful Undecidable Theory |
MFCS
2009
Springer
14 years 3 months ago
2009
Springer
Nested Pushdown Trees are unfoldings of pushdown graphs with an additional jump-relation. These graphs are closely related to collapsible pushdown graphs. They enjoy decidable µ-c...
STACS
2007
Springer
14 years 2 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...
CSL
2004
Springer
14 years 2 months ago
2004
Springer
Set constraints are a useful formalism for verifying properties of programs. Usually, they are interpreted over the universe of finite terms. However, some logic languages allow i...
DLT
2008
13 years 10 months ago
2008
An aperiodic tile set was first constructed by R. Berger while proving the undecidability of the domino problem. It turned out that aperiodic tile sets appear in many topics rangin...
DLOG
2001
13 years 10 months ago
2001
daml+oil is a new description logic developed for use within the DAML project and as a submission to the upcoming W3C semantic web ontology working group. It is closely based on t...