Add to ORKGWe consider description logic knowledge bases in which the ABox can contain Boolean combinations of traditional ABox assertions (represented as clauses or sequents). A linear reduction of such knowledge bases into a standard format (allowing only conjunctive assertions) is described which preserves knowledge base satisfiability. Similar results are presented for Boolean TBoxes and Boolean combinations of both ABox and TBox statements.
Deciding inseparability of description logic knowledge bases (KBs) with respect to conjunctive queri...
When trying to apply recently developed approaches for updating Description Logic ABoxes in the cont...
Effective optimisation techniques can make a dramatic difference in the performance of knowledge rep...
Finding an appropriate semantics for task of updating an inconsistent knowledge base is a challengin...
Due to the growing popularity of Description Logics-based knowledge representation systems, predomin...
Knowledge compilation is a common technique for propo-sitional logic knowledge bases. A given knowle...
A Description Logic (DL) system is charac-terized by four fundamental aspects: the set of constructs...
Abstract. While there has been a great deal of work on the development of reasoning algorithms for e...
Knowledge compilation is a common technique for propositional logic knowledge bases. The idea is to ...
Deciding inseparability of description logic knowledge bases (KBs) with respect to conjunctive queri...
In this paper we study data complexity of answering conjunctive queries over Description Logic knowl...
ABox abduction is an important reasoning mechanism for description logic ontologies. It computes all...
We propose a novel, type-elimination-based method for reasoning in thedescription logic SHIQbs inclu...
Deciding inseparability of description logic knowl-edge bases (KBs) with respect to conjunctive quer...
When trying to apply recently developed approaches for updating Description Logic ABoxes in the cont...
Deciding inseparability of description logic knowledge bases (KBs) with respect to conjunctive queri...
When trying to apply recently developed approaches for updating Description Logic ABoxes in the cont...
Effective optimisation techniques can make a dramatic difference in the performance of knowledge rep...
Finding an appropriate semantics for task of updating an inconsistent knowledge base is a challengin...
Due to the growing popularity of Description Logics-based knowledge representation systems, predomin...
Knowledge compilation is a common technique for propo-sitional logic knowledge bases. A given knowle...
A Description Logic (DL) system is charac-terized by four fundamental aspects: the set of constructs...
Abstract. While there has been a great deal of work on the development of reasoning algorithms for e...
Knowledge compilation is a common technique for propositional logic knowledge bases. The idea is to ...
Deciding inseparability of description logic knowledge bases (KBs) with respect to conjunctive queri...
In this paper we study data complexity of answering conjunctive queries over Description Logic knowl...
ABox abduction is an important reasoning mechanism for description logic ontologies. It computes all...
We propose a novel, type-elimination-based method for reasoning in thedescription logic SHIQbs inclu...
Deciding inseparability of description logic knowl-edge bases (KBs) with respect to conjunctive quer...
When trying to apply recently developed approaches for updating Description Logic ABoxes in the cont...
Deciding inseparability of description logic knowledge bases (KBs) with respect to conjunctive queri...
When trying to apply recently developed approaches for updating Description Logic ABoxes in the cont...
Effective optimisation techniques can make a dramatic difference in the performance of knowledge rep...