Publisher
Springer International Publishing
Reference24 articles.
1. Belov, A., Janota, M., Lynce, I., Marques-Silva, J.: Algorithms for computing minimal equivalent subformulas. Artif. Intell. 266, 309–326 (2014)
2. Darwiche, A.: On tractable counting of theory models and its application to truth maintenance and belief revision. Appl. NonClassical Logics 11, 11–34 (2001)
3. Herzig, A., Lang, J., Marquis, P.: Propositional update operators based on formula/literal dependence. ACM Trans. Comput. Logic 14, 1–31 (2013)
4. Selman, B.: Tractable default reasoning. Ph.D. dissertation, Department of Computer Science University of Toronto (1990)
5. Alchourrón, C., Gärdenfors, P., Makinson, D.: On the logic of theory change: partialmeet contraction and revision functions. J. Symbolic Logic 50, 510–530 (1985)