A proof theory for description logics by Alexandre Rademaker

By Alexandre Rademaker

Advent -- heritage -- The Sequent Calculus for ALC -- evaluating SC ALC SC with different ALC Deduction platforms -- A usual Deduction for ALC -- in the direction of an evidence conception for ALCQI -- Proofs and factors -- A Prototype Theorem Prover -- end

Show description

Read or Download A proof theory for description logics PDF

Best theory books

Statistical Theory and Computational Aspects of Smoothing: Proceedings of the COMPSTAT ’94 Satellite Meeting held in Semmering, Austria, 27–28 August 1994

One of many major functions of statistical smoothing ideas is nonparametric regression. For the final 15 years there was a robust theoretical curiosity within the improvement of such ideas. similar algorithmic strategies were a major problem in computational data. Smoothing concepts in regression in addition to different statistical equipment are more and more utilized in biosciences and economics.

Real Estate Valuation Theory

Genuine property Valuation idea is equipped round 5 different types of highbrow contribution to the whole-appraiser choice making and valuation accuracy, software of nontraditional appraisal ideas corresponding to regression and the minimum-variance grid strategy, appraising infected estate, advert valorem tax overview, and new views on conventional appraisal equipment.

A Unified theory of plastic buckling of columns and plates

At the foundation of recent plasticity concerns, a unified concept of plastic buckling appropriate to either columns and plates has been constructed. For uniform compression, the speculation exhibits indicates that lengthy columns which bend with no considerable twisting require the tangent modulus and that lengthy flanges which twist with no considerable bending require the secant modulus.

Extra info for A proof theory for description logics

Example text

The method used in this section is a basis for constructing a proof of SCALCQI completeness. 2. Since the results of Sect. 3 are obtained from a SCALC without cut-rule, we are actually proving the completeness of SCALC without the cut-rule. Given that, the results can also be considered an alternative method of cut-elimination for A. 1007/978-1-4471-4002-3_4, © The Author(s) 2012 37 4 Comparing SCALC with Other ALC Deduction Systems 38 the SCALC presented in Sect. 4, where we followed Gentzen’s original proof for cut elimination.

Moreover, weak rules will be used with the unique purpose of enabling promotion rules applications. 44 4 Comparing SCALC with Other ALC Deduction Systems A more insightful definition of the last item above would be possible if we replace the weak rules in SC[] ALC by the weak ∗ rule below. [Δ ], [Δ, Δ1 ]k , Δ ⇒ Γ, [Γ1 , Γ ]k , [Γ ] [Δ ], Δ, Δ1 ⇒ Γ1 , Γ, [Γ ] weak ∗ Lemma 6 The weak ∗ rule is a derived rule in SC[] ALC . Proof To prove Lemma 6, given a derivation fragment Π with a weak ∗ rule application, we show how to replace it by successive weak-l and weak-r applications.

If SC∗T ALC Δ ⇒ Γ then there is a free-quasi-mix free SC∗T ALC -proof of Δ ⇒ Γ . Theorem 2 is a consequence of the following lemma. Lemma 4 If P is a proof of S (in SC∗T ALC ) which contains only one free-quasi-mix, occurring as the last inference, then S is provable without any free-quasi-mix. Theorem 2 is obtained from Lemma 4 by simple induction over the number of quasi-free-mix occurring in a proof P. We can now concentrate our attention on Lemma 4. First we define three scalars as a measure of the complexity of the proof.

Download PDF sample

Rated 4.91 of 5 – based on 47 votes