Results 1  10
of
53
ALC_RA  ALC with Role Axioms
 Proceedings of the International Workshop in Description Logics 2000 (DL2000), number 33 in CEURWS
, 2000
"... This paper presents a tableaux calculus for deciding the concept satis ability problem of the new description logic ALCRA and discusses some open problems. ALCRA augments the description logic ALC with role inclusion axioms of the form S T v R 1 t : : : tR n . Additionally, all roles are interp ..."
Abstract

Cited by 8 (6 self)
 Add to MetaCart
This paper presents a tableaux calculus for deciding the concept satis ability problem of the new description logic ALCRA and discusses some open problems. ALCRA augments the description logic ALC with role inclusion axioms of the form S T v R 1 t : : : tR n . Additionally, all roles
Towards an Implementation of the Temporal Description Logic TL_ALC
 Proceedings of the International Description Logics Workshop DL2001, volume 49 of CEUR Workshop Proceedings
, 2001
"... This paper describes first steps towards an efficient implementation of a tableau calculus for the logic T L ALC of [14, 11], a temporal extension of the standard description logic ALC. T L ALC extends ALC by means of the temporal operators fl (next) and U (until) which are applied to concepts and ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This paper describes first steps towards an efficient implementation of a tableau calculus for the logic T L ALC of [14, 11], a temporal extension of the standard description logic ALC. T L ALC extends ALC by means of the temporal operators fl (next) and U (until) which are applied to concepts
Description Logics in the Calculus of Structures
"... Abstract. We introduce a new proof system for the description logic ALC in the framework of the calculus of structures, a structural proof theory that employs deep inference. This new formal presentation introduces positive proofs for description logics. Moreover, this result makes possible the stud ..."
Abstract
 Add to MetaCart
Abstract. We introduce a new proof system for the description logic ALC in the framework of the calculus of structures, a structural proof theory that employs deep inference. This new formal presentation introduces positive proofs for description logics. Moreover, this result makes possible
Definitorially complete description logics
 In Proceedings of the International Conference of Principles of Knowledge Representation and Reasoning
, 2006
"... knowledge base is used to define new concepts in terms of primitive concepts and relations. The topic of this paper is the effect of the available operations in a DL on the length and the syntactic shape of definitions in a Terminology Box. Defining new concepts can be done in two ways: (1) in an ex ..."
Abstract

Cited by 27 (2 self)
 Add to MetaCart
knowledge base is used to define new concepts in terms of primitive concepts and relations. The topic of this paper is the effect of the available operations in a DL on the length and the syntactic shape of definitions in a Terminology Box. Defining new concepts can be done in two ways: (1
Description Logics with Transitive Roles
 Universite ParisSud
, 1997
"... This paper describes the logic ALCH R + , which extends ALC R + with a primitive role hierarchy, and presents an appropriate extension to the ALCR + satisfiability testing algorithm. ALCH R + is of interest because it provides useful additional expressive power and, although its satisfiability p ..."
Abstract
 Add to MetaCart
This paper describes the logic ALCH R + , which extends ALC R + with a primitive role hierarchy, and presents an appropriate extension to the ALCR + satisfiability testing algorithm. ALCH R + is of interest because it provides useful additional expressive power and, although its satisfiability
ABox abduction in ALC using a DL tableau
"... The formal definition of abduction asks what needs to be added to a knowledge base to enable an observation to be entailed by the knowledge base. ABox abduction in description logics (DLs) asks what ABox statements need to be added to a DL knowledge base, to allow an observation (also in the form o ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
of ABox statements) to be entailed. Klarman et al [8] have provided an algorithm for performing ABox abduction in the description logic ALC by converting the knowledge base and observation to firstorder logic, using a connection tableau to obtain abductive solutions, and then converting these back to DL
Negations in Description Logic – Contraries,
"... Abstract. In [10], several constructive description logics were proposed as intuitionistic variants of description logics, in which classical negation was replaced by strong negation as a component to treat negative atomic information. For conceptual representation, not only strong negation but also ..."
Abstract
 Add to MetaCart
but also combining it with classical negation seems to be useful and necessary due to their respective features corresponding to predicate denial (e.g., not happy) and predicate term negation (e.g., unhappy). In this paper, we propose an alternative description logic ALC∼ with classical negation and strong
Description logics for the representation of aggregated objects.
, 2000
"... Abstract. Aggregated objects play an important role in many knowledge representation applications. For the adequate representation of aggregated objects, it is crucial to represent partwhole relations. We discuss properties of partwhole relations and extend the description logic ALC with means fo ..."
Abstract

Cited by 27 (4 self)
 Add to MetaCart
Abstract. Aggregated objects play an important role in many knowledge representation applications. For the adequate representation of aggregated objects, it is crucial to represent partwhole relations. We discuss properties of partwhole relations and extend the description logic ALC with means
The Subsumption Problem of the Fuzzy Description Logic ALCF H
 In Proceedings of the 10th International Conference on Information Processing and Managment of Uncertainty in KnowledgeBased Systems, (IPMU04
, 2004
"... We present the fuzzy description logic ALCF H where primitive concepts are modified by means of hedges taken from hedge algebras. ALCF H is strictly more expressive than FuzzyALC defined in [9]. We show that given a linearly ordered set of hedges primitive concepts can be modified to any desired de ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
We present the fuzzy description logic ALCF H where primitive concepts are modified by means of hedges taken from hedge algebras. ALCF H is strictly more expressive than FuzzyALC defined in [9]. We show that given a linearly ordered set of hedges primitive concepts can be modified to any desired
Optimised EXPTime tableaux for ALC using sound global caching, propagation and cutoffs
 In Proceedings of the 2nd International Conference on Language Resources and Evaluation
, 2007
"... Abstract. We show that global caching can be used with propagation of both satisfiability and unsatisfiability in a sound manner to give an EXPTIME algorithm for checking satisfiability w.r.t. a TBox in the basic description logic ALC. Our algorithm is based on a simple traditional tableau calculus ..."
Abstract

Cited by 23 (13 self)
 Add to MetaCart
Abstract. We show that global caching can be used with propagation of both satisfiability and unsatisfiability in a sound manner to give an EXPTIME algorithm for checking satisfiability w.r.t. a TBox in the basic description logic ALC. Our algorithm is based on a simple traditional tableau calculus
Results 1  10
of
53