See this document in CiteSeerX!

The Complexity of Existential Quantification in Concept Languages (1992)  (Make Corrections)  (56 citations)
Francesco M. Donini, Bernhard Hollunder, Maurizio Lenzerini, Alberto Marchetti Spaccamela, Daniele Nardi, Werner Nutt



  Home/Search   Context   Related

 
View or download:
dfki.unisb.de/pub/tacos/Pa...aij92.ps
dfki.de/~nutt/Publications/aij92.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  dfki.de/~tacos/...OSPublications (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: this paper is that subsumption and unsatisfiability in ALE are NP-hard. In fact, subsumption is shown to be NP-hard for the simpler language FLE (Update)

Cited by:   More
A Sequent Calculus for Reasoning in Four-valued Description Logics - Straccia (1997)   (Correct)
Foundations of a Logic basc approach to Multimedia.. - Zur Erlangungdl Gradg   (Correct)
On Subsumption and Instance Problem in - General Tboxes Sebastian   (Correct)

Similar documents (at the sentence level):
5.3%:   The Complexity of Concept Languages - Donini, Lenzerini, Nardi, Nutt (1995)   (Correct)

Active bibliography (related documents):   More   All
0.1:   Algebraic Terminological Representation - Schmidt (1991)   (Correct)
0.1:   Subsumption Algorithms for Concept Languages - Hollunder, Nutt (1990)   (Correct)
0.1:   Description Logics: Modal Logics for Class-Based Modeling - De Giacomo   (Correct)

Similar documents based on text:   More   All
0.5:   International Workshop on Description Logics - Borgida, Lenzerini, Nardi, Nebel (1995)   (Correct)
0.4:   AL-log: Integrating Datalog and Description Logics - Donini, Lenzerini, al. (1998)   (Correct)
0.4:   TBox and ABox Reasoning in Expressive Description Logics - De Giacomo, Lenzerini (1996)   (Correct)

Related documents from co-citation:   More   All
32:   The complexity of concept languages - Donini, Lenzerini et al. - 1991
26:   Terminological reasoning is inherently intractable - Nebel - 1990
24:   Attributive concept descriptions with complements (context) - Schmidt-Schauss, Smolka - 1991

BibTeX entry:   (Update)

F. M. Donini, B. Hollunder, M. Lenzerini, A. Marchetti Spaccamela, D. Nardi, and W. Nutt. The complexity of existential quantification in concept languages. Artificial Intelligence Journal, 53:309--327, 1992. http://citeseer.ist.psu.edu/donini92complexity.html   More

@techreport{ donini91complexity,
    author = "Francesco M. Donini and Bernhard Hollunder and Maurizio Lenzerini and Alberto Marchetti Spaccamela and Daniele Nardi and Werner Nutt",
    title = "The Complexity of Existential Quantification in Concept Languages",
    number = "RR-91-02",
    address = "Deutsches Forschungszentrum f{\"u}r K{\"u}nstliche Intelligenz GmbH\\Erwin-Schr{\"o}dinger Stra{ss}e\\Postfach 2080\\67608 Kaiserslautern\\Germany",
    pages = "22",
    year = "1991",
    url = "citeseer.ist.psu.edu/donini92complexity.html" }
Citations (may not include all citations):
4212   Computers and intractability---A guide to the theory of NP-c.. (context) - Garey, Johnson - 1979
480   An overview of the KL-ONE knowledge representation system (context) - Brachman, Schmolze - 1985
235   First-order logic (context) - Smullyan - 1968
207   Attributive concept descriptions with complements (context) - Schmidt-Schauss, Smolka - 1991
197   The complexity of concept languages - Donini, Lenzerini et al. - 1991
193   Reasoning and revision in hybrid representation systems (context) - Nebel - 1990
118   The tractability of subsumption in frame based description l.. (context) - Brachman, Levesque - 1984
112   Terminological reasoning is inherently intractable - Nebel - 1990
94   Expressiveness and tractability in knowledge representation .. (context) - Levesque, Brachman - 1987
88   Subsumption algorithms for concept description languages - Hollunder, Nutt et al. - 1990
72   Computational complexity of terminological reasoning in BACK - Nebel - 1988
39   Small can be beautiful in knowledge representation (context) - Patel-Schneider - 1984
32   Representation and reasoning with attributive descriptions (context) - Nebel, Smolka - 1990
15   Attributive concept descriptions with unions and complements (context) - Schmidt-Schauss, Smolka - 1988



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.dfki.de/~tacos/TACOS-Publications.html):   More
Combination Problems for Commutative/Monoidal Theories or How.. - Baader, Nutt (1996)   (Correct)
Tractable Reasoning in a Universal Description Logic (Extended.. - Schild (1994)   (Correct)
Subsumption Algorithms for Concept Languages - Hollunder, Nutt (1990)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC