Tractable feature generation through description logics with value and number restrictions

Authors:
Nicola Fanizzi;Luigi Iannone;Nicola Di Mauro;Floriana Esposito
Affiliations:
Dipartimento di Informatica, Università degli Studi di Bari, Bari, Italy;Dipartimento di Informatica, Università degli Studi di Bari, Bari, Italy;Dipartimento di Informatica, Università degli Studi di Bari, Bari, Italy;Dipartimento di Informatica, Università degli Studi di Bari, Bari, Italy
Venue:
IEA/AIE'06 Proceedings of the 19th international conference on Advances in Applied Artificial Intelligence: industrial, Engineering and Other Applications of Applied Intelligent Systems
Year:
2006

Citing 11
Cited 0

Learning Boolean Functions in an Infinite Attribute Space

Machine Learning
The complexity of concept languages

Information and Computation
Robust logics

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Propositionalization approaches to relational data mining

Relational Data Mining
Computing the Least Common Subsumer and the Most Specific Concept in the Presence of Cyclic ALN-Concept Descriptions

KI '98 Proceedings of the 22nd Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
Approximating Most Specific Concepts in Description Logics with Existential Restrictions

KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
Structural Subsumption for cal ALN

Structural Subsumption for cal ALN
Commonality-Based ABox Retrieval

Commonality-Based ABox Retrieval
The Description Logic Handbook

The Description Logic Handbook
Learning with feature description logics

ILP'02 Proceedings of the 12th international conference on Inductive logic programming
Computing least common subsumers in description logics

AAAI'92 Proceedings of the tenth national conference on Artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the line of a feature generation paradigm based on relational concept descriptions, we extend the applicability to other languages of the Description Logics family endowed with specific language constructors that do not have a counterpart in the standard relational representations, such as clausal logics. We show that the adoption of an enhanced language does not increase the complexity of feature generation, since the process is still tractable. Moreover this can be considered as a formalization for future employment of even more expressive languages from the Description Logics family.