7 search results - page 1 / 2 » A Theory of Average-Case Compilability in Knowledge Represen... |
IJCAI
2003
13 years 6 months ago
2003
Compilability is a fundamental property of knowledge representation formalisms which captures how succinctly information can be expressed. Although many results concerning compila...
ICDT
2011
ACM
12 years 8 months ago
2011
ACM
The goal of Knowledge Compilation is to represent a Boolean expression in a format in which it can answer a range of online-queries in PTIME. The online-query of main interest to ...
IJPRAI
2000
13 years 4 months ago
2000
We present an approach to knowledge compilation that transforms a function-free first-order Horn knowledge base to propositional logic. This form of compilation is important since...
IJCAI
1997
13 years 6 months ago
1997
We address the problem of introducing preferences into default logic. Two approaches are given, one a generalisation of the other. In the first approach, an ordered default theory...
LPNMR
2001
Springer
13 years 9 months ago
2001
Springer
Abstract This paper describes a generic compiler, called plp, for translating ordered logic programs into standard logic programs under the answer set semantics. In an ordered logi...