Author:
De Ita Luna Guillermo,Marcial-Romero J. Raymundo,Hernández José A.
Subject
General Computer Science,Theoretical Computer Science
Reference19 articles.
1. J. Buresh-Oppenheim, D. Mitchell, Minimum 2CNF resolution refutations in polynomial time, in: Proc. SAT'07 - 10th int. Conf. on Theory and applications of satisfiability testing, 2007, pp. 300–313.
2. Speeding-up heuristic allocation, scheduling and binding with SAT-based abstraction/refinement techniques;Cabodi;ACM Trans. Design Autom. Electr. Syst.,2010
3. Belief Revision within fragments of propositional logic;Creignou,2012
4. Counting the number of solutions for instances of satisfiability;Dubois;Theor. Comp. Sc.,1991
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献