31 search results - page 2 / 7 » On the Complexity of Equational Horn Clauses |
CLA
2004
13 years 7 months ago
2004
Ontology design is a complex and time-consuming process. It is extremely difficult for human experts to discover ontology from given data or texts. This paper presents a semi-autom...
CADE
2006
Springer
14 years 6 months ago
2006
Springer
This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. We believe that these classes have a good potential ...
AIML
2004
13 years 7 months ago
2004
We study and give a summary of the complexity of 15 basic normal monomodal logics under the restriction to the Horn fragment and/or bounded modal depth. As new results, we show tha...
ESOP
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. It is well-known that context-independent control flow analysis can be performed in cubic time for functional and object-oriented languages. Yet recent applications of c...
FUIN
2010
13 years 3 months ago
2010
Abstract. Developing a good formalism and an efficient decision procedure for the instance checking problem is desirable for practical application of description logics. The data c...