2540 search results - page 216 / 508 » Abstract Logics as Dialgebras |
200
click to vote
ICLP
1997
Springer
15 years 10 months ago
1997
Springer
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
170
click to vote
ECAI
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Most existing work on knowledge representation and reasoning assumes that the updating of beliefs is performed off-line, and that reasoning from the beliefs is performed ...
159
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. In this paper we work on (bi)simulation semantics of processes that exhibit both nondeterministic and probabilistic behaviour. We propose a probabilistic extension of the...
166
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
196
click to vote
ICALP
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Tree-walking automata (TWAs) recently received new attention in the fields of formal languages and databases. Towards a better understanding of their expressiveness, we c...