CINECA IRIS Institutional Research Information System
IRIS è la soluzione IT che facilita la raccolta e la gestione dei dati relativi alle attività e ai prodotti della ricerca. Fornisce a ricercatori, amministratori e valutatori gli strumenti per monitorare i risultati della ricerca, aumentarne la visibilità e allocare in modo efficace le risorse disponibili.
EnglishThis paper deals with learning in AL-log, a hybrid language that merges the function-free Horn clause language DATALOG and the description logic ALC. Our application context is descriptive data mining. We introduce O-queries, a rule-based form of unary conjunctive queries in AL-log, and a generality order greater than or equal toB for structuring spaces of O-queries. We define a (downward) refinement operator po for greater than or equal to (B)-ordered spaces of O-queries, prove its ideality and discuss an efficient implementation of it in the context of interest.
Ideal Refinement of Descriptions in AL-log / LISI F.A.; MALERBA D. - 2835(2003), pp. 215-232. ((Intervento presentato al convegno 13th International Conference on Inductive Logic Programming, ILP 2003 tenutosi a Szeged, Hungary nel September 29-October 1, 2003.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
| Titolo: | Ideal Refinement of Descriptions in AL-log |
| Autori: | |
| Data di pubblicazione: | 2003 |
| Rivista: | |
| Citazione: | Ideal Refinement of Descriptions in AL-log / LISI F.A.; MALERBA D. - 2835(2003), pp. 215-232. ((Intervento presentato al convegno 13th International Conference on Inductive Logic Programming, ILP 2003 tenutosi a Szeged, Hungary nel September 29-October 1, 2003. |
| Abstract: | This paper deals with learning in AL-log, a hybrid language that merges the function-free Horn clause language DATALOG and the description logic ALC. Our application context is descriptive data mining. We introduce O-queries, a rule-based form of unary conjunctive queries in AL-log, and a generality order greater than or equal toB for structuring spaces of O-queries. We define a (downward) refinement operator po for greater than or equal to (B)-ordered spaces of O-queries, prove its ideality and discuss an efficient implementation of it in the context of interest. |
| Handle: | http://hdl.handle.net/11586/137205 |
| ISBN: | 978-3-540-20144-1 |
| Appare nelle tipologie: | 4.1 Contributo in Atti di convegno |
File in questo prodotto:
Copyright © 2020