In massively collaborative projects such as scientific or community databases, users often need to agree or disagree on the content of individual data items. On the other hand, tr...
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 ...
In this paper we explore the notion of a \signing" of a logic program, in the framework of the answer set semantics. In particular, we generalize and extend the notion of a s...
Abstract. Logic programming has often been considered less than adequate for modelling the dynamics of knowledge changing over time. In this paper we describe Evolving Logic Progra...
We formulate loop formulas for logic programs with arbitrary constraint atoms, for the semantics based on conditional satisfaction. This provides a method for answer set computati...