Author:
Kleine Büning Hans,Zhao Xishun
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Artificial Intelligence
Reference8 articles.
1. R. Aharoni and N. Linial, Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulae, Journal of Combinatorial Theory 43 (1986) 196–204.
2. G. Ausiello, A. D’Atri and D. Sacca, Minimal representation of directed hypergraphs, SIAM Journal on Computing 2 (1986) 418–431.
3. H. Fleischner, O. Kullmann and S. Szeider, Polynomial-time recognition of minimal unsatisfiable formulae with fixed clause-variable difference, Theoretical Computer Science 289 (2002) 503–516.
4. D.S. Johnson, A catalog of complexity classes, in: Handbook of Theoretical Computer Science, Vol.A (Elsevier, Amsterdam, 1990).
5. H. Kleine Büning and T. Lettmann, Propositional Logic: Deduction and Algorithm (Cambridge University Press, 1999).
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献