Paper Info
Title
The logical compilation of knowledge bases
Abstract
Forward chaining cannot compute the two-valued consequence literals of a knowledge base (i.e. set of rules) with negations. If the user wants to compute them, he must use a particular algorithm which often takes a lot of time. We propose a compilation system of knowledge bases what we call logical compilation, which allows us to compute the two-valued consequence literals of a knowledge base (i.e. set of rules) using a forward chaining on the compiled base with any extensional knowledge base (i.e. set of basic facts added to knowledge base). Then we present several methods with their benefits to make this compilation. Finally we use this compilation in a wide propositional calculus and solve the or problem in rule conclusion.
Year
DOI
Venue
1990
10.1007/BFb0018454
JELIA '90 Proceedings of the European workshop on Logics in AI
Keywords
DocType
Volume
knowledge representation,'u'd chaining,logical compilation,knowledge base,three-valued logic.,knowledge bases,forw,key-words: expert system,expert system
Conference
478
ISBN
Citations 
PageRank 
0-387-53686-8
8
0.72
References 
Authors
9
2
Name
Order
Citations
PageRank
Philippe Mathieu113928.72
Jean-Paul Delahaye232554.60