Sciweavers

AAAI
2007
13 years 6 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...
TABLEAUX
2000
Springer
13 years 8 months ago
Consistency Testing: The RACE Experience
Abstract. This paper presents the results of applying RACE, a description logic system for ALCNHR+ , to modal logic SAT problems. Some aspects of the RACE architecture are discusse...
Volker Haarslev, Ralf Möller
KR
2000
Springer
13 years 8 months ago
Expressive ABox Reasoning with Number Restrictions, Role Hierarchies, and Transitively Closed Roles
We present a new tableaux calculus deciding the ABox consistency problem for the expressive description logic ALCNHR+ . Prominent language features of ALCNHR+ are number restricti...
Volker Haarslev, Ralf Möller
ECAI
1998
Springer
13 years 8 months ago
Description Logics with Concrete Domains and Aggregation
Abstract. We extend different Description Logics by concrete domains (such as integers and reals) and by aggregation functions over these domains (such as min;max;count;sum), which...
Franz Baader, Ulrike Sattler
ER
2006
Springer
157views Database» more  ER 2006»
13 years 8 months ago
Representing Transitive Propagation in OWL
Transitive propagation along properties can be modelled in various ways in the OWL description logic. Doing so allows existing description logic reasoners based on the tableaux alg...
Julian Seidenberg, Alan L. Rector
CIA
2006
Springer
13 years 8 months ago
A Framework of Cooperative Agents with Implicit Support for Ontologies
Abstract. W3C's OWL has gained wide acceptance in the agent community and it has already been used in many agent applications which we think syntactically. By taking advantage...
Riza Cenk Erdur, Inanç Seylan
KR
2010
Springer
13 years 8 months ago
On the Complexity of Axiom Pinpointing in the EL Family of Description Logics
We investigate the computational complexity of axiom pinpointing, which is the task of finding minimal subsets of a Description Logic knowledge base that have a given consequence...
Rafael Peñaloza, Baris Sertkaya
KR
1994
Springer
13 years 8 months ago
Making the Difference: A Subtraction Operation for Description Logics
We define a new operation in description logics, the difference operation or subtraction operation. This operation allows to remove from a description as much as possible of the i...
Gunnar Teege
KR
1998
Springer
13 years 8 months ago
Using an Expressive Description Logic: FaCT or Fiction?
Description Logics form a family of formalisms closely related to semantic networks but with the distinguishing characteristic that the semantics of the concept description langua...
Ian Horrocks
FTP
1998
Springer
13 years 8 months ago
Issues of Decidability for Description Logics in the Framework of Resolution
Abstract. We describe two methods on the basis of which efficient resolution decision procedures can be developed for a range of description logics. The first method uses an orderi...
Ullrich Hustadt, Renate A. Schmidt