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.

Ideal Refinement of Descriptions in AL-log

LISI, Francesca Alessandra;MALERBA, Donato
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.
978-3-540-20144-1
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11586/137205
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 30
  • ???jsp.display-item.citation.isi??? 20
social impact