977 search results - page 11 / 196 » Logic programming with infinite sets |
TCS
2010
13 years 2 months ago
2010
We revisit the notion of computational depth and sophistication for infinite sequences and study the density of the sets of deep and sophisticated infinite sequences. Koppel defin...
MST
2006
13 years 7 months ago
2006
We consider the transition graphs of regular ground tree (or term) rewriting systems. The vertex set of such a graph is a (possibly infinite) set of trees. Thus, with a finite tree...
JELIA
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Nonmonotonic causal logic became a basis for the semantics of several expressive action languages. Norman McCain and Paolo Ferraris showed how to embed propositional caus...
LPNMR
2005
Springer
14 years 26 days ago
2005
Springer
Abstract. Nested logic programs and epistemic logic programs are two important extensions of answer set programming. However, the relationship between these two formalisms is rarel...
CADE
2006
Springer
14 years 7 months ago
2006
Springer
Abstract. Semantic labelling is a transformational technique for proving termination of Term Rewriting Systems (TRSs). Only its variant with finite sets of labels was used so far i...