On the complexity of the instance checking problem in concept languages with existential quantification-Reference-Cited by-同舟云学术

On the complexity of the instance checking problem in concept languages with existential quantification

Published:1993-09 Issue:3 Volume:2 Page:265-278
ISSN:0925-9902
Container-title:Journal of Intelligent Information Systems
language:en
Short-container-title:J Intell Inf Syst

Author:

Schaerf Andrea

Publisher

Springer Science and Business Media LLC

Subject

Artificial Intelligence,Computer Networks and Communications,Hardware and Architecture,Information Systems,Software

Link

http://link.springer.com/content/pdf/10.1007/BF00962071.pdf

Reference20 articles.

1. Baader, F. & Hollunder, B. (1991). A Terminological Knowledge Representation System with Complete Inference Algorithm. InProc. Workshop on Processing Declarative Knowledge, PDK-19. Lecture Notes in Artificial Intelligence. Springer-Verlag: New York.

2. Brachman, R.J. & Levesque, H.J. (1984). The Tractability of Subsumption in Frame-Based Description Languages. InProc. 4th Nat. Conf. on Artificial Intelligence AAAI-84.

3. Donini, F.M., Hollunder, B., Lenzerini, M., Marchetti Spaccamela, A., Nardi, D. & Nutt, W.. (1992a). The Complexity of Existential Quantification in Concept Languages,Artificial Intelligence, 2?3, 309?327.

4. Donini, F.M., Lenzerini, M., Nardi, D. & Nutt, W. (1991). The Complexity of Concept Languages. In James Allen, Richard Fikes, and Erik Sandewall (Eds.),Proc. 2nd Int. Conf. on Principles of Knowledge Representation and Reasoning KR-91, pages 151?162, Morgan Kaufmann.

5. Donini, F.M., Lenzerini, M., Nardi, D., Nutt, W. & Schaerf, A. (1992b). Adding Epistemic Operators to Concept Languages. InProc. 3rd Int. Conf. On Principles of Knowledge Representation and Reasoning KR-92, pages 342?353.

Cited by 38 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Datalog rewritability and data complexity of ALCHOIQ with closed predicates;Artificial Intelligence;2024-05

2. Extending the description logic EL with threshold concepts induced by concept measures;Artificial Intelligence;2024-01

3. Answering regular path queries mediated by unrestricted SQ ontologies;Artificial Intelligence;2023-01

4. A tetrachotomy of ontology-mediated queries with a covering axiom;Artificial Intelligence;2022-08

5. A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic EL;Artificial Intelligence;2022-07