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-01-01
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.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.
