In probabilistic reasoning, the problems of existence and identity are important to many different queries; for example, the probability that something that fits some description...
The verification problem for action logic programs with non-terminating behaviour is in general undecidable. In this paper, we consider a restricted setting in which the problem be...
Abstract. Inconsistency handling in expressive description logics is an important problem because inconsistency may naturally occur in an open world. In this paper, we present the ...
In connection with machine arithmetic, we are interested in systems of constraints of the form x + k y + k . Over integers, the satisfiability problem for such systems is polynomi...
Abstract. In this work we address the problem of elaborating domain descriptions (alias action theories), in particular those that are expressed in dynamic logic. We define a gener...
Andreas Herzig, Laurent Perrussel, Ivan José...