in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
For description logics with existential restrictions, the size of the least common subsumer (lcs) of concept descriptions may grow exponentially in the size of the concept descrip...
We propose an approach to Natural Language Processing exploiting knowledge domain in an e-commerce scenario. Based on such modeling an NLP parser is presented, aimed at translating...
Stefano Coppi, Tommaso Di Noia, Eugenio Di Sciasci...
Answering conjunctive queries (CQs) has been recognized as a key task for the usage of Description Logics (DLs) in a number of applications. The problem has been studied by many au...
Representing probabilistic knowledge in combination with a description logic has been a research topic for quite some time. In [1] one of such combinations is introduced. We presen...