Answer Set Programming (ASP) and Constraint Logic Programming over finite domains (CLP(FD)) are two declarative programming paradigms that have been extensively used to encode ap...
Agostino Dovier, Andrea Formisano, Enrico Pontelli
We propose a novel mixtures of Gaussian processes model in which the gating function is interconnected with a probabilistic logical model, in our case Markov logic networks. In th...
We introduce a knowledge representation language AC(C) extending the syntax and semantics of ASP and CR-Prolog, give some examples of its use, and present an algorithm, ACsolver, ...
Veena S. Mellarkod, Michael Gelfond, Yuanlin Zhang
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...