MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "The Complexity of Concept Languages." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

12 documents found, showing 1 through 10. Next 10 →

ATOM

The Complexity of Concept Languages
by Francesco M. Donini, Maurizio Lenzerini, Daniele Nardi, Werner Nutt — 1991 — Information and Computation
…The Complexity of Concept Languages Francesco M. Donini, Maurizio Lenzerini, Daniele Nardi…
Cited by 207 (29 self) – Add To MetaCart

The Complexity of Existential Quantification in Concept Languages
by Francesco M. Donini, Bernhard Hollunder, Maurizio Lenzerini, Alberto Marchetti Spaccamela, Daniele Nardi, Werner Nutt — 1992
…The Complexity of Existential Quantification in Concept Languages Francesco M. Donini Bernhard…
Cited by 45 (14 self) – Add To MetaCart

Concepts for the Optimistic Simulation of THORNs
by Stefan Schöf
… concepts of the language, a formal analysis of Thorn models is almost impossible and simulation is the only…
Cited by 1 (1 self) – Add To MetaCart

A Distributed Simulation Engine for Hierarchical Petri Nets
by Stefan Schöf — 1995 — In Simulation verteilter Systeme und paralleler Prozesse
… to the complex concepts of the language, a formal analysis of Thorn models is almost impossible and simulation…
Cited by 1 (0 self) – Add To MetaCart

Query Answering in Concept-Based Knowledge Representation Systems: Algorithms, Complexity
by Andrea Schaerf, Andrea Schaerf — 1994
… on Subsumption algorithms. This analysis highlights a new source of complexity in concept languages, which does…
Cited by 23 (0 self) – Add To MetaCart

Constraint Graphs: A Concept Map Meta-Language
by Rob Kremer, Object-oriented Programming, B. Shriver, P. Wegner Cambridge — 1997
…, F., Lenzerini, M., Nardi, D. & Nutt, W. 1995. The Complexity of Concept Languages, Deutsches…
Cited by 6 (2 self) – Add To MetaCart

Deduction in Concept Languages: From Subsumption to Instance Checking
by Francesco M. Donini, Maurizio Lenzerini, Daniele Nardi, Andrea Schaerf — 1994 — Journal of Logic and Computation
… harder than subsumption. This result singles out a new source of complexity in concept languages, which…
Cited by 62 (19 self) – Add To MetaCart

Deduction in Concept Languages: From Subsumption to Instance Checking
by Francesco Donini Maurizio, Maurizio Lenzerini, Daniele Nardi, Andrea Schaerf — 1994 — Journal of Logic and Computation
… of complexity in concept languages, which does not show up when checking subsumption between concepts…
Add To MetaCart

Reasoning in Description Logics
by F. M. Donini, M. Lenzerini, D. Nardi, A. Schaerf — 1997
… M., Maurizio Lenzerini, Daniele Nardi, and Werner Nutt. 1991a. The Complexity of Concept Languages…
Cited by 193 (23 self) – Add To MetaCart

DLAB: A Declarative Language Bias Formalism
by Luc Dehaspe, Luc De Raedt — 1996 — In Proceedings of the International Symposium on Methodologies for Intelligent Systems (ISMIS-96
… such as the maximal variable depth or term level to control the complexity of the concept language, cf. [5, 16…
Cited by 17 (1 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB