119 search results - page 2 / 24 » Normal Forms for Knowledge Compilation |
ESOP
1994
Springer
13 years 9 months ago
1994
Springer
Functional language compilers implement only weak-head reduction. However, there are cases where head normal forms or full normal forms are needed. Here, we study how to use cps c...
KI
2007
Springer
13 years 11 months ago
2007
Springer
The relationship and possible interplay between different knowledge representation and reasoning paradigms is a fundamental topic in artificial intelligence. For expressive knowl...
JAIR
2008
13 years 5 months ago
2008
Levesque proposed a generalization of a database called a proper knowledge base (KB), which is equivalent to a possibly infinite consistent set of ground literals. In contrast to ...
AAAI
2010
13 years 3 months ago
2010
We consider in this paper the size of a Decomposable Negation Normal Form (DNNF) that respects a given vtree (known as structured DNNF). This representation of propositional knowl...
ATAL
2010
Springer
13 years 6 months ago
2010
Springer
Planning how to interact against bounded memory and unbounded memory learning opponents needs different treatment. Thus far, however, work in this area has shown how to design pla...