ICLP
2007
Springer
15 years 11 months ago
2007
Springer
137
click to vote
ICLP
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. The many approaches which have been proposed in the literature for proving the correctness of unfold/fold program transformations, consist in associating suitable well-fo...
150
click to vote
ICLP
2007
Springer
15 years 11 months ago
2007
Springer
aa We consider the problem of obtaining a minimal logic program strongly equivalent (under the stable models semantics) to a given arbitrary propositional theory. We propose a meth...
125
click to vote
ICLP
2007
Springer
15 years 11 months ago
2007
Springer
We propose a novel technique that maps decision problems in WS1S (weak monadic second-order logic with n successors) to the problem of query evaluation of Complex-value Datalog que...
146
click to vote
ICLP
2007
Springer
15 years 11 months ago
2007
Springer
Abstract In this doctoral work we aim at developing a rich timed concurrent constraint (tcc) based language with strong ties to logic. The new calculus called Universal Timed Concu...