- Descriptor Revision: Belief Change Through Direct Choice.Sven Ove Hansson - 2017 - Cham, Switzerland: Springer Verlag.details
|
|
Information loss in knowledge compilation: A comparison of Boolean envelopes.Peter Schachte, Harald Søndergaard, Leigh Whiting & Kevin Henshall - 2010 - Artificial Intelligence 174 (9-10):585-596.details
|
|
The complexity of theory revision.Russell Greiner - 1999 - Artificial Intelligence 107 (2):175-217.details
|
|
Disjunctive closures for knowledge compilation.Hélène Fargier & Pierre Marquis - 2014 - Artificial Intelligence 216 (C):129-162.details
|
|
Theory revision with queries: Horn, read-once, and parity formulas.Judy Goldsmith, Robert H. Sloan, Balázs Szörényi & György Turán - 2004 - Artificial Intelligence 156 (2):139-176.details
|
|
First order LUB approximations: characterization and algorithms.Alvaro del Val - 2005 - Artificial Intelligence 162 (1-2):7-48.details
|
|
On minimal constraint networks.Georg Gottlob - 2012 - Artificial Intelligence 191-192 (C):42-60.details
|
|
Horn approximations of empirical data.Henry Kautz, Michael Kearns & Bart Selman - 1995 - Artificial Intelligence 74 (1):129-145.details
|
|
Ordered binary decision diagrams as knowledge-bases.Takashi Horiyama & Toshihide Ibaraki - 2002 - Artificial Intelligence 136 (2):189-213.details
|
|
Logical analysis of binary data with missing bits.Endre Boros, Toshihide Ibaraki & Kazuhisa Makino - 1999 - Artificial Intelligence 107 (2):219-263.details
|
|
On functional dependencies in q-Horn theories.Toshihide Ibaraki, Alexander Kogan & Kazuhisa Makino - 2001 - Artificial Intelligence 131 (1-2):171-187.details
|
|
Tractable constraints on ordered domains.Peter G. Jeavons & Martin C. Cooper - 1995 - Artificial Intelligence 79 (2):327-339.details
|
|
Operations and evaluation measures for learning possibilistic graphical models.Christian Borgelt & Rudolf Kruse - 2003 - Artificial Intelligence 148 (1-2):385-418.details
|
|
Reasoning with models.Roni Khardon & Dan Roth - 1996 - Artificial Intelligence 87 (1-2):187-213.details
|
|
On the hardness of approximate reasoning.Dan Roth - 1996 - Artificial Intelligence 82 (1-2):273-302.details
|
|
Uncovering trees in constraint networks.Itay Meiri, Rina Dechter & Judea Pearl - 1996 - Artificial Intelligence 86 (2):245-267.details
|
|
Optimal compression of propositional Horn knowledge bases: complexity and approximation.Peter L. Hammer & Alexander Kogan - 1993 - Artificial Intelligence 64 (1):131-145.details
|
|