7988 search results - page 18 / 1598 » A Useful Undecidable Theory |
RULEML
2004
Springer
14 years 27 days ago
2004
Springer
Abstract. We extend Answer Set Programming with, possibly infinite, open domains. Since this leads, in general, to undecidable reasoning, we restrict the syntax of programs, while...
TPHOL
2003
IEEE
14 years 25 days ago
2003
IEEE
Coverage checking is the problem of deciding whether any closed term of a given type is an instance of at least one of a given set of patterns. It can be used to verify if a functi...
LPAR
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The Description Logics underpinning OWL impose a well-known syntactic restriction in order to preserve decidability: they do not allow to use nonsimple roles—that is, t...
BIRTHDAY
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. We consider programs which are data independent with respect to two type variables X and Y , and can in addition use arrays indexed by X and storing values from Y . We ar...
FORMATS
2003
Springer
14 years 23 days ago
2003
Springer
Timed automata are known not to be complementable or determinizable. Natural questions are, then, could we check whether a given TA enjoys these properties? These problems are not...