Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Bonacina, Maria Paola
1999.
A model and a first analysis of distributed‐search contraction‐based strategies.
Annals of Mathematics and Artificial Intelligence,
Vol. 27,
Issue. 1-4,
p.
149.
Groote, Jan Friso
and
Warners, Joost P.
2000.
The Propositional Formula Checker HeerHugo.
Journal of Automated Reasoning,
Vol. 24,
Issue. 1-2,
p.
101.
Hirsch, Edward A.
2000.
SAT Local Search Algorithms: Worst-Case Study.
Journal of Automated Reasoning,
Vol. 24,
Issue. 1-2,
p.
127.
Hirsch, Edward A.
2000.
New Worst-Case Upper Bounds for SAT.
Journal of Automated Reasoning,
Vol. 24,
Issue. 4,
p.
397.
Hustadt, Ullrich
and
Schmidt, Renate A.
2002.
Using Resolution for Testing Modal Satisfiability and Building Models.
Journal of Automated Reasoning,
Vol. 28,
Issue. 2,
p.
205.
Alekhnovich, Michael
Ben-Sasson, Eli
Razborov, Alexander A.
and
Wigderson, Avi
2002.
Space Complexity in Propositional Calculus.
SIAM Journal on Computing,
Vol. 31,
Issue. 4,
p.
1184.
Razborov, A.A.
2004.
Feasible proofs and computations: partnership and fusion.
p.
134.
Subramani, K.
2004.
Optimal length tree-like resolution refutations for 2SAT formulas.
ACM Transactions on Computational Logic,
Vol. 5,
Issue. 2,
p.
316.
Kullmann, Oliver
2004.
Upper and Lower Bounds on the Complexity of Generalised Resolution and Generalised Constraint Satisfaction Problems.
Annals of Mathematics and Artificial Intelligence,
Vol. 40,
Issue. 3-4,
p.
303.
Pan, Guoqiang
and
Vardi, Moshe Y.
2006.
SAT 2005.
p.
25.
Järvisalo, Matti
and
Junttila, Tommi
2007.
Principles and Practice of Constraint Programming – CP 2007.
Vol. 4741,
Issue. ,
p.
348.
Sloan, Robert H.
Szörényi, Balázs
and
Turán, György
2008.
On k-Term DNF with the Largest Number of Prime Implicants.
SIAM Journal on Discrete Mathematics,
Vol. 21,
Issue. 4,
p.
987.
Nordström, Jakob
2009.
Narrow Proofs May Be Spacious:Separating Space and Width in Resolution.
SIAM Journal on Computing,
Vol. 39,
Issue. 1,
p.
59.
Urquhart, Alasdair
2011.
A Near-Optimal Separation of Regular and General Resolution.
SIAM Journal on Computing,
Vol. 40,
Issue. 1,
p.
107.
Razborov, Alexander
2015.
Pseudorandom generators hard for k-DNF resolution and polynomial calculus resolution.
Annals of Mathematics,
Vol. 181,
Issue. 2,
p.
415.
Büning, Hans Kleine
Wojciechowski, Piotr
and
Subramani, K.
2018.
Finding read-once resolution refutations in systems of 2CNF clauses.
Theoretical Computer Science,
Vol. 729,
Issue. ,
p.
42.
Kiesl, Benjamin
Rebola-Pardo, Adrián
Heule, Marijn J. H.
and
Biere, Armin
2020.
Simulating Strong Practical Proof Systems with Extended Resolution.
Journal of Automated Reasoning,
Vol. 64,
Issue. 7,
p.
1247.
Kleine Büning, Hans
Wojciechowski, P.
and
Subramani, K.
2020.
NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability.
Mathematical Structures in Computer Science,
Vol. 30,
Issue. 7,
p.
736.
Peitl, Tomáš
and
Szeider, Stefan
2020.
Principles and Practice of Constraint Programming.
Vol. 12333,
Issue. ,
p.
514.
Py, Matthieu
Cherif, Mohamed Sami
and
Habet, Djamal
2020.
Towards Bridging the Gap Between SAT and Max-SAT Refutations.
p.
137.