Abstract. In this paper we revisit Logic Programming under the answer-set semantics - or Answer-Set Programming - and its extension Evolving Logic Programming, two languages that u...
In this paper, we describe the syntax and semantics for a probabilistic relational language (PRL). PRL is a recasting of recent work in Probabilistic Relational Models (PRMs) into ...
Type abstraction and intensional type analysis are features seemingly at odds--type abstraction is intended to guarantee parametricity and representation independence, while type ...
An important challenge in constraint programming is to rewrite constraint models into executable programs calculating the solutions. This phase of constraint processing may requir...