Searching contexts in paraconsistent rough description logic
Background Query refinement is an interactive process of query modification used to increase or decrease the scope of search results in databases or ontologies. Methods We present a method to obtain optimized query refinements of assertion axioms in the paraconsistent rough description logic $\mathc...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Viana, Henrique [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2015 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Viana et al. 2015. This is an Open Access article distributed under the terms of the Creative Commons Attribution License ( |
|---|
| Übergeordnetes Werk: |
Enthalten in: Journal of the Brazilian Computer Society - London : Springer, 1996, 21(2015), 1 vom: 07. Juli |
|---|---|
| Übergeordnetes Werk: |
volume:21 ; year:2015 ; number:1 ; day:07 ; month:07 |
| Links: |
|---|
| DOI / URN: |
10.1186/s13173-015-0031-2 |
|---|
| Katalog-ID: |
SPR030744059 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | SPR030744059 | ||
| 003 | DE-627 | ||
| 005 | 20230331101735.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 201007s2015 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1186/s13173-015-0031-2 |2 doi | |
| 035 | |a (DE-627)SPR030744059 | ||
| 035 | |a (SPR)s13173-015-0031-2-e | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 100 | 1 | |a Viana, Henrique |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Searching contexts in paraconsistent rough description logic |
| 264 | 1 | |c 2015 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 500 | |a © Viana et al. 2015. This is an Open Access article distributed under the terms of the Creative Commons Attribution License ( | ||
| 520 | |a Background Query refinement is an interactive process of query modification used to increase or decrease the scope of search results in databases or ontologies. Methods We present a method to obtain optimized query refinements of assertion axioms in the paraconsistent rough description logic $\mathcal {PR_{\textit {ALC}}}$, a four-valued paraconsistent version of the rough $\mathcal {ALC}$, which is grounded on Belnap’s Logic. This method is based on the notion of the discernibility matrix commonly used in the process of attribute reduction in the rough set theory. It consists of finding sets of concepts which satisfy the rough set approximation operations in assertion axioms. Consequently, these sets of concepts can be used to restrict or relax queries in this logic. Results We propose two algorithms to settle this problem of query refinement in $\mathcal {PR_{\textit {ALC}}}$ and show their complexity results. Conclusions The problem of query restrictions using contextual approximation is proved to have exponential time complexity, while the problem of query relaxations has polynomial space complexity. | ||
| 650 | 4 | |a Description logics |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a Rough sets |7 (dpeaa)DE-He213 | |
| 650 | 4 | |a Query refinement |7 (dpeaa)DE-He213 | |
| 700 | 1 | |a Alcântara, João |4 aut | |
| 700 | 1 | |a Martins, Ana Teresa |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Journal of the Brazilian Computer Society |d London : Springer, 1996 |g 21(2015), 1 vom: 07. Juli |w (DE-627)324613377 |w (DE-600)2028746-X |x 1678-4804 |7 nnns |
| 773 | 1 | 8 | |g volume:21 |g year:2015 |g number:1 |g day:07 |g month:07 |
| 856 | 4 | 0 | |u https://dx.doi.org/10.1186/s13173-015-0031-2 |z kostenfrei |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_SPRINGER | ||
| 912 | |a GBV_ILN_11 | ||
| 912 | |a GBV_ILN_20 | ||
| 912 | |a GBV_ILN_22 | ||
| 912 | |a GBV_ILN_23 | ||
| 912 | |a GBV_ILN_24 | ||
| 912 | |a GBV_ILN_31 | ||
| 912 | |a GBV_ILN_39 | ||
| 912 | |a GBV_ILN_40 | ||
| 912 | |a GBV_ILN_60 | ||
| 912 | |a GBV_ILN_62 | ||
| 912 | |a GBV_ILN_63 | ||
| 912 | |a GBV_ILN_65 | ||
| 912 | |a GBV_ILN_69 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_73 | ||
| 912 | |a GBV_ILN_95 | ||
| 912 | |a GBV_ILN_105 | ||
| 912 | |a GBV_ILN_110 | ||
| 912 | |a GBV_ILN_151 | ||
| 912 | |a GBV_ILN_161 | ||
| 912 | |a GBV_ILN_170 | ||
| 912 | |a GBV_ILN_213 | ||
| 912 | |a GBV_ILN_230 | ||
| 912 | |a GBV_ILN_285 | ||
| 912 | |a GBV_ILN_293 | ||
| 912 | |a GBV_ILN_370 | ||
| 912 | |a GBV_ILN_602 | ||
| 912 | |a GBV_ILN_702 | ||
| 912 | |a GBV_ILN_2014 | ||
| 912 | |a GBV_ILN_2055 | ||
| 912 | |a GBV_ILN_2190 | ||
| 912 | |a GBV_ILN_4012 | ||
| 912 | |a GBV_ILN_4035 | ||
| 912 | |a GBV_ILN_4037 | ||
| 912 | |a GBV_ILN_4112 | ||
| 912 | |a GBV_ILN_4125 | ||
| 912 | |a GBV_ILN_4126 | ||
| 912 | |a GBV_ILN_4242 | ||
| 912 | |a GBV_ILN_4246 | ||
| 912 | |a GBV_ILN_4249 | ||
| 912 | |a GBV_ILN_4251 | ||
| 912 | |a GBV_ILN_4305 | ||
| 912 | |a GBV_ILN_4306 | ||
| 912 | |a GBV_ILN_4307 | ||
| 912 | |a GBV_ILN_4313 | ||
| 912 | |a GBV_ILN_4322 | ||
| 912 | |a GBV_ILN_4323 | ||
| 912 | |a GBV_ILN_4324 | ||
| 912 | |a GBV_ILN_4325 | ||
| 912 | |a GBV_ILN_4326 | ||
| 912 | |a GBV_ILN_4335 | ||
| 912 | |a GBV_ILN_4338 | ||
| 912 | |a GBV_ILN_4367 | ||
| 912 | |a GBV_ILN_4700 | ||
| 951 | |a AR | ||
| 952 | |d 21 |j 2015 |e 1 |b 07 |c 07 | ||
| author_variant |
h v hv j a ja a t m at atm |
|---|---|
| matchkey_str |
article:16784804:2015----::erhncnetiprcnitnruh |
| hierarchy_sort_str |
2015 |
| publishDate |
2015 |
| allfields |
10.1186/s13173-015-0031-2 doi (DE-627)SPR030744059 (SPR)s13173-015-0031-2-e DE-627 ger DE-627 rakwb eng Viana, Henrique verfasserin aut Searching contexts in paraconsistent rough description logic 2015 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © Viana et al. 2015. This is an Open Access article distributed under the terms of the Creative Commons Attribution License ( Background Query refinement is an interactive process of query modification used to increase or decrease the scope of search results in databases or ontologies. Methods We present a method to obtain optimized query refinements of assertion axioms in the paraconsistent rough description logic $\mathcal {PR_{\textit {ALC}}}$, a four-valued paraconsistent version of the rough $\mathcal {ALC}$, which is grounded on Belnap’s Logic. This method is based on the notion of the discernibility matrix commonly used in the process of attribute reduction in the rough set theory. It consists of finding sets of concepts which satisfy the rough set approximation operations in assertion axioms. Consequently, these sets of concepts can be used to restrict or relax queries in this logic. Results We propose two algorithms to settle this problem of query refinement in $\mathcal {PR_{\textit {ALC}}}$ and show their complexity results. Conclusions The problem of query restrictions using contextual approximation is proved to have exponential time complexity, while the problem of query relaxations has polynomial space complexity. Description logics (dpeaa)DE-He213 Rough sets (dpeaa)DE-He213 Query refinement (dpeaa)DE-He213 Alcântara, João aut Martins, Ana Teresa aut Enthalten in Journal of the Brazilian Computer Society London : Springer, 1996 21(2015), 1 vom: 07. Juli (DE-627)324613377 (DE-600)2028746-X 1678-4804 nnns volume:21 year:2015 number:1 day:07 month:07 https://dx.doi.org/10.1186/s13173-015-0031-2 kostenfrei Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2014 GBV_ILN_2055 GBV_ILN_2190 GBV_ILN_4012 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 21 2015 1 07 07 |
| spelling |
10.1186/s13173-015-0031-2 doi (DE-627)SPR030744059 (SPR)s13173-015-0031-2-e DE-627 ger DE-627 rakwb eng Viana, Henrique verfasserin aut Searching contexts in paraconsistent rough description logic 2015 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © Viana et al. 2015. This is an Open Access article distributed under the terms of the Creative Commons Attribution License ( Background Query refinement is an interactive process of query modification used to increase or decrease the scope of search results in databases or ontologies. Methods We present a method to obtain optimized query refinements of assertion axioms in the paraconsistent rough description logic $\mathcal {PR_{\textit {ALC}}}$, a four-valued paraconsistent version of the rough $\mathcal {ALC}$, which is grounded on Belnap’s Logic. This method is based on the notion of the discernibility matrix commonly used in the process of attribute reduction in the rough set theory. It consists of finding sets of concepts which satisfy the rough set approximation operations in assertion axioms. Consequently, these sets of concepts can be used to restrict or relax queries in this logic. Results We propose two algorithms to settle this problem of query refinement in $\mathcal {PR_{\textit {ALC}}}$ and show their complexity results. Conclusions The problem of query restrictions using contextual approximation is proved to have exponential time complexity, while the problem of query relaxations has polynomial space complexity. Description logics (dpeaa)DE-He213 Rough sets (dpeaa)DE-He213 Query refinement (dpeaa)DE-He213 Alcântara, João aut Martins, Ana Teresa aut Enthalten in Journal of the Brazilian Computer Society London : Springer, 1996 21(2015), 1 vom: 07. Juli (DE-627)324613377 (DE-600)2028746-X 1678-4804 nnns volume:21 year:2015 number:1 day:07 month:07 https://dx.doi.org/10.1186/s13173-015-0031-2 kostenfrei Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2014 GBV_ILN_2055 GBV_ILN_2190 GBV_ILN_4012 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 21 2015 1 07 07 |
| allfields_unstemmed |
10.1186/s13173-015-0031-2 doi (DE-627)SPR030744059 (SPR)s13173-015-0031-2-e DE-627 ger DE-627 rakwb eng Viana, Henrique verfasserin aut Searching contexts in paraconsistent rough description logic 2015 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © Viana et al. 2015. This is an Open Access article distributed under the terms of the Creative Commons Attribution License ( Background Query refinement is an interactive process of query modification used to increase or decrease the scope of search results in databases or ontologies. Methods We present a method to obtain optimized query refinements of assertion axioms in the paraconsistent rough description logic $\mathcal {PR_{\textit {ALC}}}$, a four-valued paraconsistent version of the rough $\mathcal {ALC}$, which is grounded on Belnap’s Logic. This method is based on the notion of the discernibility matrix commonly used in the process of attribute reduction in the rough set theory. It consists of finding sets of concepts which satisfy the rough set approximation operations in assertion axioms. Consequently, these sets of concepts can be used to restrict or relax queries in this logic. Results We propose two algorithms to settle this problem of query refinement in $\mathcal {PR_{\textit {ALC}}}$ and show their complexity results. Conclusions The problem of query restrictions using contextual approximation is proved to have exponential time complexity, while the problem of query relaxations has polynomial space complexity. Description logics (dpeaa)DE-He213 Rough sets (dpeaa)DE-He213 Query refinement (dpeaa)DE-He213 Alcântara, João aut Martins, Ana Teresa aut Enthalten in Journal of the Brazilian Computer Society London : Springer, 1996 21(2015), 1 vom: 07. Juli (DE-627)324613377 (DE-600)2028746-X 1678-4804 nnns volume:21 year:2015 number:1 day:07 month:07 https://dx.doi.org/10.1186/s13173-015-0031-2 kostenfrei Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2014 GBV_ILN_2055 GBV_ILN_2190 GBV_ILN_4012 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 21 2015 1 07 07 |
| allfieldsGer |
10.1186/s13173-015-0031-2 doi (DE-627)SPR030744059 (SPR)s13173-015-0031-2-e DE-627 ger DE-627 rakwb eng Viana, Henrique verfasserin aut Searching contexts in paraconsistent rough description logic 2015 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © Viana et al. 2015. This is an Open Access article distributed under the terms of the Creative Commons Attribution License ( Background Query refinement is an interactive process of query modification used to increase or decrease the scope of search results in databases or ontologies. Methods We present a method to obtain optimized query refinements of assertion axioms in the paraconsistent rough description logic $\mathcal {PR_{\textit {ALC}}}$, a four-valued paraconsistent version of the rough $\mathcal {ALC}$, which is grounded on Belnap’s Logic. This method is based on the notion of the discernibility matrix commonly used in the process of attribute reduction in the rough set theory. It consists of finding sets of concepts which satisfy the rough set approximation operations in assertion axioms. Consequently, these sets of concepts can be used to restrict or relax queries in this logic. Results We propose two algorithms to settle this problem of query refinement in $\mathcal {PR_{\textit {ALC}}}$ and show their complexity results. Conclusions The problem of query restrictions using contextual approximation is proved to have exponential time complexity, while the problem of query relaxations has polynomial space complexity. Description logics (dpeaa)DE-He213 Rough sets (dpeaa)DE-He213 Query refinement (dpeaa)DE-He213 Alcântara, João aut Martins, Ana Teresa aut Enthalten in Journal of the Brazilian Computer Society London : Springer, 1996 21(2015), 1 vom: 07. Juli (DE-627)324613377 (DE-600)2028746-X 1678-4804 nnns volume:21 year:2015 number:1 day:07 month:07 https://dx.doi.org/10.1186/s13173-015-0031-2 kostenfrei Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2014 GBV_ILN_2055 GBV_ILN_2190 GBV_ILN_4012 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 21 2015 1 07 07 |
| allfieldsSound |
10.1186/s13173-015-0031-2 doi (DE-627)SPR030744059 (SPR)s13173-015-0031-2-e DE-627 ger DE-627 rakwb eng Viana, Henrique verfasserin aut Searching contexts in paraconsistent rough description logic 2015 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier © Viana et al. 2015. This is an Open Access article distributed under the terms of the Creative Commons Attribution License ( Background Query refinement is an interactive process of query modification used to increase or decrease the scope of search results in databases or ontologies. Methods We present a method to obtain optimized query refinements of assertion axioms in the paraconsistent rough description logic $\mathcal {PR_{\textit {ALC}}}$, a four-valued paraconsistent version of the rough $\mathcal {ALC}$, which is grounded on Belnap’s Logic. This method is based on the notion of the discernibility matrix commonly used in the process of attribute reduction in the rough set theory. It consists of finding sets of concepts which satisfy the rough set approximation operations in assertion axioms. Consequently, these sets of concepts can be used to restrict or relax queries in this logic. Results We propose two algorithms to settle this problem of query refinement in $\mathcal {PR_{\textit {ALC}}}$ and show their complexity results. Conclusions The problem of query restrictions using contextual approximation is proved to have exponential time complexity, while the problem of query relaxations has polynomial space complexity. Description logics (dpeaa)DE-He213 Rough sets (dpeaa)DE-He213 Query refinement (dpeaa)DE-He213 Alcântara, João aut Martins, Ana Teresa aut Enthalten in Journal of the Brazilian Computer Society London : Springer, 1996 21(2015), 1 vom: 07. Juli (DE-627)324613377 (DE-600)2028746-X 1678-4804 nnns volume:21 year:2015 number:1 day:07 month:07 https://dx.doi.org/10.1186/s13173-015-0031-2 kostenfrei Volltext GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2014 GBV_ILN_2055 GBV_ILN_2190 GBV_ILN_4012 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 21 2015 1 07 07 |
| language |
English |
| source |
Enthalten in Journal of the Brazilian Computer Society 21(2015), 1 vom: 07. Juli volume:21 year:2015 number:1 day:07 month:07 |
| sourceStr |
Enthalten in Journal of the Brazilian Computer Society 21(2015), 1 vom: 07. Juli volume:21 year:2015 number:1 day:07 month:07 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Description logics Rough sets Query refinement |
| isfreeaccess_bool |
true |
| container_title |
Journal of the Brazilian Computer Society |
| authorswithroles_txt_mv |
Viana, Henrique @@aut@@ Alcântara, João @@aut@@ Martins, Ana Teresa @@aut@@ |
| publishDateDaySort_date |
2015-07-07T00:00:00Z |
| hierarchy_top_id |
324613377 |
| id |
SPR030744059 |
| 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">SPR030744059</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230331101735.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">201007s2015 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1186/s13173-015-0031-2</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR030744059</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s13173-015-0031-2-e</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="100" ind1="1" ind2=" "><subfield code="a">Viana, Henrique</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Searching contexts in paraconsistent rough description logic</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2015</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">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Viana et al. 2015. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Background Query refinement is an interactive process of query modification used to increase or decrease the scope of search results in databases or ontologies. Methods We present a method to obtain optimized query refinements of assertion axioms in the paraconsistent rough description logic $\mathcal {PR_{\textit {ALC}}}$, a four-valued paraconsistent version of the rough $\mathcal {ALC}$, which is grounded on Belnap’s Logic. This method is based on the notion of the discernibility matrix commonly used in the process of attribute reduction in the rough set theory. It consists of finding sets of concepts which satisfy the rough set approximation operations in assertion axioms. Consequently, these sets of concepts can be used to restrict or relax queries in this logic. Results We propose two algorithms to settle this problem of query refinement in $\mathcal {PR_{\textit {ALC}}}$ and show their complexity results. Conclusions The problem of query restrictions using contextual approximation is proved to have exponential time complexity, while the problem of query relaxations has polynomial space complexity.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Description logics</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Rough sets</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Query refinement</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Alcântara, João</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Martins, Ana Teresa</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 the Brazilian Computer Society</subfield><subfield code="d">London : Springer, 1996</subfield><subfield code="g">21(2015), 1 vom: 07. Juli</subfield><subfield code="w">(DE-627)324613377</subfield><subfield code="w">(DE-600)2028746-X</subfield><subfield code="x">1678-4804</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:21</subfield><subfield code="g">year:2015</subfield><subfield code="g">number:1</subfield><subfield code="g">day:07</subfield><subfield code="g">month:07</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1186/s13173-015-0031-2</subfield><subfield code="z">kostenfrei</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_SPRINGER</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</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_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</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_69</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_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</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_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2055</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_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4242</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4246</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4251</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_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</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">21</subfield><subfield code="j">2015</subfield><subfield code="e">1</subfield><subfield code="b">07</subfield><subfield code="c">07</subfield></datafield></record></collection>
|
| author |
Viana, Henrique |
| spellingShingle |
Viana, Henrique misc Description logics misc Rough sets misc Query refinement Searching contexts in paraconsistent rough description logic |
| authorStr |
Viana, Henrique |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)324613377 |
| format |
electronic Article |
| delete_txt_mv |
keep |
| author_role |
aut aut aut |
| collection |
springer |
| remote_str |
true |
| illustrated |
Not Illustrated |
| issn |
1678-4804 |
| topic_title |
Searching contexts in paraconsistent rough description logic Description logics (dpeaa)DE-He213 Rough sets (dpeaa)DE-He213 Query refinement (dpeaa)DE-He213 |
| topic |
misc Description logics misc Rough sets misc Query refinement |
| topic_unstemmed |
misc Description logics misc Rough sets misc Query refinement |
| topic_browse |
misc Description logics misc Rough sets misc Query refinement |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
cr |
| hierarchy_parent_title |
Journal of the Brazilian Computer Society |
| hierarchy_parent_id |
324613377 |
| hierarchy_top_title |
Journal of the Brazilian Computer Society |
| isfreeaccess_txt |
true |
| familylinks_str_mv |
(DE-627)324613377 (DE-600)2028746-X |
| title |
Searching contexts in paraconsistent rough description logic |
| ctrlnum |
(DE-627)SPR030744059 (SPR)s13173-015-0031-2-e |
| title_full |
Searching contexts in paraconsistent rough description logic |
| author_sort |
Viana, Henrique |
| journal |
Journal of the Brazilian Computer Society |
| journalStr |
Journal of the Brazilian Computer Society |
| lang_code |
eng |
| isOA_bool |
true |
| recordtype |
marc |
| publishDateSort |
2015 |
| contenttype_str_mv |
txt |
| author_browse |
Viana, Henrique Alcântara, João Martins, Ana Teresa |
| container_volume |
21 |
| format_se |
Elektronische Aufsätze |
| author-letter |
Viana, Henrique |
| doi_str_mv |
10.1186/s13173-015-0031-2 |
| title_sort |
searching contexts in paraconsistent rough description logic |
| title_auth |
Searching contexts in paraconsistent rough description logic |
| abstract |
Background Query refinement is an interactive process of query modification used to increase or decrease the scope of search results in databases or ontologies. Methods We present a method to obtain optimized query refinements of assertion axioms in the paraconsistent rough description logic $\mathcal {PR_{\textit {ALC}}}$, a four-valued paraconsistent version of the rough $\mathcal {ALC}$, which is grounded on Belnap’s Logic. This method is based on the notion of the discernibility matrix commonly used in the process of attribute reduction in the rough set theory. It consists of finding sets of concepts which satisfy the rough set approximation operations in assertion axioms. Consequently, these sets of concepts can be used to restrict or relax queries in this logic. Results We propose two algorithms to settle this problem of query refinement in $\mathcal {PR_{\textit {ALC}}}$ and show their complexity results. Conclusions The problem of query restrictions using contextual approximation is proved to have exponential time complexity, while the problem of query relaxations has polynomial space complexity. © Viana et al. 2015. This is an Open Access article distributed under the terms of the Creative Commons Attribution License ( |
| abstractGer |
Background Query refinement is an interactive process of query modification used to increase or decrease the scope of search results in databases or ontologies. Methods We present a method to obtain optimized query refinements of assertion axioms in the paraconsistent rough description logic $\mathcal {PR_{\textit {ALC}}}$, a four-valued paraconsistent version of the rough $\mathcal {ALC}$, which is grounded on Belnap’s Logic. This method is based on the notion of the discernibility matrix commonly used in the process of attribute reduction in the rough set theory. It consists of finding sets of concepts which satisfy the rough set approximation operations in assertion axioms. Consequently, these sets of concepts can be used to restrict or relax queries in this logic. Results We propose two algorithms to settle this problem of query refinement in $\mathcal {PR_{\textit {ALC}}}$ and show their complexity results. Conclusions The problem of query restrictions using contextual approximation is proved to have exponential time complexity, while the problem of query relaxations has polynomial space complexity. © Viana et al. 2015. This is an Open Access article distributed under the terms of the Creative Commons Attribution License ( |
| abstract_unstemmed |
Background Query refinement is an interactive process of query modification used to increase or decrease the scope of search results in databases or ontologies. Methods We present a method to obtain optimized query refinements of assertion axioms in the paraconsistent rough description logic $\mathcal {PR_{\textit {ALC}}}$, a four-valued paraconsistent version of the rough $\mathcal {ALC}$, which is grounded on Belnap’s Logic. This method is based on the notion of the discernibility matrix commonly used in the process of attribute reduction in the rough set theory. It consists of finding sets of concepts which satisfy the rough set approximation operations in assertion axioms. Consequently, these sets of concepts can be used to restrict or relax queries in this logic. Results We propose two algorithms to settle this problem of query refinement in $\mathcal {PR_{\textit {ALC}}}$ and show their complexity results. Conclusions The problem of query restrictions using contextual approximation is proved to have exponential time complexity, while the problem of query relaxations has polynomial space complexity. © Viana et al. 2015. This is an Open Access article distributed under the terms of the Creative Commons Attribution License ( |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_SPRINGER GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_702 GBV_ILN_2014 GBV_ILN_2055 GBV_ILN_2190 GBV_ILN_4012 GBV_ILN_4035 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4242 GBV_ILN_4246 GBV_ILN_4249 GBV_ILN_4251 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4326 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 |
| container_issue |
1 |
| title_short |
Searching contexts in paraconsistent rough description logic |
| url |
https://dx.doi.org/10.1186/s13173-015-0031-2 |
| remote_bool |
true |
| author2 |
Alcântara, João Martins, Ana Teresa |
| author2Str |
Alcântara, João Martins, Ana Teresa |
| ppnlink |
324613377 |
| mediatype_str_mv |
c |
| isOA_txt |
true |
| hochschulschrift_bool |
false |
| doi_str |
10.1186/s13173-015-0031-2 |
| up_date |
2024-07-03T19:51:38.838Z |
| _version_ |
1803588782092451840 |
| 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">SPR030744059</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230331101735.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">201007s2015 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1186/s13173-015-0031-2</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)SPR030744059</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SPR)s13173-015-0031-2-e</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="100" ind1="1" ind2=" "><subfield code="a">Viana, Henrique</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Searching contexts in paraconsistent rough description logic</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2015</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">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Viana et al. 2015. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Background Query refinement is an interactive process of query modification used to increase or decrease the scope of search results in databases or ontologies. Methods We present a method to obtain optimized query refinements of assertion axioms in the paraconsistent rough description logic $\mathcal {PR_{\textit {ALC}}}$, a four-valued paraconsistent version of the rough $\mathcal {ALC}$, which is grounded on Belnap’s Logic. This method is based on the notion of the discernibility matrix commonly used in the process of attribute reduction in the rough set theory. It consists of finding sets of concepts which satisfy the rough set approximation operations in assertion axioms. Consequently, these sets of concepts can be used to restrict or relax queries in this logic. Results We propose two algorithms to settle this problem of query refinement in $\mathcal {PR_{\textit {ALC}}}$ and show their complexity results. Conclusions The problem of query restrictions using contextual approximation is proved to have exponential time complexity, while the problem of query relaxations has polynomial space complexity.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Description logics</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Rough sets</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Query refinement</subfield><subfield code="7">(dpeaa)DE-He213</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Alcântara, João</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Martins, Ana Teresa</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 the Brazilian Computer Society</subfield><subfield code="d">London : Springer, 1996</subfield><subfield code="g">21(2015), 1 vom: 07. Juli</subfield><subfield code="w">(DE-627)324613377</subfield><subfield code="w">(DE-600)2028746-X</subfield><subfield code="x">1678-4804</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:21</subfield><subfield code="g">year:2015</subfield><subfield code="g">number:1</subfield><subfield code="g">day:07</subfield><subfield code="g">month:07</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://dx.doi.org/10.1186/s13173-015-0031-2</subfield><subfield code="z">kostenfrei</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_SPRINGER</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</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_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</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_69</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_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</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_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_702</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2055</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_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4035</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4242</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4246</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4251</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_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4326</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</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">21</subfield><subfield code="j">2015</subfield><subfield code="e">1</subfield><subfield code="b">07</subfield><subfield code="c">07</subfield></datafield></record></collection>
|
| score |
7.3972683 |