4581 search results - page 213 / 917 » Computing Transformation Semigroups |
211
click to vote
ASP
2003
Springer
15 years 11 months ago
2003
Springer
We present a general method to improve computation of answer sets by analyzing structural properties of normal logic programs. Therefore we use labeled directed graphs associated t...
168
click to vote
CLUSTER
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper presents a complete end-to-end framework to generate automatic message-passing code for tiled iteration spaces. It considers general parallelepiped tiling transformatio...
145
click to vote
TLCA
2001
Springer
15 years 11 months ago
2001
Springer
In this paper we introduce a cut-elimination procedure for classical logic, which is both strongly normalising and consisting of local proof transformations. Traditional cut-elimin...
134
click to vote
DCC
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper presents a simple and e ective post-processing method for compressed images. This work focuses on the cyclic time-variance introduced by block-based and subband transfo...
131
click to vote
ECAI
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Concepts in Answer Set Programming (ASP) are normally defined in terms of atoms. We show that the treatment of atoms and bodies (of rules) as equitable computational obje...