Tractable concept languages

Authors:
Francesco M. Donini;Maurizio Lenzerini;Daniele Nardi;Werner Nutt
Affiliations:
Dipartimento di Informatica e Sistemistica, Universita di Roma "La Sapienza", Roma, Italy;Dipartimento di Informatica e Sistemistica, Universita di Roma "La Sapienza", Roma, Italy;Dipartimento di Informatica e Sistemistica, Universita di Roma "La Sapienza", Roma, Italy;Deutsches Forschungszentrum fur Kiinstliche Intelligenz, Kaiseislautern, Germany
Venue:
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Year:
1991

Citing 2
Cited 8

Computational complexity of terminological reasoning in BACK

Artificial Intelligence
Representation and reasoning with attributive descriptions

Proceedings of the workshop on Sorts and types in artificial intelligence

Is PL2 a Tractable Language?

EPIA '99 Proceedings of the 9th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
"Reducing" CLASSIC to Practice: Knowledge Representation Theory Meets Reality

Conceptual Modeling: Foundations and Applications
Learnability of description logic programs

ILP'02 Proceedings of the 12th international conference on Inductive logic programming
Part-whole reasoning in an object-centered framework

Part-whole reasoning in an object-centered framework
Non-standard inferences in description logics

Non-standard inferences in description logics
Logic-based knowledge representation

Artificial intelligence today
Document retrieval by relevance terminological logics

MIRO'95 Proceedings of the Final conference on Multimedia Information Retrieval
From Tableaux to Automata for Description Logics

Fundamenta Informaticae - The 1st International Workshop on Knowledge Representation and Approximate Reasoning (KR&AR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present two concept languages, called PL1 and PL2 which are extensions of TC. We prove that the subsumption problem in these languages can be solved in polynomial time. Both languages include a construct for expressing inverse roles, which has not been considered up to now in tractable languages. In addition, PL1 includes number restrictions and negation of primitive concepts, while Pl2 includes role conjunction and role chaining. By exploiting recent complexity results, we show that none of the constructs usually considered in concept languages can be added to PL1 and PL2 without losing tractabtlity. Therefore, on the assumption that Languages are characterized by the set of constructs they provide, the two languages presented in this paper provide a solution to the problem of singling out an optimal trade-off between expressive power and computational complexity.