Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

ICFCA
2009
Springer

favoriteEmaildiscussreport

122views Formal Methods» more ICFCA 2009»

Exploring Finite Models in the Description Logic

13 years 11 months ago

Exploring Finite Models in the Description Logic

Download lat.inf.tu-dresden.de

Abstract. In a previous ICFCA paper we have shown that, in the Description Logics EL and ELgfp, the set of general concept inclusions holding in a ﬁnite model always has a ﬁnite basis. In this paper, we address the problem of how to compute this basis eﬃciently, by adapting methods from formal concept analysis.

Franz Baader, Felix Distel

Real-time Traffic

Formal Concept Analysis | Formal Languages | General Concept Inclusions | ICFCA 2009 | ﬁnite Basis |

claim paper

Related Content

» Towards Implementing Finite Model Reasoning in Description Logics

» Finite Model Reasoning in Description Logics

» An Approach to Exploring Description Logic Knowledge Bases

» Randomisation and Derandomisation in Descriptive Complexity Theory

» Descriptive Complexity of Finite Abelian Groups

» Decidability of Description Logics with Transitive Closure of Roles in Concept and Role In...

» Approximating the Expressive Power of Logics in Finite Models

» Loop Formulas for Description Logic Programs

» Characterizing Data Complexity for Conjunctive Query Answering in Expressive Description L...

Post Info
More Details (n/a)

Added	20 May 2010
Updated	20 May 2010
Type	Conference
Year	2009
Where	ICFCA
Authors	Franz Baader, Felix Distel

Comments (0)