Sciweavers

274 search results - page 35 / 55
» Weighted Automata and Weighted Logics
Sort
View
AAAI
2004
13 years 9 months ago
Logic Programs with Abstract Constraint Atoms
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 (...
Victor W. Marek, Miroslaw Truszczynski
AAAI
2007
13 years 9 months ago
Description Logics for Multi-Issue Bilateral Negotiation with Incomplete Information
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...
ECSQARU
2007
Springer
14 years 1 months ago
Logical Compilation of Bayesian Networks with Discrete Variables
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...
Michael Wachter, Rolf Haenni
CORR
2010
Springer
138views Education» more  CORR 2010»
13 years 7 months ago
Optimal Path Planning under Temporal Logic Constraints
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...
TABLEAUX
2005
Springer
14 years 29 days ago
A Tableau Algorithm for Description Logics with Concrete Domains and GCIs
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...
Carsten Lutz, Maja Milicic