Knowledge compilation is a common technique for propo-sitional logic knowledge bases. A given knowledge base is transformed into a normal form, for which queries can be an-swered efficiently. This precompilation step is expensive, but it only has to be performed once. We apply this technique to knowledge bases defined in the Description Logic ALC. We discuss an efficient satisfiability test as well as a subsumption test for precompiled concepts and Tboxes. Further we use the precompiled Tboxes for efficient Tbox reasoning. Finally we present first experimental results of our approach
Pioneered two decades ago, knowledge compilation (KC) has been for a few years acknowledged as an im...
Knowledge compilation is a powerful technique for com-pactly representing and efficiently reasoning ...
The problem of learning logic programs has been researched extensively, but other knowledge represen...
Knowledge compilation is a common technique for propositional logic knowledge bases. The idea is to ...
We consider description logic knowledge bases in which the ABox can contain Boolean combinations of ...
This paper is concerned with knowledge compilation (KC), a family of approaches developed in AI for ...
Abstract: Knowledge compilation deals with the computational intractability of reasoning problems. T...
We show that many "critically constrained" Random 3SAT knowledge bases (KBs) and other KBs...
AbstractThe forward chaining algorithm is perhaps the best-known algorithm in expert systems. Howeve...
We propose an approach for extending both the ter-minological and the assertional part of a Descrip-...
Abstract: Knowledge compilation deals with the computational intractability of reasoning problems. T...
This paper investigates subsumption algorithms for logic-based knowledge representation languages of...
We propose an approach for extending both the terminological and the assertional part of a Descripti...
Knowledge compilation is a powerful technique for compactly representing and efficiently reasoning a...
AbstractDescription Logics are a family of logics used to represent and reason about conceptual and ...
Pioneered two decades ago, knowledge compilation (KC) has been for a few years acknowledged as an im...
Knowledge compilation is a powerful technique for com-pactly representing and efficiently reasoning ...
The problem of learning logic programs has been researched extensively, but other knowledge represen...
Knowledge compilation is a common technique for propositional logic knowledge bases. The idea is to ...
We consider description logic knowledge bases in which the ABox can contain Boolean combinations of ...
This paper is concerned with knowledge compilation (KC), a family of approaches developed in AI for ...
Abstract: Knowledge compilation deals with the computational intractability of reasoning problems. T...
We show that many "critically constrained" Random 3SAT knowledge bases (KBs) and other KBs...
AbstractThe forward chaining algorithm is perhaps the best-known algorithm in expert systems. Howeve...
We propose an approach for extending both the ter-minological and the assertional part of a Descrip-...
Abstract: Knowledge compilation deals with the computational intractability of reasoning problems. T...
This paper investigates subsumption algorithms for logic-based knowledge representation languages of...
We propose an approach for extending both the terminological and the assertional part of a Descripti...
Knowledge compilation is a powerful technique for compactly representing and efficiently reasoning a...
AbstractDescription Logics are a family of logics used to represent and reason about conceptual and ...
Pioneered two decades ago, knowledge compilation (KC) has been for a few years acknowledged as an im...
Knowledge compilation is a powerful technique for com-pactly representing and efficiently reasoning ...
The problem of learning logic programs has been researched extensively, but other knowledge represen...