Publication:4249522
From MaRDI portal
zbMath0923.03055MaRDI QIDQ4249522
Toshihide Ibaraki, Thomas Eiter, Kazuhisa Makino
Publication date: 17 June 1999
polynomial time algorithms; characteristic models; disjunctions of propositional Horn theories; Horn CNFs; Horn core
68Q25: Analysis of algorithms and problem complexity
03D15: Complexity of computation (including implicit computational complexity)
03B05: Classical propositional logic
Related Items
On the difference of Horn theories, Semantical and computational aspects of Horn approximations, Join on Closure Systems Using Direct Implicational Basis Representation