2920 search results - page 153 / 584 » Finite information logic |
196
Voted
ICLP
2009
Springer
16 years 1 months ago
2009
Springer
The paper describes a novel methodology to compute stable models in Answer Set Programming. The proposed approach relies on a bottom-up computation that does not require a prelimin...
106
Voted
CADE
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. An approach based on term rewriting techniques for the automated termination analysis of imperative programs operating on integers is presented. An imperative program is ...
106
Voted
CAV
2009
Springer
16 years 1 months ago
2009
Springer
We provide a verification technique for a class of programs working on integer arrays of finite, but not a priori bounded length. We use the logic of integer arrays SIL [13] to spe...
100
Voted
CADE
2006
Springer
16 years 1 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...
113
click to vote
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
We take a dual view of Markov processes ? advocated by Kozen ? as transformers of bounded measurable functions. We redevelop the theory of labelled Markov processes from this view ...