|
Volumn 1, Issue , 1999, Pages 284-289
|
Compiling knowledge into decomposable negation normal form
|
Author keywords
[No Author keywords available]
|
Indexed keywords
APPROXIMATIONS BOUNDS;
BOUNDED TREEWIDTH;
GRAPH-THEORETIC;
LINEAR TIME;
NORMAL FORM;
PROPOSITIONAL THEORIES;
REASONING TASKS;
SATISFIABILITY;
GRAPH THEORY;
QUERY PROCESSING;
ARTIFICIAL INTELLIGENCE;
|
EID: 84880691247
PISSN: 10450823
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
Times cited : (82)
|
References (7)
|