Zobrazeno 1 - 10
of 307
pro vyhledávání: '"Straccia, U"'
Autor:
Straccia, U.
Publikováno v:
Journal Of Artificial Intelligence Research, Volume 14, pages 137-166, 2001
Description Logics (DLs) are suitable, well-known, logics for managing structured knowledge. They allow reasoning about individuals and well defined concepts, i.e., set of individuals with common properties. The experience in using DLs in application
Externí odkaz:
http://arxiv.org/abs/1106.0667
Autor:
Loyer, Y., Straccia, U.
Stable model semantics has become a very popular approach for the management of negation in logic programming. This approach relies mainly on the closed world assumption to complete the available knowledge and its formulation has its basis in the so-
Externí odkaz:
http://arxiv.org/abs/cs/0403002
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Artini M., Assante M., Atzori C., Baglioni M., Bardi A., Bove P., Candela L., Casini G., Castelli D., Cirillo R., Coro G., De Bonis M., Debole F., Dell'Amico A., Frosini L., La Bruzzo S., Lazzeri E., Lelii L., Manghi P., Mangiacrapa F., Mangione D., Mannocci A., Ottonello E., Pagano P., Panichi G., Pavone G., Piccioli T., Sinibaldi F., Straccia U.
Publikováno v:
ISTI Annual report, 2022
InfraScience is a research group of the National Research Council of Italy - Institute of Information Science and Technologies (CNR - ISTI) based in Pisa, Italy. This report documents the research activity performed by this group in 2021 to highlight
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______9984::a7317ebba6fd81b1b0d3698c3de808b9
https://openportal.isti.cnr.it/doc?id=people______::31aa3f20edcc50fc7bcf03af639a75cc
https://openportal.isti.cnr.it/doc?id=people______::31aa3f20edcc50fc7bcf03af639a75cc
Autor:
Casini G., Straccia U.
Publikováno v:
NMR 2022-International Workshop on Non-Monotonic Reasoning 2022, pp. 155–158, Haifa, Israel, 07-09/08/2022
For non-monotonic logics, the notion of Rational Closure (RC) is acknowledged as one of the main approaches. In this work we present an integration of RC within the triple language RDFS (Resource Description Framework Schema), which together with OWL
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______9984::9556107cc0f407124ac03f8d10dacc3e
https://openportal.isti.cnr.it/doc?id=people______::5c2994cb6628da676c76f312b3f9cb4b
https://openportal.isti.cnr.it/doc?id=people______::5c2994cb6628da676c76f312b3f9cb4b
Autor:
Artini M., Assante M., Atzori C., Baglioni M., Bardi A., Candela L., Casini G., Castelli D., Cirillo R., Coro G., Debole F., Dell'Amico A., Frosini L., La Bruzzo S., Lazzeri E., Lelii L., Manghi P., Mangiacrapa F., Mannocci A., Pagano P., Panichi G., Piccioli T., Sinibaldi F., Straccia U.
Publikováno v:
ISTI Annual Report, ISTI-2021-AR/002, pp.1–20, 2021
InfraScience is a research group of the National Research Council of Italy - Institute of Information Science and Technologies (CNR - ISTI) based in Pisa, Italy. This report documents the research activity performed by this group in 2020 to highlight
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::4ae0dc2b9a42edc7bdbc56224363cc0e
https://doi.org/10.32079/ISTI-AR-2021/002
https://doi.org/10.32079/ISTI-AR-2021/002
Autor:
Cardillo F. A., Straccia U.
Publikováno v:
Research report, pp.1–26, 2020
OWL ontologies are nowadays a quite popular way to describe structured knowledge in terms of classes, relations among classes and class instances. In this paper, given a target class T of an OWL ontology, we address the problem of learning fuzzy conc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::a3e03b0c760043bcf0b019d4bb52b312
http://www.cnr.it/prodotto/i/428576
http://www.cnr.it/prodotto/i/428576
Autor:
Casini G., Straccia U.
Publikováno v:
ISTI Technical Reports 008/2020, 2020
In the field of non-monotonic logics, the notion of Rational Closure (RC) is acknowledged as a prominent approach. In recent years, RC has gained even more popularity in the context of Description Logics (DLs), the logic underpinning the semantic web
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::d298d09f52b22da5b769d758a46a018b
https://openportal.isti.cnr.it/doc?id=people______::d298d09f52b22da5b769d758a46a018b
https://openportal.isti.cnr.it/doc?id=people______::d298d09f52b22da5b769d758a46a018b
Autor:
Straccia U.
Publikováno v:
European Conference on Artificial Intelligence (ECAI-20), pp. 905–912, Santiago de Compostela, SPAIN, 29/08/2020-08/09/2020
info:cnr-pdr/source/autori:Straccia U./congresso_nome:European Conference on Artificial Intelligence (ECAI-20)/congresso_luogo:Santiago de Compostela, SPAIN/congresso_data:29%2F08%2F2020-08%2F09%2F2020/anno:2020/pagina_da:905/pagina_a:912/intervallo_pagine:905–912
info:cnr-pdr/source/autori:Straccia U./congresso_nome:European Conference on Artificial Intelligence (ECAI-20)/congresso_luogo:Santiago de Compostela, SPAIN/congresso_data:29%2F08%2F2020-08%2F09%2F2020/anno:2020/pagina_da:905/pagina_a:912/intervallo_pagine:905–912
In this work we address the following question: can we measure how much knowledge a knowledge base represents? We answer to this question (i) by describing properties (axioms) that a knowledge measure we believe should have in measuring the amount of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::8d385253198aecf4a064d2b4e2e4c38a
http://www.cnr.it/prodotto/i/429327
http://www.cnr.it/prodotto/i/429327
A Polynomial Time Subsumption Algorithm for Nominal Safe $\mathcal{ELO}_\bot$ under Rational Closure
Publikováno v:
Information sciences 501 (2019): 588–620. doi:10.1016/j.ins.2018.09.037
info:cnr-pdr/source/autori:Casini G.; Straccia U.; Meyer T./titolo:A Polynomial Time Subsumption Algorithm for Nominal Safe $\mathcal{ELO}_\bot$ under Rational Closure/doi:10.1016%2Fj.ins.2018.09.037/rivista:Information sciences/anno:2019/pagina_da:588/pagina_a:620/intervallo_pagine:588–620/volume:501
info:cnr-pdr/source/autori:Casini G.; Straccia U.; Meyer T./titolo:A Polynomial Time Subsumption Algorithm for Nominal Safe $\mathcal{ELO}_\bot$ under Rational Closure/doi:10.1016%2Fj.ins.2018.09.037/rivista:Information sciences/anno:2019/pagina_da:588/pagina_a:620/intervallo_pagine:588–620/volume:501
Description Logics (DLs) under Rational Closure (RC) is a well-known framework for non-monotonic reasoning in DLs. In this paper, we address the concept subsumption decision problem under RC for nominal safe \ELObot, a notable and practically importa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::ecc4d5c170cfa11d323e22d03bfd25f8
https://www.sciencedirect.com/science/article/pii/S0020025518307436?dgcid=author#!
https://www.sciencedirect.com/science/article/pii/S0020025518307436?dgcid=author#!