Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
122
Practical Reasoning for Expressive Description Logics
, 1999
"... . Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Expressive role constructors are important in many applications, but can be computationally problematical. We present an algorithm ..."
Abstract
-
Cited by 354 (65 self)
- Add to MetaCart
an algorithm that decides satis ability of the DL ALC extended with transitive and inverse roles, role hierarchies, and qualifying number restrictions. Early experiments indicate that this algorithm is well-suited for implementation. Additionally, we show that ALC extended with just transitive and inverse
A Diagrammatic Reasoning System for ALC
"... Description logics (DLs) are a well-known family of knowledge representation (KR) languages. The notation of DLs has the style of a variable-free first order predicate logic. In this paper a diagrammatic representation of the DL ALC – based on Peirce’s existential graphs – is presented and a set of ..."
Abstract
- Add to MetaCart
Description logics (DLs) are a well-known family of knowledge representation (KR) languages. The notation of DLs has the style of a variable-free first order predicate logic. In this paper a diagrammatic representation of the DL ALC – based on Peirce’s existential graphs – is presented and a set
A Peirce-style calculus for ALC
"... Description logics (DLs) are a well-understood family of knowledge representation (KR) languages. The notation of DLs has the flavour of a variable-free first order predicate logic. In this paper, a diagrammatic representation of the DL ALC, based on Peirce’s existential graphs, is presented, and a ..."
Abstract
- Add to MetaCart
Description logics (DLs) are a well-understood family of knowledge representation (KR) languages. The notation of DLs has the flavour of a variable-free first order predicate logic. In this paper, a diagrammatic representation of the DL ALC, based on Peirce’s existential graphs, is presented, and a
An ALC Description Logic Connection Method
"... Abstract. The connection method earned good reputation in the field of automated theorem proving for around three decades, due to its simplicity, clarity, efficiency and parsimonious use of memory. This seems to be a very appealing feature, in particular in the context of Semantic Web, where it is a ..."
Abstract
- Add to MetaCart
it is assumed that the knowledge bases might be of arbitrary size. In this paper, I present a connection method especially tailored to infer over the description logic (DL) ALC. Our ALC connection method is formalized in sequent style, although matrices should be employed for practical reasons. 1.
Reasoning in ALC with Fuzzy Concrete Domains
"... Abstract. In the context of Description Logics (DLs) concrete domains allow to model concepts and facts by the use of concrete values and pred-icates between them. For reasoning in the DL ALC with general TBoxes concrete domains may cause undecidability. Under certain restrictions of the concrete do ..."
Abstract
- Add to MetaCart
Abstract. In the context of Description Logics (DLs) concrete domains allow to model concepts and facts by the use of concrete values and pred-icates between them. For reasoning in the DL ALC with general TBoxes concrete domains may cause undecidability. Under certain restrictions of the concrete
Practical reasoning for very expressive description logics
- Journal of the Interest Group in Pure and Applied Logics 8
, 2000
"... Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Expressive role constructors are important in many applications, but can be computationally problematical. We present an algorithm t ..."
Abstract
-
Cited by 185 (22 self)
- Add to MetaCart
that decides satisfiability of the DL ALC extended with transitive and inverse roles and functional restrictions with respect to general concept inclusion axioms and role hierarchies; early experiments indicate that this algorithm is well-suited for implementation. Additionally, we show that ALC extended
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 descrip-tion 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 first-order logic, using a connection tableau to obtain abductive solutions, and then converting these back to DL
TBox Abduction in ALC Using a DL Tableau
"... Abstract. The formal definition of abduction asks what needs to be added to a knowledge base to enable an observation to be entailed. TBox abduction in description logics (DLs) asks what TBox axioms need to be added to a DL knowledge base to allow a TBox axiom to be entailed. We describe a sound and ..."
Abstract
- Add to MetaCart
and complete algorithm, based on the standard DL tableau, that takes a TBox abduction problem in ALC and generates solutions in a restricted language. We then show how this algorithm can be enhanced to deal with a broader range of problems in ALC.
PSpace Reasoning with the Description Logic ALC F (D)
"... Abstract Description Logics (DLs), a family of formalisms for reasoning about conceptual knowledge, canbe extended with concrete domains to allow an adequate representation of "concrete qualities " of real-worlds entities such as their height, temperature, duration, and size. In th ..."
Abstract
- Add to MetaCart
. In this paper, we studythe complexity of reasoning with the basic DL with concrete domains ALC(D) and its extension with so-called feature agreements and disagreements ALCF(D). We show that, for both logics,the standard reasoning tasks concept satisfiability, concept subsumption, and ABox consistency are PSpace
EL-Concepts go Second-Order: Greatest Fixpoints and Simulation Quantifiers
"... The well-known description logic (DL) ALC is usually regarded as the basic DL that comprises all Boolean concept constructors from which all expressive DLs are derived by admitting additional concept constructors. The fundamental role of ALC is largely due to the fact that it is very well-behaved re ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
The well-known description logic (DL) ALC is usually regarded as the basic DL that comprises all Boolean concept constructors from which all expressive DLs are derived by admitting additional concept constructors. The fundamental role of ALC is largely due to the fact that it is very well
Results 1 - 10
of
122
