scholarly journals The DL-Lite Family and Relations

2009 ◽  
Vol 36 ◽  
pp. 1-69 ◽  
Author(s):  
A. Artale ◽  
D. Calvanese ◽  
R. Kontchakov ◽  
M. Zakharyaschev
Keyword(s):  
Description Logic ◽  
Description Logics ◽  
Conceptual Modeling ◽  
Systematic Investigation ◽  
First Order ◽  
The Common ◽  
The One ◽  
Modeling Formalisms ◽  
Five Axes ◽  
Computational Behavior

The recently introduced series of description logics under the common moniker `DL-Lite' has attracted attention of the description logic and semantic web communities due to the low computational complexity of inference, on the one hand, and the ability to represent conceptual modeling formalisms, on the other. The main aim of this article is to carry out a thorough and systematic investigation of inference in extensions of the original DL-Lite logics along five axes: by (i) adding the Boolean connectives and (ii) number restrictions to concept constructs, (iii) allowing role hierarchies, (iv) allowing role disjointness, symmetry, asymmetry, reflexivity, irreflexivity and transitivity constraints, and (v) adopting or dropping the unique same assumption. We analyze the combined complexity of satisfiability for the resulting logics, as well as the data complexity of instance checking and answering positive existential queries. Our approach is based on embedding DL-Lite logics in suitable fragments of the one-variable first-order logic, which provides useful insights into their properties and, in particular, computational behavior.

Logics for the Semantic Web

2011 ◽  
pp. 24-43
Author(s):  
J. Bruijn
Keyword(s):  
Semantic Web ◽  
Logic Programming ◽  
Description Logic ◽  
Description Logics ◽  
Order Logic ◽  
First Order Logic ◽  
Horn Logic ◽  
First Order ◽  
Logical Language ◽  
Rule Languages

This chapter introduces a number of formal logical languages which form the backbone of the Semantic Web. They are used for the representation of both ontologies and rules. The basis for all languages presented in this chapter is the classical first-order logic. Description logics is a family of languages which represent subsets of first-order logic. Expressive description logic languages form the basis for popular ontology languages on the Semantic Web. Logic programming is based on a subset of first-order logic, namely Horn logic, but uses a slightly different semantics and can be extended with non-monotonic negation. Many Semantic Web reasoners are based on logic programming principles and rule languages for the Semantic Web based on logic programming are an ongoing discussion. Frame Logic allows object-oriented style (frame-based) modeling in a logical language. RuleML is an XML-based syntax consisting of different sublanguages for the exchange of specifications in different logical languages over the Web.

scholarly journals On Free Description Logics with Definite Descriptions

2021 ◽  
Author(s):  
Alessandro Artale ◽  
Andrea Mazzullo ◽  
Ana Ozaki ◽  
Frank Wolter
Keyword(s):  
Description Logic ◽  
Description Logics ◽  
Expressive Power ◽  
Definite Descriptions ◽  
First Order ◽  
Domain Semantics ◽  
Automated Support ◽  
Suitable Notion ◽  
Dual Domain ◽  
Polynomial Time Reduction

Definite descriptions are phrases of the form ‘the x such that φ’, used to refer to single entities in a context. They are often more meaningful to users than individual names alone, in particular when modelling or querying data over ontologies. We investigate free description logics with both individual names and definite descriptions as terms of the language, while also accounting for their possible lack of denotation. We focus on the extensions of ALC and, respectively, EL with nominals, the universal role, and definite descriptions. We show that standard reasoning in these extensions is not harder than in the original languages, and we characterise the expressive power of concepts relative to first-order formulas using a suitable notion of bisimulation. Moreover, we lay the foundations for automated support for definite descriptions generation by studying the complexity of deciding the existence of definite descriptions for an individual under an ontology. Finally, we provide a polynomial-time reduction of reasoning in other free description logic languages based on dual-domain semantics to the case of partial interpretations.

The Probabilistic Description Logic

2020 ◽  
pp. 1-24
Author(s):  
LEONARD BOTHA ◽  
THOMAS MEYER ◽  
RAFAEL PEÑALOZA
Keyword(s):  
Knowledge Representation ◽  
Description Logic ◽  
Description Logics ◽  
Light Weight ◽  
Classical Form ◽  
First Order ◽  
Probabilistic Description

Abstract Description logics (DLs) are well-known knowledge representation formalisms focused on the representation of terminological knowledge. Due to their first-order semantics, these languages (in their classical form) are not suitable for representing and handling uncertainty. A probabilistic extension of a light-weight DL was recently proposed for dealing with certain knowledge occurring in uncertain contexts. In this paper, we continue that line of research by introducing the Bayesian extension of the propositionally closed DL . We present a tableau-based procedure for deciding consistency and adapt it to solve other probabilistic, contextual, and general inferences in this logic. We also show that all these problems remain ExpTime-complete, the same as reasoning in the underlying classical .

scholarly journals Consequence-Based Reasoning for Description Logics with Disjunctions and Number Restrictions

2018 ◽  
Vol 63 ◽  
pp. 625-690 ◽  
Author(s):  
Andrew Bate ◽  
Boris Motik ◽  
Bernardo Cuenca Grau ◽  
David Tena Cucala ◽  
František Simančík ◽  
...  
Keyword(s):  
Description Logic ◽  
Practical Reasoning ◽  
Description Logics ◽  
Practical Implementation ◽  
First Order ◽  
Implementation Techniques ◽  
Important Addition ◽  
Logic Reasoning ◽  
Extensive Performance

Classification of description logic (DL) ontologies is a key computational problem in modern data management applications, so considerable effort has been devoted to the development and optimisation of practical reasoning calculi. Consequence-based calculi combine ideas from hypertableau and resolution in a way that has proved very effective in practice. However, existing consequence-based calculi can handle either Horn DLs (which do not support disjunction) or DLs without number restrictions. In this paper, we overcome this important limitation and present the first consequence-based calculus for deciding concept subsumption in the DL ALCHIQ+. Our calculus runs in exponential time assuming unary coding of numbers, and on ELH ontologies it runs in polynomial time. The extension to disjunctions and number restrictions is technically involved: we capture the relevant consequences using first-order clauses, and our inference rules adapt paramodulation techniques from first-order theorem proving. By using a well-known preprocessing step, the calculus can also decide concept subsumptions in SRIQ---a rich DL that covers all features of OWL 2 DL apart from nominals and datatypes. We have implemented our calculus in a new reasoner called Sequoia. We present the architecture of our reasoner and discuss several novel and important implementation techniques such as clause indexing and redundancy elimination. Finally, we present the results of an extensive performance evaluation, which revealed Sequoia to be competitive with existing reasoners. Thus, the calculus and the techniques we present in this paper provide an important addition to the repertoire of practical implementation techniques for description logic reasoning.

scholarly journals A Characterization Theorem for a Modal Description Logic

2017 ◽  
Author(s):  
Paul Wild ◽  
Lutz Schröder
Keyword(s):  
Description Logic ◽  
Description Logics ◽  
Characterization Theorem ◽  
Expressive Power ◽  
Order Logic ◽  
First Order Logic ◽  
Standard Description ◽  
First Order ◽  
Information State ◽  
Modal Description

Modal description logics feature modalities that capture dependence of knowledge on parameters such as time, place, or the information state of agents. E.g., the logic S5-ALC combines the standard description logic ALC with an S5-modality that can be understood as an epistemic operator or as representing (undirected) change. This logic embeds into a corresponding modal first-order logic S5-FOL. We prove a modal characterization theorem for this embedding, in analogy to results by van Benthem and Rosen relating ALC to standard first-order logic: We show that S5-ALC with only local roles is, both over finite and over unrestricted models, precisely the bisimulation-invariant fragment of S5-FOL, thus giving an exact description of the expressive power of S5-ALC with only local roles.

scholarly journals Exact Query Reformulation over Databases with First-order and Description Logics Ontologies

2013 ◽  
Vol 48 ◽  
pp. 885-922 ◽  
Author(s):  
E. Franconi ◽  
V. Kerhet ◽  
N. Ngo
Keyword(s):  
General Framework ◽  
Description Logic ◽  
Description Logics ◽  
Effective Means ◽  
Order Logic ◽  
First Order Logic ◽  
Query Rewriting ◽  
Query Reformulation ◽  
First Order ◽  
Sql Query

We study a general framework for query rewriting in the presence of an arbitrary first-order logic ontology over a database signature. The framework supports deciding the existence of a safe-range first-order equivalent reformulation of a query in terms of the database signature, and if so, it provides an effective approach to construct the reformulation based on interpolation using standard theorem proving techniques (e.g., tableau). Since the reformulation is a safe-range formula, it is effectively executable as an SQL query. At the end, we present a non-trivial application of the framework with ontologies in the very expressive ALCHOIQ description logic, by providing effective means to compute safe-range first-order exact reformulations of queries.

scholarly journals One-parameter model of sterilisation process. Heating and cooling period

2012 ◽  
Vol 52 (No. 3) ◽  
pp. 97-106
Author(s):  
M. Loučka ◽  
P. Veselý ◽  
F. Jaroš ◽  
J. Pavlík
Keyword(s):  
Heat Transfer ◽  
Transfer Model ◽  
Cooling Period ◽  
First Order ◽  
Heating And Cooling ◽  
Wide Range ◽  
Process Heating ◽  
The Common ◽  
The One ◽  
Computing Method

The article deals with the simplification of the heat transfer model for food sterilisation in cans and jars. The one-parameter model was derived and identification procedures of its parameters were examined. It is shown that the concept of the first order dynamics satisfies the technological purposes but the common method of the least squares is not suitable for the calculation of model constants. A new computing method is presented and compared with statistically evaluated experiments with wide range of stuffs and packages.

scholarly journals A Logic For Decidable Reasoning About Actions

2021 ◽  
Author(s):  
Yilan Gu ◽  
Mikhail Soutchanski
Keyword(s):  
Description Logic ◽  
Description Logics ◽  
Order Logic ◽  
Situation Calculus ◽  
Semantic Web Services ◽  
Reasoning About Actions ◽  
First Order ◽  
Projection Problem ◽  
Initial Knowledge ◽  
Taxonomic Reasoning

We consider a modified version of the situation calculus built using a two-variable fragment of the first-order logic extended with counting quantifiers. We mention several additional groups of axioms that can be introduced to capture taxonomic reasoning. We show that the regression operator in this framework can be defined similarly to regression in Reiter’s version of the situation calculus. Using this new regression operator, we show that the projection and executability problems (the important reasoning tasks in the situation calculus) are decidable in the modified version even if an initial knowledge base is incomplete. We also discuss the complexity of solving the projection problem in this modified language in general. Furthermore, we define description logic based sub-languages of our modified situation calculus. They are based on the description logics ALCO(U) (or ALCQO(U), respectively). We show that in these sub-languages solving the projection problem has better computational complexity than in the general modified situation calculus. We mention possible applications to formalization of Semantic Web services and some connections with reasoning about actions based on description logics.

scholarly journals A Logic For Decidable Reasoning About Actions

2021 ◽  
Author(s):  
Yilan Gu ◽  
Mikhail Soutchanski
Keyword(s):  
Description Logic ◽  
Description Logics ◽  
Order Logic ◽  
Situation Calculus ◽  
Semantic Web Services ◽  
Reasoning About Actions ◽  
First Order ◽  
Projection Problem ◽  
Initial Knowledge ◽  
Taxonomic Reasoning

We consider a modified version of the situation calculus built using a two-variable fragment of the first-order logic extended with counting quantifiers. We mention several additional groups of axioms that can be introduced to capture taxonomic reasoning. We show that the regression operator in this framework can be defined similarly to regression in Reiter’s version of the situation calculus. Using this new regression operator, we show that the projection and executability problems (the important reasoning tasks in the situation calculus) are decidable in the modified version even if an initial knowledge base is incomplete. We also discuss the complexity of solving the projection problem in this modified language in general. Furthermore, we define description logic based sub-languages of our modified situation calculus. They are based on the description logics ALCO(U) (or ALCQO(U), respectively). We show that in these sub-languages solving the projection problem has better computational complexity than in the general modified situation calculus. We mention possible applications to formalization of Semantic Web services and some connections with reasoning about actions based on description logics.

THE EU SUGAR MARKET PROFILE AND ITS MAIN DRIVERS

2015 ◽  
Author(s):  
Lubos SMUTKA ◽  
Irena BENEŠOVÁ ◽  
Patrik ROVNÝ ◽  
Renata MATYSIK-PEJAS
Keyword(s):  
Market Failure ◽  
Current System ◽  
Quota System ◽  
Considerable Debate ◽  
Sugar Market ◽  
The Common ◽  
The One ◽  
Production Capacities ◽  
The Given ◽  
The Eu

Sugar is one of the most important elements in human nutrition. The Common Market Organisation for sugar has been a subject of considerable debate since its establishment in 1968. The European agricultural market has been criticized for its heavy regulations and subsidization. The sugar market is one of the most regulated ones; however, this will change radically in 2017 when the current system of production quotas will end. The current EU sugar market changed is structure during the last several decades. The significant number of companies left the market and EU internal sugar market became more concentrated. The aim of this paper is presentation characteristics of sugar market with respect to the supposed market failure – reduction in competition. The analysis also identifies the main drivers and determinants of the EU especially quota sugar market. In relation to paper’s aim the following results are important. The present conditions of the European sugar market have led to market failure when nearly 75 % (10 million tonnes) of the quota is controlled by five multinational companies only. These multinational alliances (especially German and French one) are also taking control over the production capacities of their subsidiaries. In most countries, this causes serious problems as the given quota is controlled by one or two producers only. This is a significant indicator of market imperfection. The quota system cannot overcome the problem of production quotas on the one hand and the demand on the other; furthermore, it also leads to economic inefficiency. The current EU sugar market is under the control of only Sudzucker, Nordzucker, Pfeifer and Langen, Tereos and ABF.

Sign in / Sign up

Export Citation Format

Share Document