An epistemic operator for description logics

Donini, Francesco M.; Lenzerini, Maurizio; Nardi, Daniele; Nutt, Werner; Schaerf, Andrea

doi:10.1016/s0004-3702(98)00009-5

Cited by 93 publications

(96 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [5], the basic DL ALC has been extended by the autoepistemic knowledge operator K, yielding the autoepistemic description logic ALCK. The K-operator can be applied as a constructor to both concepts and roles, and can intuitively be paraphrased as 'known to be'.…”

Section: Autoepistemic Description Logicsmentioning

confidence: 99%

“…We now formally introduce the syntax and semantics of ALCK [5]. The following rules define the syntax of this language, where C, D denote concepts, A denotes a primitive concept, r denotes a role and p denotes a primitive role:…”

Section: The Language Alckmentioning

confidence: 99%

“…Then, KB has at most one epistemic model M(KB ), comprising all its first-order models. An epistemic query [5] over an ALC knowledge base KB is an ALCK concept assertion of the form C(a). We say that KB entails C(a), written KB |= C(a), if, for every first-order interpretation I ∈ M(KB ), the epistemic interpretation (I, M(KB )) satisfies C(a).…”

Section: Epistemic Queries and Concept Satisfiabilitymentioning

confidence: 99%

“…ADLs are proper extensions of description logics, so the same principles can be applied to obtain autoepistemic extensions of OWL-DL or WSML-DL. Moreover, the reasoning algorithm from [5] extends the well-known tableau algorithm implemented in DL reasoning systems, such as RACER [11], FaCT [13] or Pellet [25]. Therefore, we believe that ADLs are a good fit with the existing technological Semantic Web infrastructure.…”

Section: Introductionmentioning

confidence: 97%

“…However, we base our service discovery framework on an autoepistemic extension to description logic (ADL) from [5], namely the logic ALCK. ADLs are proper extensions of description logics, so the same principles can be applied to obtain autoepistemic extensions of OWL-DL or WSML-DL.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Matching Semantic Service Descriptions with Local Closed-World Reasoning

Grimm

Motik

Preist

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Semantic Web Services were developed with the goal of automating the integration of business processes on the Web. The main idea is to express the functionality of the services explicitly, using semantic annotations. Such annotations can, for example, be used for service discovery-the task of locating a service capable of fulfilling a business request. In this paper, we present a framework for annotating Web Services using description logics (DLs), a family of knowledge representation formalisms widely used in the Semantic Web. We show how to realise service discovery by matching semantic service descriptions, applying DL inferencing. Building on our previous work, we identify problems that occur in the matchmaking process due to the open-world assumption when handling incomplete service descriptions. We propose to use autoepistemic extensions to DLs (ADLs) to overcome these problems. ADLs allow for non-monotonic reasoning and for querying DL knowledge bases under local closed-world assumption. We investigate the use of epistemic operators of ADLs in service descriptions, and show how they affect DL inferences in the context of semantic matchmaking.

show abstract

Section: Autoepistemic Description Logicsmentioning

confidence: 99%

Section: The Language Alckmentioning

confidence: 99%

Section: Epistemic Queries and Concept Satisfiabilitymentioning

confidence: 99%

Section: Introductionmentioning

confidence: 97%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Matching Semantic Service Descriptions with Local Closed-World Reasoning

Grimm

Motik

Preist

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

On Representational Issues About Combinations of Classical Theories with Nonmonotonic Rules

Bruijn

Eiter

Polleres

et al. 2006

Knowledge Science, Engineering and Management

View full text Add to dashboard Cite

Abstract.In the context of current efforts around Semantic-Web languages, the combination of classical theories in classical first-order logic (and in particular of ontologies in various description logics) with rule languages rooted in logic programming is receiving considerable attention. Existing approaches such as SWRL, dl-programs, and DL+log, differ significantly in the way ontologies interact with (nonmonotonic) rules bases. In this paper, we identify fundamental representational issues which need to be addressed by such combinations and formulate a number of formal principles which help to characterize and classify existing and possible future approaches to the combination of rules and classical theories. We use the formal principles to explicate the underlying assumptions of current approaches. Finally, we propose a number of settings, based on our analysis of the representational issues and the fundamental principles underlying current approaches.

show abstract