A description logic model for querying knowledge bases for structured documents

1997 ◽  
pp. 72-83 ◽  
Author(s):  
Patrick Lambrix ◽  
Lin Padgham
Keyword(s):  
Description Logic ◽  
Knowledge Bases ◽  
Logic Model ◽  
Structured Documents

An Improved Set-based Reasoner for the Description Logic 𝒟ℒD4,׆

2021 ◽  
Vol 178 (4) ◽  
pp. 315-346
Author(s):  
Domenico Cantone ◽  
Marianna Nicolosi-Asmundo ◽  
Daniele Francesco Santamaria
Keyword(s):  
Semantic Web ◽  
Set Theory ◽  
Description Logic ◽  
Knowledge Bases ◽  
Query Answering ◽  
Conjunctive Query ◽  
Classification Problems ◽  
Previous Version ◽  
Decidable Fragment ◽  
Stratified Set

We present a KE-tableau-based implementation of a reasoner for a decidable fragment of (stratified) set theory expressing the description logic 𝒟ℒ〈4LQSR,×〉(D) (𝒟ℒD4,×, for short). Our application solves the main TBox and ABox reasoning problems for 𝒟ℒD4,×. In particular, it solves the consistency and the classification problems for 𝒟ℒD4,×-knowledge bases represented in set-theoretic terms, and a generalization of the Conjunctive Query Answering problem in which conjunctive queries with variables of three sorts are admitted. The reasoner, which extends and improves a previous version, is implemented in C++. It supports 𝒟ℒD4,×-knowledge bases serialized in the OWL/XML format and it admits also rules expressed in SWRL (Semantic Web Rule Language).

Storing fuzzy description logic ontology knowledge bases in fuzzy relational databases

2017 ◽  
Vol 48 (1) ◽  
pp. 220-242 ◽  
Author(s):  
Fu Zhang ◽  
Z. M. Ma ◽  
Qiang Tong ◽  
Jingwei Cheng
Keyword(s):  
Relational Databases ◽  
Description Logic ◽  
Knowledge Bases ◽  
Fuzzy Description

Description Logic Model of Disaster Reaction Processes

2000 ◽  
Vol 33 (17) ◽  
pp. 193-198
Author(s):  
Martina Kullmann ◽  
Bernard Keith
Keyword(s):  
Description Logic ◽  
Logic Model ◽  
Reaction Processes

scholarly journals Conjunctive Query Answering for the Description Logic SHIQ

2008 ◽  
Vol 31 ◽  
pp. 157-204 ◽  
Author(s):  
B. Glimm ◽  
C. Lutz ◽  
I. Horrocks ◽  
U. Sattler
Keyword(s):  
Description Logic ◽  
Query Language ◽  
Description Logics ◽  
Knowledge Bases ◽  
Deterministic Algorithm ◽  
Query Answering ◽  
Conjunctive Query ◽  
Conjunctive Queries ◽  
Complexity Bounds ◽  
Double Exponential

Conjunctive queries play an important role as an expressive query language for Description Logics (DLs). Although modern DLs usually provide for transitive roles, conjunctive query answering over DL knowledge bases is only poorly understood if transitive roles are admitted in the query. In this paper, we consider unions of conjunctive queries over knowledge bases formulated in the prominent DL SHIQ and allow transitive roles in both the query and the knowledge base. We show decidability of query answering in this setting and establish two tight complexity bounds: regarding combined complexity, we prove that there is a deterministic algorithm for query answering that needs time single exponential in the size of the KB and double exponential in the size of the query, which is optimal. Regarding data complexity, we prove containment in co-NP.

scholarly journals Semantic Web Services: Service Discovery and Invocation Planning

1970 ◽  
Vol 2 (1) ◽  
pp. 9-15
Author(s):  
Kati Limapichat ◽  
Sukasom Chaiyakul ◽  
Avani Dixit ◽  
Ekawit Nantajeewarawat
Keyword(s):  
Web Services ◽  
Web Service ◽  
Service Discovery ◽  
Description Logic ◽  
Background Knowledge ◽  
Knowledge Bases ◽  
Semantic Web Services ◽  
Prototype System ◽  
Knowledge Reasoning ◽  
Automatic Discovery

With the expanse of internet, web programmers have wide choice of web services available to them. A need arises for automatic discovery of required web services and construction of an appropriate sequence of invocation thereof. In this paper, we present a framework for automation of this task based on currently emerging technologies such as ontological knowledge bases, OWL, OWL-S, WSDL, Description Logic (DL), etc. Background-knowledge ontologies are created based on which semantic meanings of web services can be given through OWL-S. An agent employs OWL-S API to extract web service metadata, and applies a DL inference engine, called Racer, for reasoning with the metadata with respect to given background knowledge. Reasoning tasks performed by Racer include profile matchmaking, input/output subsumption testing, and preconditions/effects analysis, which are basic mechanisms for web services discovery and invocation planning. A prototype system has been implemented.

scholarly journals Implementing an Efficient SAT Solver for a Probabilistic Description Logic

10.29007/wm7w ◽  
2018 ◽  
Author(s):  
Pavel Klinov ◽  
Bijan Parsia
Keyword(s):  
Column Generation ◽  
Description Logic ◽  
Empirical Investigation ◽  
Knowledge Bases ◽  
Probabilistic Logic ◽  
Linear Programs ◽  
Probabilistic Description ◽  
Probabilistic Knowledge ◽  
Sat Solver ◽  
Straightforward Approach

This paper presents an optimized algorithm for solving the satisfiability problem (PSAT) in the probabilistic description logic P-SROIQ. P-SROIQ and related Nilsson-style probabilistic logics the PSAT problem is typically solved by reduction to linear programming. This straightforward approach does not scale well because the number of variables in linear programs grows exponentially with the number of probabilistic statements. In this paper we demonstrate an algorithm to cope with this problem which is based on column generation. Although column generation approaches to PSAT have been known for the last two decades, this is, to the best of our knowledge, the first algorithm which also works for a non-propositional probabilistic logic. We report results of an empirical investigation which show that the algorithm can handle probabilistic knowledge bases of about 1000 probabilistic statements in addition to even larger number of classical SROIQ axioms.

Secrecy-Preserving Reasoning and Query Answering in Probabilistic Description Logic Knowledge Bases

10.29007/npd4 ◽  
2018 ◽  
Author(s):  
Gopalakrishnan Krishnasamy Sivaprakasam ◽  
Adrienne Raglin ◽  
Douglas Summers-Stay ◽  
Giora Slutzki
Keyword(s):  
Probabilistic Model ◽  
Description Logic ◽  
Knowledge Bases ◽  
Query Answering ◽  
Decomposition Algorithm ◽  
Probabilistic Description ◽  
Recursive Query ◽  
Finite Set ◽  
The Given

In this paper we study Secrecy-Preserving Query Answering problem underthe OpenWorld Assumption (OWA) for Prob-EL>0;=1 Knowledge Bases(KBs). We have designed a tableau procedure to compute a semi model Mover the given KB which eventually is equivalent to a probabilistic modelto KB. Given a secrecy set S, which is a finite set of assertions, wecompute a function E, called an envelope of S, which assigns a set E() ofassertions to each world in the semi modal M. E provides logical protection to the secrecy set S against the reasoning of a querying agent. Once the semi model M and an envelope E are computed, we define the secrecy-preserving semi model ME.Based on the information available in ME, assertional queries with probabilisticoperators can be answered eciently while preserving secrecy. Tothe best of our knowledge, this work is first one studying secrecy-preservingreasoning in description logic augmented with probabilistic operators. Whenthe querying agent asks a query q, the reasoner answers “Yes” if informationabout q is available in ME; otherwise, the reasoner answers “Unknown”. Beingable to answer “Unknown” plays a key role in protecting secrecy underOWA. Since we are not computing all the consequences of the knowledgebase, answers to the queries based on just secrecy-preserving semi modelME could be erroneous. To fix this problem, we further augment our algorithmsby providing recursive query decomposition algorithm to make thequery answering procedure foolproof.1

A Description Logic Model for the Management of Automated Guided Vehicles

2000 ◽  
Vol 33 (13) ◽  
pp. 349-354 ◽  
Author(s):  
A. Bechina ◽  
B. Keith ◽  
M. Kullmann
Keyword(s):  
Description Logic ◽  
Logic Model ◽  
Automated Guided Vehicles
Sign in / Sign up

Export Citation Format

Share Document