104
Voted
ICLP
2007
Springer
15 years 10 months ago
2007
Springer
ICLP
2007
Springer
15 years 10 months ago
2007
Springer
116
Voted
ICLP
2007
Springer
15 years 10 months ago
2007
Springer
120
click to vote
ICLP
2007
Springer
15 years 10 months ago
2007
Springer
As logic programming applications grow in size, Prolog systems need to efficiently access larger and larger data sets and the need for any- and multiargument indexing becomes more...
ICLP
2007
Springer
15 years 10 months ago
2007
Springer
128
click to vote
ICLP
2007
Springer
15 years 10 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...
131
Voted
ICLP
2007
Springer
15 years 10 months ago
2007
Springer
141
click to vote
ICLP
2007
Springer
15 years 10 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...
119
Voted
ICLP
2007
Springer
15 years 10 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...
138
click to vote
ICLP
2007
Springer
15 years 10 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...