We propose and study extensions of logic programming with constraints represented as generalized atoms of the form C(X), where X is a finite set of atoms and C is act constraint (...
We propose a framework for multi-issue bilateral negotiation, where issues are expressed and related to each other via Description Logics. Agents’ goals are expressed through (c...
Azzurra Ragone, Tommaso Di Noia, Eugenio Di Sciasc...
This paper presents a new approach to inference in Bayesian networks. The principal idea is to encode the network by logical sentences and to compile the resulting encoding into an...
Abstract-- In this paper we present a method for automatically generating optimal robot trajectories satisfying high level mission specifications. The motion of the robot in the en...
Stephen L. Smith, Jana Tumova, Calin Belta, Daniel...
In description logics (DLs), concrete domains are used for defining concepts based on concrete qualities of their instances such as the weight, age, duration, and spatial extensio...