Switch to: References

Add citations

You must login to add citations.
  1. Descriptor Revision: Belief Change Through Direct Choice.Sven Ove Hansson - 2017 - Cham, Switzerland: Springer Verlag.
    This book provides a critical examination of how the choice of what to believe is represented in the standard model of belief change. In particular the use of possible worlds and infinite remainders as objects of choice is critically examined. Descriptors are introduced as a versatile tool for expressing the success conditions of belief change, addressing both local and global descriptor revision. The book presents dynamic descriptors such as Ramsey descriptors that convey how an agent’s beliefs tend to be changed (...)
    No categories
  • 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.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • On the hardness of approximate reasoning.Dan Roth - 1996 - Artificial Intelligence 82 (1-2):273-302.
  • Uncovering trees in constraint networks.Itay Meiri, Rina Dechter & Judea Pearl - 1996 - Artificial Intelligence 86 (2):245-267.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Reasoning with models.Roni Khardon & Dan Roth - 1996 - Artificial Intelligence 87 (1-2):187-213.
  • Horn approximations of empirical data.Henry Kautz, Michael Kearns & Bart Selman - 1995 - Artificial Intelligence 74 (1):129-145.
  • Tractable constraints on ordered domains.Peter G. Jeavons & Martin C. Cooper - 1995 - Artificial Intelligence 79 (2):327-339.
  • On functional dependencies in q-Horn theories.Toshihide Ibaraki, Alexander Kogan & Kazuhisa Makino - 2001 - Artificial Intelligence 131 (1-2):171-187.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Ordered binary decision diagrams as knowledge-bases.Takashi Horiyama & Toshihide Ibaraki - 2002 - Artificial Intelligence 136 (2):189-213.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Optimal compression of propositional Horn knowledge bases: complexity and approximation.Peter L. Hammer & Alexander Kogan - 1993 - Artificial Intelligence 64 (1):131-145.
  • The complexity of theory revision.Russell Greiner - 1999 - Artificial Intelligence 107 (2):175-217.
  • On minimal constraint networks.Georg Gottlob - 2012 - Artificial Intelligence 191-192 (C):42-60.
  • 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.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Disjunctive closures for knowledge compilation.Hélène Fargier & Pierre Marquis - 2014 - Artificial Intelligence 216 (C):129-162.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • First order LUB approximations: characterization and algorithms.Alvaro del Val - 2005 - Artificial Intelligence 162 (1-2):7-48.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Operations and evaluation measures for learning possibilistic graphical models.Christian Borgelt & Rudolf Kruse - 2003 - Artificial Intelligence 148 (1-2):385-418.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Logical analysis of binary data with missing bits.Endre Boros, Toshihide Ibaraki & Kazuhisa Makino - 1999 - Artificial Intelligence 107 (2):219-263.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark