Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
18 | Bireswar Das, Patrick Scharpfenecker, Jacobo Torán |
CNF and DNF succinct graph encodings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 253, pp. 436-447, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
18 | Aolong Zha, Miyuki Koshimura, Hiroshi Fujita 0002 |
A Hybrid Encoding of Pseudo-Boolean Constraints into CNF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAAI ![In: Conference on Technologies and Applications of Artificial Intelligence, TAAI 2017, Taipei, Taiwan, December 1-3, 2017, pp. 9-12, 2017, IEEE Computer Society, 978-1-5386-4203-0. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
18 | Rocco A. Servedio, Li-Yang Tan |
Deterministic Search for CNF Satisfying Assignments in Almost Polynomial Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, October 15-17, 2017, pp. 813-823, 2017, IEEE Computer Society, 978-1-5386-3464-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
18 | Petr Kucera, Petr Savický, Vojtech Vorel |
A Lower Bound on CNF Encodings of the At-Most-One Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings, pp. 412-428, 2017, Springer, 978-3-319-66262-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
18 | Maxim Buzdalov 0001, Benjamin Doerr |
Runtime analysis of the (1 + (λ, λ)) genetic algorithm on random satisfiable 3-CNF formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2017, Berlin, Germany, July 15-19, 2017, pp. 1343-1350, 2017, ACM, 978-1-4503-4920-8. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
18 | Jeffrey M. Dudek, Kuldeep S. Meel, Moshe Y. Vardi |
The Hard Problems Are Almost Everywhere For Random CNF-XOR Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017, pp. 600-606, 2017, ijcai.org, 978-0-9992411-0-3. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
18 | Jan Horácek, Martin Kreuzer |
On Conversions from CNF to ANF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SC²@ISSAC ![In: Proceedings of the 2nd International Workshop on Satisfiability Checking and Symbolic Computation co-located with the 42nd International Symposium on Symbolic and Algebraic Computation (ISSAC 2017), Kaiserslautern, Germany, July 29, 2017., 2017, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
18 | Edward A. Hirsch |
Exact Algorithms for General CNF SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Algorithms ![In: Encyclopedia of Algorithms - 2016 Edition, pp. 670-674, 2016, Springer, 978-1-4939-2863-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
18 | Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh 0001, Magnus Wahlström |
On Problems as Hard as CNF-SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 12(3), pp. 41:1-41:24, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
18 | Daniel Kane 0001, Osamu Watanabe 0001 |
A Short Implicant of a CNF Formula with Many Satisfying Assignments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 76(4), pp. 1203-1223, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
18 | Daniël Paulusma, Friedrich Slivovsky, Stefan Szeider |
Model Counting for CNF Formulas of Bounded Modular Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 76(1), pp. 168-194, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
18 | Marcel Wild |
ALLSAT compressed with wildcards. Part 1: Converting CNF's to orthogonal DNF's. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1608.08472, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
18 | Stefan Mengel |
Parameterized Compilation Lower Bounds for Restricted CNF-formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1604.06715, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
18 | Montserrat Hermo, Ana Ozaki |
New Steps on the Exact Learning of CNF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1609.03054, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
18 | Marcel Rémon, Johan Barthélemy |
A 3-CNF-SAT descriptor algebra and the solution of the P=NP conjecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1609.05709, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
18 | Ignasi Abío, Graeme Gange, Valentin Mayer-Eichberger, Peter J. Stuckey |
On CNF Encodings of Decision Diagrams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPAIOR ![In: Integration of AI and OR Techniques in Constraint Programming - 13th International Conference, CPAIOR 2016, Banff, AB, Canada, May 29 - June 1, 2016, Proceedings, pp. 1-17, 2016, Springer, 978-3-319-33953-5. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
18 | Broes De Cat, Yuliya Lierler |
Constraint CNF: SAT and CSP Language Under One Roof. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLP (Technical Communications) ![In: Technical Communications of the 32nd International Conference on Logic Programming, ICLP 2016 TCs, October 16-21, 2016, New York City, USA, pp. 12:1-12:15, 2016, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-007-1. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
18 | Charles Jordan, Will Klieber, Martina Seidl |
Non-CNF QBF Solving with QCIR. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAAI Workshop: Beyond NP ![In: Beyond NP, Papers from the 2016 AAAI Workshop, Phoenix, Arizona, USA, February 12, 2016., 2016, AAAI Press. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
18 | Anicet Bart, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis |
An Improved CNF Encoding Scheme for Probabilistic Inference. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECAI ![In: ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands - Including Prestigious Applications of Artificial Intelligence (PAIS 2016), pp. 613-621, 2016, IOS Press, 978-1-61499-671-2. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
18 | Stefan Mengel |
Parameterized Compilation Lower Bounds for Restricted CNF-Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings, pp. 3-12, 2016, Springer, 978-3-319-40969-6. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
18 | Jeevana Priya Inala, Rohit Singh 0002, Armando Solar-Lezama |
Synthesis of Domain Specific CNF Encoders for Bit-Vector Solvers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings, pp. 302-320, 2016, Springer, 978-3-319-40969-6. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
18 | Jeffrey M. Dudek, Kuldeep S. Meel, Moshe Y. Vardi |
Combining the k-CNF and XOR Phase-Transitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9-15 July 2016, pp. 727-734, 2016, IJCAI/AAAI Press, 978-1-57735-770-4. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
18 | Yakir Vizel, Alexander Nadel, Vadim Ryvchin |
Efficient generation of small interpolants in CNF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Methods Syst. Des. ![In: Formal Methods Syst. Des. 47(1), pp. 51-74, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
18 | D. Chao |
The Horn renamability, q-Horn and SLUR threshold for random k-CNF formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 185, pp. 44-51, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
18 | Sébastien Canard, Viet Cuong Trinh |
Private Ciphertext-Policy Attribute-based Encryption Schemes With Constant-Size Ciphertext Supporting CNF Access Policy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2015, pp. 891, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
18 | Jingcheng Liu 0001, Pinyan Lu |
FPTAS for Counting Monotone CNF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015, pp. 1531-1548, 2015, SIAM, 978-1-61197-374-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
18 | Zhijia Zhang, Yang Xu 0001 |
The New Directed Hypergraph for CNF Formula of Propositional Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISKE ![In: 10th International Conference on Intelligent Systems and Knowledge Engineering, ISKE 2015, Taipei, Taiwan, November 24-27, 2015, pp. 133-137, 2015, IEEE, 978-1-4673-9323-2. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
18 | Markus Iser, Norbert Manthey, Carsten Sinz |
Recognition of Nested Gates in CNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2015 - 18th International Conference, Austin, TX, USA, September 24-27, 2015, Proceedings, pp. 255-271, 2015, Springer, 978-3-319-24317-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
18 | Tobias Philipp, Peter Steinke |
PBLib - A Library for Encoding Pseudo-Boolean Constraints into CNF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2015 - 18th International Conference, Austin, TX, USA, September 24-27, 2015, Proceedings, pp. 9-16, 2015, Springer, 978-3-319-24317-7. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
18 | Benjamin Doerr, Frank Neumann 0001, Andrew M. Sutton |
Improved Runtime Bounds for the (1+1) EA on Random 3-CNF Formulas Based on Fitness-Distance Correlation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2015, Madrid, Spain, July 11-15, 2015, pp. 1415-1422, 2015, ACM, 978-1-4503-3472-3. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
18 | Johann Brault-Baron, Florent Capelli, Stefan Mengel |
Understanding Model Counting for beta-acyclic CNF-formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015, March 4-7, 2015, Garching, Germany, pp. 143-156, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-78-1. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
18 | Ignasi Abío, Valentin Mayer-Eichberger, Peter J. Stuckey |
Encoding Linear Constraints with Implication Chains to CNF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - 21st International Conference, CP 2015, Cork, Ireland, August 31 - September 4, 2015, Proceedings, pp. 3-11, 2015, Springer, 978-3-319-23218-8. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
18 | Joel Veness, Marcus Hutter, Laurent Orseau, Marc G. Bellemare |
Online Learning of k-CNF Boolean Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25-31, 2015, pp. 3865-3873, 2015, AAAI Press, 978-1-57735-738-4. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP BibTeX RDF |
|
18 | Endre Boros, Aritanan Gruber |
Hardness results for approximate pure Horn CNF formulae minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Math. Artif. Intell. ![In: Ann. Math. Artif. Intell. 71(4), pp. 327-363, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
18 | Fabrizio Angiulli, Rachel Ben-Eliyahu-Zohary, Fabio Fassetti, Luigi Palopoli 0001 |
On the tractability of minimal model computation for some CNF theories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Artif. Intell. ![In: Artif. Intell. 210, pp. 56-77, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
18 | Kazuyuki Amano |
On extremal kk-CNF formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 35, pp. 39-50, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
18 | Sigve Hortemo Sæther, Jan Arne Telle, Martin Vatshelle |
Solving MaxSAT and #SAT on structured CNF formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1402.6485, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
18 | Prabhu Manyem |
Decision versions of optimization problems: cardinality constraint (lower bound) as a CNF Horn formula for Matching and Clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1407.1403, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
18 | Navid Talebanfard |
On the Structure and the Number of Prime Implicants of k-CNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1408.2662, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
18 | Johann Brault-Baron, Florent Capelli, Stefan Mengel |
Understanding model counting for $β$-acyclic CNF-formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1405.6043, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
18 | Joel Veness, Marcus Hutter |
Online Learning of k-CNF Boolean Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1403.6863, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
18 | Matthew Gwynne, Oliver Kullmann |
A framework for good SAT translations, with applications to CNF representations of XOR constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1406.7398, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
18 | Stefan Porschen, Tatjana Schmidt, Ewald Speckenmeyer, Andreas Wotzlaw |
XSAT and NAE-SAT of linear CNF classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 167, pp. 1-14, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
18 | Daniel M. Kane, Osamu Watanabe 0001 |
A Short Implicant of a CNF Formula with Many Satisfying Assignments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation - 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings, pp. 273-284, 2014, Springer, 978-3-319-13074-3. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
18 | Ying Qin, ShengYu Shen, Yan Jia 0001 |
Structure-aware CNF obfuscation for privacy-preserving SAT solving. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MEMOCODE ![In: Twelfth ACM/IEEE International Conference on Formal Methods and Models for Codesign, MEMOCODE 2014, Lausanne, Switzerland, October 19-21, 2014, pp. 84-93, 2014, IEEE. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
18 | Andrew M. Sutton, Frank Neumann 0001 |
Runtime Analysis of Evolutionary Algorithms on Randomly Constructed High-Density Satisfiable 3-CNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPSN ![In: Parallel Problem Solving from Nature - PPSN XIII - 13th International Conference, Ljubljana, Slovenia, September 13-17, 2014. Proceedings, pp. 942-951, 2014, Springer, 978-3-319-10761-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
18 | Norbert Manthey, Tobias Philipp, Peter Steinke |
A More Compact Translation of Pseudo-Boolean Constraints into CNF Such That Generalized Arc Consistency Is Maintained. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KI ![In: KI 2014: Advances in Artificial Intelligence - 37th Annual German Conference on AI, Stuttgart, Germany, September 22-26, 2014. Proceedings, pp. 123-134, 2014, Springer, 978-3-319-11205-3. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
18 | David Mitchell |
Resolution and Clause Learning for Multi-Valued CNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PRUV ![In: Proceedings of the First Workshop on Logics for Reasoning about Preferences, Uncertainty, and Vagueness, PRUV 2014, co-located with 7th International Joint Conference on Automated Reasoning (IJCAR 2014), Vienna, Austria, July 23-24, 2014., pp. 141-154, 2014, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
18 | Armin Biere, Daniel Le Berre, Emmanuel Lonca, Norbert Manthey |
Detecting Cardinality Constraints in CNF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2014 - 17th International Conference, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. Proceedings, pp. 285-301, 2014, Springer, 978-3-319-09283-6. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
18 | Sigve Hortemo Sæther, Jan Arne Telle, Martin Vatshelle |
Solving MaxSAT and #SAT on Structured CNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2014 - 17th International Conference, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 14-17, 2014. Proceedings, pp. 16-31, 2014, Springer, 978-3-319-09283-6. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
18 | Enrique Matos Alfonso, Norbert Manthey |
New CNF Features and Formula Classification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POS@SAT ![In: POS-14. Fifth Pragmatics of SAT workshop, a workshop of the SAT 2014 conference, part of FLoC 2014 during the Vienna Summer of Logic, July 13, 2014, Vienna, Austria, pp. 57-71, 2014, EasyChair. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
18 | Chih-Jen Hsu, Wei-Hsun Lin, Chi-An Wu, Kei-Yong Khoo |
ICCAD-2014 CAD contest in simultaneous CNF encoder optimization with SAT solver setting selection and benchmark suite. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCAD ![In: The IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2014, San Jose, CA, USA, November 3-6, 2014, pp. 357-360, 2014, IEEE, 978-1-4799-6277-8. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
18 | Umut Oztok, Adnan Darwiche |
On Compiling CNF into Decision-DNNF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - 20th International Conference, CP 2014, Lyon, France, September 8-12, 2014. Proceedings, pp. 42-57, 2014, Springer, 978-3-319-10427-0. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
18 | Ying Qin, ShengYu Shen, Jingzhu Kong, Huadong Dai |
Cloud-Oriented SAT Solver Based on Obfuscating CNF Formula. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APWeb Workshophs ![In: Web Technologies and Applications - APWeb 2014 Workshops, SNA, NIS, and IoTS, Changsha, China, September 5, 2014. Proceedings, pp. 188-199, 2014, Springer, 978-3-319-11118-6. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
18 | Nasima Begum, Toru Nakanishi 0001, Nobuo Funabiki |
Efficient Proofs for CNF Formulas on Attributes in Pairing-Based Anonymous Credential System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEICE Trans. Fundam. Electron. Commun. Comput. Sci. ![In: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 96-A(12), pp. 2422-2433, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
18 | Chris Calabro, Russell Impagliazzo, Ramamohan Paturi |
On the Exact Complexity of Evaluating Quantified k -CNF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 65(4), pp. 817-827, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
18 | Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider |
Satisfiability of acyclic and almost acyclic CNF formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 481, pp. 85-99, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
18 | Endre Boros, Ondrej Cepek, Petr Kucera |
A decomposition method for CNF minimality proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 510, pp. 111-126, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
18 | Louay Bazzi, Nagi Nahas |
Small-bias is not enough to hit read-once CNF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR13, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
18 | Mohamed El-bachir Menai, Tasniem Nasser Al-Yahya |
Influence of CNF Encodings of AtMost-1 Constraints on UNSAT-based PMSAT Solvers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Informatica (Slovenia) ![In: Informatica (Slovenia) 37(3), pp. 245-251, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
18 | Jingcheng Liu 0001, Pinyan Lu |
FPTAS for Counting Monotone CNF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1311.3728, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
18 | Matthew Gwynne, Oliver Kullmann |
Trading inference effort versus size in CNF Knowledge Compilation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1310.5746, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
18 | Fabrizio Angiulli, Rachel Ben-Eliyahu-Zohary, Fabio Fassetti, Luigi Palopoli 0001 |
On the Tractability of Minimal Model Computation for Some CNF Theories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1310.8120, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
18 | Xili Wang |
A novel approach of solving the CNF-SAT problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1307.6291, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
18 | Saïd Jabbour, Lakhdar Sais, Yakoub Salhi |
Mining to Compact CNF Propositional Formulae ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1304.4415, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
18 | Dominik Scheder |
Unsatisfiable CNF Formulas contain Many Conflicts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation - 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings, pp. 273-283, 2013, Springer, 978-3-642-45029-7. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
18 | Dominik Scheder |
Trivial, Tractable, Hard. A Not So Sudden Complexity Jump in Neighborhood Restricted CNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation - 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings, pp. 251-261, 2013, Springer, 978-3-642-45029-7. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
18 | Yakir Vizel, Vadim Ryvchin, Alexander Nadel |
Efficient Generation of Small Interpolants in CNF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV ![In: Computer Aided Verification - 25th International Conference, CAV 2013, Saint Petersburg, Russia, July 13-19, 2013. Proceedings, pp. 330-346, 2013, Springer, 978-3-642-39798-1. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
18 | Alexandra Goultiaeva, Martina Seidl, Armin Biere |
Bridging the gap between dual propagation and CNF-based QBF solving. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DATE ![In: Design, Automation and Test in Europe, DATE 13, Grenoble, France, March 18-22, 2013, pp. 811-814, 2013, EDA Consortium San Jose, CA, USA / ACM DL, 978-1-4503-2153-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
18 | Kilian Gebhardt, Norbert Manthey |
Parallel Variable Elimination on CNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KI ![In: KI 2013: Advances in Artificial Intelligence - 36th Annual German Conference on AI, Koblenz, Germany, September 16-20, 2013. Proceedings, pp. 61-73, 2013, Springer, 978-3-642-40941-7. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
18 | Peter J. Stuckey |
There Are No CNF Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2013 - 16th International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings, pp. 19-21, 2013, Springer, 978-3-642-39070-8. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
18 | Daniël Paulusma, Friedrich Slivovsky, Stefan Szeider |
Model Counting for CNF Formulas of Bounded Modular Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany, pp. 55-66, 2013, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-50-7. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
18 | Toru Ogawa, Yangyang Liu, Ryuzo Hasegawa, Miyuki Koshimura, Hiroshi Fujita 0002 |
Modulo Based CNF Encoding of Cardinality Constraints and Its Application to MaxSAT Solvers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAI ![In: 25th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2013, Herndon, VA, USA, November 4-6, 2013, pp. 9-17, 2013, IEEE Computer Society, 978-1-4799-2971-9. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
18 | Hans-Joachim Böckenhauer, Lucia Keller |
On the Approximability of Splitting-SAT in 2-CNF Horn Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOCA ![In: Combinatorial Algorithms - 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013, Revised Selected Papers, pp. 54-66, 2013, Springer, 978-3-642-45277-2. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
18 | Dominik Scheder, Li-Yang Tan |
On the Average Sensitivity and Density of k-CNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013. Proceedings, pp. 683-698, 2013, Springer, 978-3-642-40327-9. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
18 | Nasima Begum, Toru Nakanishi 0001, Nobuo Funabiki |
Reducing public-key size in an anonymous credential system for CNF formulas with constant-size proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GCCE ![In: IEEE 2nd Global Conference on Consumer Electronics, GCCE 2013, Tokyo, Japan, 1-4 October 2013, pp. 530-533, 2013, IEEE. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
18 | Giorgio Ausiello, Francesco Cristiano, Luigi Laura |
Syntactic Isomorphism of CNF Boolean Formulas is Graph Isomorphism Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR12, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
18 | Nets Hawk Katz |
On the CNF-complexity of bipartite graphs containing no K2,2's ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1206.6068, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
18 | Daan Fierens, Guy Van den Broeck, Ingo Thon, Bernd Gutmann, Luc De Raedt |
Inference in Probabilistic Logic Programs using Weighted CNF's ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1202.3719, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
18 | Marcel Wild |
Revisitin the enumeration of all models of a Boolean 2-CNF ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1208.2559, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
18 | Endre Boros, Aritanan Gruber |
Hardness Results for Approximate Pure Horn CNF Formulae Minimization ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1204.3529, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
18 | Ondrej Cepek, Petr Kucera, Petr Savický |
Boolean functions with a simple certificate for CNF complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 160(4-5), pp. 365-382, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
18 | Matti Järvisalo, Armin Biere, Marijn Heule |
Simulating Circuit-Level Simplifications on CNF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 49(4), pp. 583-619, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
18 | Norbert Manthey |
Coprocessor 2.0 - A Flexible CNF Simplifier - (Tool Presentation). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2012 - 15th International Conference, Trento, Italy, June 17-20, 2012. Proceedings, pp. 436-441, 2012, Springer, 978-3-642-31611-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
18 | Yael Ben-Haim, Alexander Ivrii, Oded Margalit, Arie Matsliah |
Perfect Hashing and CNF Encodings of Cardinality Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2012 - 15th International Conference, Trento, Italy, June 17-20, 2012. Proceedings, pp. 397-409, 2012, Springer, 978-3-642-31611-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
18 | Dimitris Achlioptas, Ricardo Menchaca-Mendez |
Exponential Lower Bounds for DPLL Algorithms on Satisfiable Random 3-CNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2012 - 15th International Conference, Trento, Italy, June 17-20, 2012. Proceedings, pp. 327-340, 2012, Springer, 978-3-642-31611-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
18 | Nasima Begum, Toru Nakanishi 0001, Nobuo Funabiki |
Efficient Proofs for CNF Formulas on Attributes in Pairing-Based Anonymous Credential System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICISC ![In: Information Security and Cryptology - ICISC 2012 - 15th International Conference, Seoul, Korea, November 28-30, 2012, Revised Selected Papers, pp. 495-509, 2012, Springer, 978-3-642-37681-8. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
18 | Le Zhao, Xiaozhong Liu, Jamie Callan |
WikiQuery - An Interactive Collaboration Interface for Creating, Storing and Sharing Effective CNF Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OSIR@SIGIR ![In: Proceedings of the SIGIR 2012 Workshop on Open Source Information Retrieval, OSIR@SIGIR 2012, Portland, Oregon, USA, 16th August 2012, pp. 1-8, 2012, University of Otago, Dunedin, New Zealand, 978-0-473-22025-9. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
18 | Aritanan Gruber, Endre Boros |
Hardness Results for Approximate Pure Horn CNF Formulae Minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAIM ![In: International Symposium on Artificial Intelligence and Mathematics, ISAIM 2012, Fort Lauderdale, Florida, USA, January 9-11, 2012, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
18 | Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh 0001, Magnus Wahlström |
On Problems as Hard as CNF-SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 27th Conference on Computational Complexity, CCC 2012, Porto, Portugal, June 26-29, 2012, pp. 74-84, 2012, IEEE Computer Society, 978-1-4673-1663-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
18 | Kazuyuki Amano |
On Extremal k-CNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 38, pp. 37-42, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
18 | Kazuyuki Amano |
Tight Bounds on the Average Sensitivity of k-CNF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. ![In: Theory Comput. 7(1), pp. 45-48, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
18 | Uriel Feige, Abraham D. Flaxman, Dan Vilenchik |
On the Diameter of the Set of Satisfying Assignments in Random Satisfiable k-CNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 25(2), pp. 736-749, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
18 | Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto 0001 |
An exact algorithm for the Boolean connectivity problem for k-CNF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 412(35), pp. 4613-4618, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
18 | Olivier Bailleux |
BoolVar/PB v1.0, a java library for translating pseudo-Boolean constraints into CNF formulae ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1103.3954, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
18 | Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider |
Satisfiability of Acyclic and Almost Acyclic CNF Formulas (II) ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1104.4279, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
18 | Amir Aavani |
Translating Pseudo-Boolean Constraints into CNF ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1104.1479, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
18 | Arup Kumar Ghosh |
Speeding up SAT solver by exploring CNF symmetries : Revisited ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1102.0230, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
18 | Irénée Briquel, Pascal Koiran, Klaus Meer |
On the expressive power of CNF formulas of bounded tree- and clique-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 159(1), pp. 1-14, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
18 | Daan Fierens, Guy Van den Broeck, Ingo Thon, Bernd Gutmann, Luc De Raedt |
Inference in Probabilistic Logic Programs using Weighted CNF's. ![Search on Bibsonomy](Pics/bibsonomy.png) |
UAI ![In: UAI 2011, Proceedings of the Twenty-Seventh Conference on Uncertainty in Artificial Intelligence, Barcelona, Spain, July 14-17, 2011, pp. 211-220, 2011, AUAI Press, 978-0-9749039-7-2. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|