$\boldsymbol {\cal BC\!D\!L}$: Basic Constructive Description Logic
Abstract In this paper we present ${\mbox{\mbox{${\cal BC\!D\!L}$}}}$, a description logic based on information terms semantics, which allows a constructive interpretation of ${\mbox{\mbox{${\cal ALC}$}}}$ formulas. In the paper we describe the information terms semantics, we define a natural deduct...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Ferrari, Mauro [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2009 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer Science+Business Media B.V. 2009 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Journal of automated reasoning - Springer Netherlands, 1985, 44(2009), 4 vom: 17. Dez., Seite 371-399 |
|---|---|
| Übergeordnetes Werk: |
volume:44 ; year:2009 ; number:4 ; day:17 ; month:12 ; pages:371-399 |
| Links: |
|---|
| DOI / URN: |
10.1007/s10817-009-9160-7 |
|---|
| Katalog-ID: |
OLC2034709047 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2034709047 | ||
| 003 | DE-627 | ||
| 005 | 20230503112836.0 | ||
| 007 | tu | ||
| 008 | 200819s2009 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s10817-009-9160-7 |2 doi | |
| 035 | |a (DE-627)OLC2034709047 | ||
| 035 | |a (DE-He213)s10817-009-9160-7-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 400 |a 004 |q VZ |
| 084 | |a 7,11 |a 17,1 |2 ssgn | ||
| 084 | |a LING |q DE-30 |2 fid | ||
| 100 | 1 | |a Ferrari, Mauro |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a $\boldsymbol {\cal BC\!D\!L}$: Basic Constructive Description Logic |
| 264 | 1 | |c 2009 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Springer Science+Business Media B.V. 2009 | ||
| 520 | |a Abstract In this paper we present ${\mbox{\mbox{${\cal BC\!D\!L}$}}}$, a description logic based on information terms semantics, which allows a constructive interpretation of ${\mbox{\mbox{${\cal ALC}$}}}$ formulas. In the paper we describe the information terms semantics, we define a natural deduction calculus for ${\mbox{\mbox{${\cal BC\!D\!L}$}}}$ and we show it is sound and complete. As a first application of proof-theoretical properties of the calculus, we show how it fulfills the proofs-as-programs paradigm. Finally, we discuss the role of generators, the main element distinguishing our formalisation from the usual ones. | ||
| 650 | 4 | |a Description logics | |
| 650 | 4 | |a Constructive logics | |
| 650 | 4 | |a Natural deduction | |
| 700 | 1 | |a Fiorentini, Camillo |4 aut | |
| 700 | 1 | |a Fiorino, Guido |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Journal of automated reasoning |d Springer Netherlands, 1985 |g 44(2009), 4 vom: 17. Dez., Seite 371-399 |w (DE-627)129175277 |w (DE-600)51516-4 |w (DE-576)01445551X |x 0168-7433 |7 nnns |
| 773 | 1 | 8 | |g volume:44 |g year:2009 |g number:4 |g day:17 |g month:12 |g pages:371-399 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s10817-009-9160-7 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a FID-LING | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a SSG-OPC-MAT | ||
| 912 | |a GBV_ILN_21 | ||
| 912 | |a GBV_ILN_40 | ||
| 912 | |a GBV_ILN_65 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_285 | ||
| 912 | |a GBV_ILN_2006 | ||
| 912 | |a GBV_ILN_2010 | ||
| 912 | |a GBV_ILN_2021 | ||
| 912 | |a GBV_ILN_2190 | ||
| 912 | |a GBV_ILN_4046 | ||
| 912 | |a GBV_ILN_4082 | ||
| 912 | |a GBV_ILN_4116 | ||
| 912 | |a GBV_ILN_4305 | ||
| 912 | |a GBV_ILN_4700 | ||
| 951 | |a AR | ||
| 952 | |d 44 |j 2009 |e 4 |b 17 |c 12 |h 371-399 | ||
| author_variant |
m f mf c f cf g f gf |
|---|---|
| matchkey_str |
article:01687433:2009----::odyblabdbscosrciee |
| hierarchy_sort_str |
2009 |
| publishDate |
2009 |
| allfields |
10.1007/s10817-009-9160-7 doi (DE-627)OLC2034709047 (DE-He213)s10817-009-9160-7-p DE-627 ger DE-627 rakwb eng 400 004 VZ 7,11 17,1 ssgn LING DE-30 fid Ferrari, Mauro verfasserin aut $\boldsymbol {\cal BC\!D\!L}$: Basic Constructive Description Logic 2009 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media B.V. 2009 Abstract In this paper we present ${\mbox{\mbox{${\cal BC\!D\!L}$}}}$, a description logic based on information terms semantics, which allows a constructive interpretation of ${\mbox{\mbox{${\cal ALC}$}}}$ formulas. In the paper we describe the information terms semantics, we define a natural deduction calculus for ${\mbox{\mbox{${\cal BC\!D\!L}$}}}$ and we show it is sound and complete. As a first application of proof-theoretical properties of the calculus, we show how it fulfills the proofs-as-programs paradigm. Finally, we discuss the role of generators, the main element distinguishing our formalisation from the usual ones. Description logics Constructive logics Natural deduction Fiorentini, Camillo aut Fiorino, Guido aut Enthalten in Journal of automated reasoning Springer Netherlands, 1985 44(2009), 4 vom: 17. Dez., Seite 371-399 (DE-627)129175277 (DE-600)51516-4 (DE-576)01445551X 0168-7433 nnns volume:44 year:2009 number:4 day:17 month:12 pages:371-399 https://doi.org/10.1007/s10817-009-9160-7 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC FID-LING SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_21 GBV_ILN_40 GBV_ILN_65 GBV_ILN_70 GBV_ILN_285 GBV_ILN_2006 GBV_ILN_2010 GBV_ILN_2021 GBV_ILN_2190 GBV_ILN_4046 GBV_ILN_4082 GBV_ILN_4116 GBV_ILN_4305 GBV_ILN_4700 AR 44 2009 4 17 12 371-399 |
| spelling |
10.1007/s10817-009-9160-7 doi (DE-627)OLC2034709047 (DE-He213)s10817-009-9160-7-p DE-627 ger DE-627 rakwb eng 400 004 VZ 7,11 17,1 ssgn LING DE-30 fid Ferrari, Mauro verfasserin aut $\boldsymbol {\cal BC\!D\!L}$: Basic Constructive Description Logic 2009 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media B.V. 2009 Abstract In this paper we present ${\mbox{\mbox{${\cal BC\!D\!L}$}}}$, a description logic based on information terms semantics, which allows a constructive interpretation of ${\mbox{\mbox{${\cal ALC}$}}}$ formulas. In the paper we describe the information terms semantics, we define a natural deduction calculus for ${\mbox{\mbox{${\cal BC\!D\!L}$}}}$ and we show it is sound and complete. As a first application of proof-theoretical properties of the calculus, we show how it fulfills the proofs-as-programs paradigm. Finally, we discuss the role of generators, the main element distinguishing our formalisation from the usual ones. Description logics Constructive logics Natural deduction Fiorentini, Camillo aut Fiorino, Guido aut Enthalten in Journal of automated reasoning Springer Netherlands, 1985 44(2009), 4 vom: 17. Dez., Seite 371-399 (DE-627)129175277 (DE-600)51516-4 (DE-576)01445551X 0168-7433 nnns volume:44 year:2009 number:4 day:17 month:12 pages:371-399 https://doi.org/10.1007/s10817-009-9160-7 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC FID-LING SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_21 GBV_ILN_40 GBV_ILN_65 GBV_ILN_70 GBV_ILN_285 GBV_ILN_2006 GBV_ILN_2010 GBV_ILN_2021 GBV_ILN_2190 GBV_ILN_4046 GBV_ILN_4082 GBV_ILN_4116 GBV_ILN_4305 GBV_ILN_4700 AR 44 2009 4 17 12 371-399 |
| allfields_unstemmed |
10.1007/s10817-009-9160-7 doi (DE-627)OLC2034709047 (DE-He213)s10817-009-9160-7-p DE-627 ger DE-627 rakwb eng 400 004 VZ 7,11 17,1 ssgn LING DE-30 fid Ferrari, Mauro verfasserin aut $\boldsymbol {\cal BC\!D\!L}$: Basic Constructive Description Logic 2009 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media B.V. 2009 Abstract In this paper we present ${\mbox{\mbox{${\cal BC\!D\!L}$}}}$, a description logic based on information terms semantics, which allows a constructive interpretation of ${\mbox{\mbox{${\cal ALC}$}}}$ formulas. In the paper we describe the information terms semantics, we define a natural deduction calculus for ${\mbox{\mbox{${\cal BC\!D\!L}$}}}$ and we show it is sound and complete. As a first application of proof-theoretical properties of the calculus, we show how it fulfills the proofs-as-programs paradigm. Finally, we discuss the role of generators, the main element distinguishing our formalisation from the usual ones. Description logics Constructive logics Natural deduction Fiorentini, Camillo aut Fiorino, Guido aut Enthalten in Journal of automated reasoning Springer Netherlands, 1985 44(2009), 4 vom: 17. Dez., Seite 371-399 (DE-627)129175277 (DE-600)51516-4 (DE-576)01445551X 0168-7433 nnns volume:44 year:2009 number:4 day:17 month:12 pages:371-399 https://doi.org/10.1007/s10817-009-9160-7 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC FID-LING SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_21 GBV_ILN_40 GBV_ILN_65 GBV_ILN_70 GBV_ILN_285 GBV_ILN_2006 GBV_ILN_2010 GBV_ILN_2021 GBV_ILN_2190 GBV_ILN_4046 GBV_ILN_4082 GBV_ILN_4116 GBV_ILN_4305 GBV_ILN_4700 AR 44 2009 4 17 12 371-399 |
| allfieldsGer |
10.1007/s10817-009-9160-7 doi (DE-627)OLC2034709047 (DE-He213)s10817-009-9160-7-p DE-627 ger DE-627 rakwb eng 400 004 VZ 7,11 17,1 ssgn LING DE-30 fid Ferrari, Mauro verfasserin aut $\boldsymbol {\cal BC\!D\!L}$: Basic Constructive Description Logic 2009 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media B.V. 2009 Abstract In this paper we present ${\mbox{\mbox{${\cal BC\!D\!L}$}}}$, a description logic based on information terms semantics, which allows a constructive interpretation of ${\mbox{\mbox{${\cal ALC}$}}}$ formulas. In the paper we describe the information terms semantics, we define a natural deduction calculus for ${\mbox{\mbox{${\cal BC\!D\!L}$}}}$ and we show it is sound and complete. As a first application of proof-theoretical properties of the calculus, we show how it fulfills the proofs-as-programs paradigm. Finally, we discuss the role of generators, the main element distinguishing our formalisation from the usual ones. Description logics Constructive logics Natural deduction Fiorentini, Camillo aut Fiorino, Guido aut Enthalten in Journal of automated reasoning Springer Netherlands, 1985 44(2009), 4 vom: 17. Dez., Seite 371-399 (DE-627)129175277 (DE-600)51516-4 (DE-576)01445551X 0168-7433 nnns volume:44 year:2009 number:4 day:17 month:12 pages:371-399 https://doi.org/10.1007/s10817-009-9160-7 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC FID-LING SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_21 GBV_ILN_40 GBV_ILN_65 GBV_ILN_70 GBV_ILN_285 GBV_ILN_2006 GBV_ILN_2010 GBV_ILN_2021 GBV_ILN_2190 GBV_ILN_4046 GBV_ILN_4082 GBV_ILN_4116 GBV_ILN_4305 GBV_ILN_4700 AR 44 2009 4 17 12 371-399 |
| allfieldsSound |
10.1007/s10817-009-9160-7 doi (DE-627)OLC2034709047 (DE-He213)s10817-009-9160-7-p DE-627 ger DE-627 rakwb eng 400 004 VZ 7,11 17,1 ssgn LING DE-30 fid Ferrari, Mauro verfasserin aut $\boldsymbol {\cal BC\!D\!L}$: Basic Constructive Description Logic 2009 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media B.V. 2009 Abstract In this paper we present ${\mbox{\mbox{${\cal BC\!D\!L}$}}}$, a description logic based on information terms semantics, which allows a constructive interpretation of ${\mbox{\mbox{${\cal ALC}$}}}$ formulas. In the paper we describe the information terms semantics, we define a natural deduction calculus for ${\mbox{\mbox{${\cal BC\!D\!L}$}}}$ and we show it is sound and complete. As a first application of proof-theoretical properties of the calculus, we show how it fulfills the proofs-as-programs paradigm. Finally, we discuss the role of generators, the main element distinguishing our formalisation from the usual ones. Description logics Constructive logics Natural deduction Fiorentini, Camillo aut Fiorino, Guido aut Enthalten in Journal of automated reasoning Springer Netherlands, 1985 44(2009), 4 vom: 17. Dez., Seite 371-399 (DE-627)129175277 (DE-600)51516-4 (DE-576)01445551X 0168-7433 nnns volume:44 year:2009 number:4 day:17 month:12 pages:371-399 https://doi.org/10.1007/s10817-009-9160-7 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC FID-LING SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_21 GBV_ILN_40 GBV_ILN_65 GBV_ILN_70 GBV_ILN_285 GBV_ILN_2006 GBV_ILN_2010 GBV_ILN_2021 GBV_ILN_2190 GBV_ILN_4046 GBV_ILN_4082 GBV_ILN_4116 GBV_ILN_4305 GBV_ILN_4700 AR 44 2009 4 17 12 371-399 |
| language |
English |
| source |
Enthalten in Journal of automated reasoning 44(2009), 4 vom: 17. Dez., Seite 371-399 volume:44 year:2009 number:4 day:17 month:12 pages:371-399 |
| sourceStr |
Enthalten in Journal of automated reasoning 44(2009), 4 vom: 17. Dez., Seite 371-399 volume:44 year:2009 number:4 day:17 month:12 pages:371-399 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Description logics Constructive logics Natural deduction |
| dewey-raw |
400 |
| isfreeaccess_bool |
false |
| container_title |
Journal of automated reasoning |
| authorswithroles_txt_mv |
Ferrari, Mauro @@aut@@ Fiorentini, Camillo @@aut@@ Fiorino, Guido @@aut@@ |
| publishDateDaySort_date |
2009-12-17T00:00:00Z |
| hierarchy_top_id |
129175277 |
| dewey-sort |
3400 |
| id |
OLC2034709047 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2034709047</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503112836.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2009 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10817-009-9160-7</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2034709047</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10817-009-9160-7-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">400</subfield><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">7,11</subfield><subfield code="a">17,1</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">LING</subfield><subfield code="q">DE-30</subfield><subfield code="2">fid</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ferrari, Mauro</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">$\boldsymbol {\cal BC\!D\!L}$: Basic Constructive Description Logic</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2009</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media B.V. 2009</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract In this paper we present ${\mbox{\mbox{${\cal BC\!D\!L}$}}}$, a description logic based on information terms semantics, which allows a constructive interpretation of ${\mbox{\mbox{${\cal ALC}$}}}$ formulas. In the paper we describe the information terms semantics, we define a natural deduction calculus for ${\mbox{\mbox{${\cal BC\!D\!L}$}}}$ and we show it is sound and complete. As a first application of proof-theoretical properties of the calculus, we show how it fulfills the proofs-as-programs paradigm. Finally, we discuss the role of generators, the main element distinguishing our formalisation from the usual ones.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Description logics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Constructive logics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Natural deduction</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Fiorentini, Camillo</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Fiorino, Guido</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Journal of automated reasoning</subfield><subfield code="d">Springer Netherlands, 1985</subfield><subfield code="g">44(2009), 4 vom: 17. Dez., Seite 371-399</subfield><subfield code="w">(DE-627)129175277</subfield><subfield code="w">(DE-600)51516-4</subfield><subfield code="w">(DE-576)01445551X</subfield><subfield code="x">0168-7433</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:44</subfield><subfield code="g">year:2009</subfield><subfield code="g">number:4</subfield><subfield code="g">day:17</subfield><subfield code="g">month:12</subfield><subfield code="g">pages:371-399</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10817-009-9160-7</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">FID-LING</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_21</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4082</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4116</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">44</subfield><subfield code="j">2009</subfield><subfield code="e">4</subfield><subfield code="b">17</subfield><subfield code="c">12</subfield><subfield code="h">371-399</subfield></datafield></record></collection>
|
| author |
Ferrari, Mauro |
| spellingShingle |
Ferrari, Mauro ddc 400 ssgn 7,11 fid LING misc Description logics misc Constructive logics misc Natural deduction $\boldsymbol {\cal BC\!D\!L}$: Basic Constructive Description Logic |
| authorStr |
Ferrari, Mauro |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)129175277 |
| format |
Article |
| dewey-ones |
400 - Language 004 - Data processing & computer science |
| delete_txt_mv |
keep |
| author_role |
aut aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0168-7433 |
| topic_title |
400 004 VZ 7,11 17,1 ssgn LING DE-30 fid $\boldsymbol {\cal BC\!D\!L}$: Basic Constructive Description Logic Description logics Constructive logics Natural deduction |
| topic |
ddc 400 ssgn 7,11 fid LING misc Description logics misc Constructive logics misc Natural deduction |
| topic_unstemmed |
ddc 400 ssgn 7,11 fid LING misc Description logics misc Constructive logics misc Natural deduction |
| topic_browse |
ddc 400 ssgn 7,11 fid LING misc Description logics misc Constructive logics misc Natural deduction |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Journal of automated reasoning |
| hierarchy_parent_id |
129175277 |
| dewey-tens |
400 - Language 000 - Computer science, knowledge & systems |
| hierarchy_top_title |
Journal of automated reasoning |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)129175277 (DE-600)51516-4 (DE-576)01445551X |
| title |
$\boldsymbol {\cal BC\!D\!L}$: Basic Constructive Description Logic |
| ctrlnum |
(DE-627)OLC2034709047 (DE-He213)s10817-009-9160-7-p |
| title_full |
$\boldsymbol {\cal BC\!D\!L}$: Basic Constructive Description Logic |
| author_sort |
Ferrari, Mauro |
| journal |
Journal of automated reasoning |
| journalStr |
Journal of automated reasoning |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
400 - Language 000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
2009 |
| contenttype_str_mv |
txt |
| container_start_page |
371 |
| author_browse |
Ferrari, Mauro Fiorentini, Camillo Fiorino, Guido |
| container_volume |
44 |
| class |
400 004 VZ 7,11 17,1 ssgn LING DE-30 fid |
| format_se |
Aufsätze |
| author-letter |
Ferrari, Mauro |
| doi_str_mv |
10.1007/s10817-009-9160-7 |
| dewey-full |
400 004 |
| title_sort |
$\boldsymbol {\cal bc\!d\!l}$: basic constructive description logic |
| title_auth |
$\boldsymbol {\cal BC\!D\!L}$: Basic Constructive Description Logic |
| abstract |
Abstract In this paper we present ${\mbox{\mbox{${\cal BC\!D\!L}$}}}$, a description logic based on information terms semantics, which allows a constructive interpretation of ${\mbox{\mbox{${\cal ALC}$}}}$ formulas. In the paper we describe the information terms semantics, we define a natural deduction calculus for ${\mbox{\mbox{${\cal BC\!D\!L}$}}}$ and we show it is sound and complete. As a first application of proof-theoretical properties of the calculus, we show how it fulfills the proofs-as-programs paradigm. Finally, we discuss the role of generators, the main element distinguishing our formalisation from the usual ones. © Springer Science+Business Media B.V. 2009 |
| abstractGer |
Abstract In this paper we present ${\mbox{\mbox{${\cal BC\!D\!L}$}}}$, a description logic based on information terms semantics, which allows a constructive interpretation of ${\mbox{\mbox{${\cal ALC}$}}}$ formulas. In the paper we describe the information terms semantics, we define a natural deduction calculus for ${\mbox{\mbox{${\cal BC\!D\!L}$}}}$ and we show it is sound and complete. As a first application of proof-theoretical properties of the calculus, we show how it fulfills the proofs-as-programs paradigm. Finally, we discuss the role of generators, the main element distinguishing our formalisation from the usual ones. © Springer Science+Business Media B.V. 2009 |
| abstract_unstemmed |
Abstract In this paper we present ${\mbox{\mbox{${\cal BC\!D\!L}$}}}$, a description logic based on information terms semantics, which allows a constructive interpretation of ${\mbox{\mbox{${\cal ALC}$}}}$ formulas. In the paper we describe the information terms semantics, we define a natural deduction calculus for ${\mbox{\mbox{${\cal BC\!D\!L}$}}}$ and we show it is sound and complete. As a first application of proof-theoretical properties of the calculus, we show how it fulfills the proofs-as-programs paradigm. Finally, we discuss the role of generators, the main element distinguishing our formalisation from the usual ones. © Springer Science+Business Media B.V. 2009 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC FID-LING SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_21 GBV_ILN_40 GBV_ILN_65 GBV_ILN_70 GBV_ILN_285 GBV_ILN_2006 GBV_ILN_2010 GBV_ILN_2021 GBV_ILN_2190 GBV_ILN_4046 GBV_ILN_4082 GBV_ILN_4116 GBV_ILN_4305 GBV_ILN_4700 |
| container_issue |
4 |
| title_short |
$\boldsymbol {\cal BC\!D\!L}$: Basic Constructive Description Logic |
| url |
https://doi.org/10.1007/s10817-009-9160-7 |
| remote_bool |
false |
| author2 |
Fiorentini, Camillo Fiorino, Guido |
| author2Str |
Fiorentini, Camillo Fiorino, Guido |
| ppnlink |
129175277 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s10817-009-9160-7 |
| up_date |
2024-07-03T22:06:42.752Z |
| _version_ |
1803597279663226880 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2034709047</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503112836.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2009 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10817-009-9160-7</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2034709047</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10817-009-9160-7-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">400</subfield><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">7,11</subfield><subfield code="a">17,1</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">LING</subfield><subfield code="q">DE-30</subfield><subfield code="2">fid</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ferrari, Mauro</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">$\boldsymbol {\cal BC\!D\!L}$: Basic Constructive Description Logic</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2009</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Science+Business Media B.V. 2009</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract In this paper we present ${\mbox{\mbox{${\cal BC\!D\!L}$}}}$, a description logic based on information terms semantics, which allows a constructive interpretation of ${\mbox{\mbox{${\cal ALC}$}}}$ formulas. In the paper we describe the information terms semantics, we define a natural deduction calculus for ${\mbox{\mbox{${\cal BC\!D\!L}$}}}$ and we show it is sound and complete. As a first application of proof-theoretical properties of the calculus, we show how it fulfills the proofs-as-programs paradigm. Finally, we discuss the role of generators, the main element distinguishing our formalisation from the usual ones.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Description logics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Constructive logics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Natural deduction</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Fiorentini, Camillo</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Fiorino, Guido</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Journal of automated reasoning</subfield><subfield code="d">Springer Netherlands, 1985</subfield><subfield code="g">44(2009), 4 vom: 17. Dez., Seite 371-399</subfield><subfield code="w">(DE-627)129175277</subfield><subfield code="w">(DE-600)51516-4</subfield><subfield code="w">(DE-576)01445551X</subfield><subfield code="x">0168-7433</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:44</subfield><subfield code="g">year:2009</subfield><subfield code="g">number:4</subfield><subfield code="g">day:17</subfield><subfield code="g">month:12</subfield><subfield code="g">pages:371-399</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10817-009-9160-7</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">FID-LING</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_21</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4082</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4116</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">44</subfield><subfield code="j">2009</subfield><subfield code="e">4</subfield><subfield code="b">17</subfield><subfield code="c">12</subfield><subfield code="h">371-399</subfield></datafield></record></collection>
|
| score |
7.397687 |