Search results for "CNF"

Hits ?▲	Authors	Title	Venue	Year	Link
18	Bireswar Das, Patrick Scharpfenecker, Jacobo Torán	CNF and DNF succinct graph encodings.	Inf. Comput.	2017	DBLP DOI BibTeX RDF
18	Aolong Zha, Miyuki Koshimura, Hiroshi Fujita 0002	A Hybrid Encoding of Pseudo-Boolean Constraints into CNF.	TAAI	2017	DBLP DOI BibTeX RDF
18	Rocco A. Servedio, Li-Yang Tan	Deterministic Search for CNF Satisfying Assignments in Almost Polynomial Time.	FOCS	2017	DBLP DOI BibTeX RDF
18	Petr Kucera, Petr Savický, Vojtech Vorel	A Lower Bound on CNF Encodings of the At-Most-One Constraint.	SAT	2017	DBLP DOI BibTeX RDF
18	Maxim Buzdalov 0001, Benjamin Doerr	Runtime analysis of the (1 + (λ, λ)) genetic algorithm on random satisfiable 3-CNF formulas.	GECCO	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.	IJCAI	2017	DBLP DOI BibTeX RDF
18	Jan Horácek, Martin Kreuzer	On Conversions from CNF to ANF.	SC²@ISSAC	2017	DBLP BibTeX RDF
18	Edward A. Hirsch	Exact Algorithms for General CNF SAT.	Encyclopedia of Algorithms	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.	ACM Trans. Algorithms	2016	DBLP DOI BibTeX RDF
18	Daniel Kane 0001, Osamu Watanabe 0001	A Short Implicant of a CNF Formula with Many Satisfying Assignments.	Algorithmica	2016	DBLP DOI BibTeX RDF
18	Daniël Paulusma, Friedrich Slivovsky, Stefan Szeider	Model Counting for CNF Formulas of Bounded Modular Treewidth.	Algorithmica	2016	DBLP DOI BibTeX RDF
18	Marcel Wild	ALLSAT compressed with wildcards. Part 1: Converting CNF's to orthogonal DNF's.	CoRR	2016	DBLP BibTeX RDF
18	Stefan Mengel	Parameterized Compilation Lower Bounds for Restricted CNF-formulas.	CoRR	2016	DBLP BibTeX RDF
18	Montserrat Hermo, Ana Ozaki	New Steps on the Exact Learning of CNF.	CoRR	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.	CoRR	2016	DBLP BibTeX RDF
18	Ignasi Abío, Graeme Gange, Valentin Mayer-Eichberger, Peter J. Stuckey	On CNF Encodings of Decision Diagrams.	CPAIOR	2016	DBLP DOI BibTeX RDF
18	Broes De Cat, Yuliya Lierler	Constraint CNF: SAT and CSP Language Under One Roof.	ICLP (Technical Communications)	2016	DBLP DOI BibTeX RDF
18	Charles Jordan, Will Klieber, Martina Seidl	Non-CNF QBF Solving with QCIR.	AAAI Workshop: Beyond NP	2016	DBLP BibTeX RDF
18	Anicet Bart, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis	An Improved CNF Encoding Scheme for Probabilistic Inference.	ECAI	2016	DBLP DOI BibTeX RDF
18	Stefan Mengel	Parameterized Compilation Lower Bounds for Restricted CNF-Formulas.	SAT	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.	SAT	2016	DBLP DOI BibTeX RDF
18	Jeffrey M. Dudek, Kuldeep S. Meel, Moshe Y. Vardi	Combining the k-CNF and XOR Phase-Transitions.	IJCAI	2016	DBLP BibTeX RDF
18	Yakir Vizel, Alexander Nadel, Vadim Ryvchin	Efficient generation of small interpolants in CNF.	Formal Methods Syst. Des.	2015	DBLP DOI BibTeX RDF
18	D. Chao	The Horn renamability, q-Horn and SLUR threshold for random k-CNF formulas.	Discret. Appl. Math.	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.	IACR Cryptol. ePrint Arch.	2015	DBLP BibTeX RDF
18	Jingcheng Liu 0001, Pinyan Lu	FPTAS for Counting Monotone CNF.	SODA	2015	DBLP DOI BibTeX RDF
18	Zhijia Zhang, Yang Xu 0001	The New Directed Hypergraph for CNF Formula of Propositional Logic.	ISKE	2015	DBLP DOI BibTeX RDF
18	Markus Iser, Norbert Manthey, Carsten Sinz	Recognition of Nested Gates in CNF Formulas.	SAT	2015	DBLP DOI BibTeX RDF
18	Tobias Philipp, Peter Steinke	PBLib - A Library for Encoding Pseudo-Boolean Constraints into CNF.	SAT	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.	GECCO	2015	DBLP DOI BibTeX RDF
18	Johann Brault-Baron, Florent Capelli, Stefan Mengel	Understanding Model Counting for beta-acyclic CNF-formulas.	STACS	2015	DBLP DOI BibTeX RDF
18	Ignasi Abío, Valentin Mayer-Eichberger, Peter J. Stuckey	Encoding Linear Constraints with Implication Chains to CNF.	CP	2015	DBLP DOI BibTeX RDF
18	Joel Veness, Marcus Hutter, Laurent Orseau, Marc G. Bellemare	Online Learning of k-CNF Boolean Functions.	IJCAI	2015	DBLP BibTeX RDF
18	Endre Boros, Aritanan Gruber	Hardness results for approximate pure Horn CNF formulae minimization.	Ann. Math. Artif. Intell.	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.	Artif. Intell.	2014	DBLP DOI BibTeX RDF
18	Kazuyuki Amano	On extremal kk-CNF formulas.	Eur. J. Comb.	2014	DBLP DOI BibTeX RDF
18	Sigve Hortemo Sæther, Jan Arne Telle, Martin Vatshelle	Solving MaxSAT and #SAT on structured CNF formulas.	CoRR	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.	CoRR	2014	DBLP BibTeX RDF
18	Navid Talebanfard	On the Structure and the Number of Prime Implicants of k-CNF Formulas.	CoRR	2014	DBLP BibTeX RDF
18	Johann Brault-Baron, Florent Capelli, Stefan Mengel	Understanding model counting for $β$-acyclic CNF-formulas.	CoRR	2014	DBLP BibTeX RDF
18	Joel Veness, Marcus Hutter	Online Learning of k-CNF Boolean Functions.	CoRR	2014	DBLP BibTeX RDF
18	Matthew Gwynne, Oliver Kullmann	A framework for good SAT translations, with applications to CNF representations of XOR constraints.	CoRR	2014	DBLP BibTeX RDF
18	Stefan Porschen, Tatjana Schmidt, Ewald Speckenmeyer, Andreas Wotzlaw	XSAT and NAE-SAT of linear CNF classes.	Discret. Appl. Math.	2014	DBLP DOI BibTeX RDF
18	Daniel M. Kane, Osamu Watanabe 0001	A Short Implicant of a CNF Formula with Many Satisfying Assignments.	ISAAC	2014	DBLP DOI BibTeX RDF
18	Ying Qin, ShengYu Shen, Yan Jia 0001	Structure-aware CNF obfuscation for privacy-preserving SAT solving.	MEMOCODE	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.	PPSN	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.	KI	2014	DBLP DOI BibTeX RDF
18	David Mitchell	Resolution and Clause Learning for Multi-Valued CNF Formulas.	PRUV	2014	DBLP BibTeX RDF
18	Armin Biere, Daniel Le Berre, Emmanuel Lonca, Norbert Manthey	Detecting Cardinality Constraints in CNF.	SAT	2014	DBLP DOI BibTeX RDF
18	Sigve Hortemo Sæther, Jan Arne Telle, Martin Vatshelle	Solving MaxSAT and #SAT on Structured CNF Formulas.	SAT	2014	DBLP DOI BibTeX RDF
18	Enrique Matos Alfonso, Norbert Manthey	New CNF Features and Formula Classification.	POS@SAT	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.	ICCAD	2014	DBLP DOI BibTeX RDF
18	Umut Oztok, Adnan Darwiche	On Compiling CNF into Decision-DNNF.	CP	2014	DBLP DOI BibTeX RDF
18	Ying Qin, ShengYu Shen, Jingzhu Kong, Huadong Dai	Cloud-Oriented SAT Solver Based on Obfuscating CNF Formula.	APWeb Workshophs	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.	IEICE Trans. Fundam. Electron. Commun. Comput. Sci.	2013	DBLP DOI BibTeX RDF
18	Chris Calabro, Russell Impagliazzo, Ramamohan Paturi	On the Exact Complexity of Evaluating Quantified k -CNF.	Algorithmica	2013	DBLP DOI BibTeX RDF
18	Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider	Satisfiability of acyclic and almost acyclic CNF formulas.	Theor. Comput. Sci.	2013	DBLP DOI BibTeX RDF
18	Endre Boros, Ondrej Cepek, Petr Kucera	A decomposition method for CNF minimality proofs.	Theor. Comput. Sci.	2013	DBLP DOI BibTeX RDF
18	Louay Bazzi, Nagi Nahas	Small-bias is not enough to hit read-once CNF.	Electron. Colloquium Comput. Complex.	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.	Informatica (Slovenia)	2013	DBLP BibTeX RDF
18	Jingcheng Liu 0001, Pinyan Lu	FPTAS for Counting Monotone CNF.	CoRR	2013	DBLP BibTeX RDF
18	Matthew Gwynne, Oliver Kullmann	Trading inference effort versus size in CNF Knowledge Compilation.	CoRR	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.	CoRR	2013	DBLP BibTeX RDF
18	Xili Wang	A novel approach of solving the CNF-SAT problem.	CoRR	2013	DBLP BibTeX RDF
18	Saïd Jabbour, Lakhdar Sais, Yakoub Salhi	Mining to Compact CNF Propositional Formulae	CoRR	2013	DBLP BibTeX RDF
18	Dominik Scheder	Unsatisfiable CNF Formulas contain Many Conflicts.	ISAAC	2013	DBLP DOI BibTeX RDF
18	Dominik Scheder	Trivial, Tractable, Hard. A Not So Sudden Complexity Jump in Neighborhood Restricted CNF Formulas.	ISAAC	2013	DBLP DOI BibTeX RDF
18	Yakir Vizel, Vadim Ryvchin, Alexander Nadel	Efficient Generation of Small Interpolants in CNF.	CAV	2013	DBLP DOI BibTeX RDF
18	Alexandra Goultiaeva, Martina Seidl, Armin Biere	Bridging the gap between dual propagation and CNF-based QBF solving.	DATE	2013	DBLP DOI BibTeX RDF
18	Kilian Gebhardt, Norbert Manthey	Parallel Variable Elimination on CNF Formulas.	KI	2013	DBLP DOI BibTeX RDF
18	Peter J. Stuckey	There Are No CNF Problems.	SAT	2013	DBLP DOI BibTeX RDF
18	Daniël Paulusma, Friedrich Slivovsky, Stefan Szeider	Model Counting for CNF Formulas of Bounded Modular Treewidth.	STACS	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.	ICTAI	2013	DBLP DOI BibTeX RDF
18	Hans-Joachim Böckenhauer, Lucia Keller	On the Approximability of Splitting-SAT in 2-CNF Horn Formulas.	IWOCA	2013	DBLP DOI BibTeX RDF
18	Dominik Scheder, Li-Yang Tan	On the Average Sensitivity and Density of k-CNF Formulas.	APPROX-RANDOM	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.	GCCE	2013	DBLP DOI BibTeX RDF
18	Giorgio Ausiello, Francesco Cristiano, Luigi Laura	Syntactic Isomorphism of CNF Boolean Formulas is Graph Isomorphism Complete.	Electron. Colloquium Comput. Complex.	2012	DBLP BibTeX RDF
18	Nets Hawk Katz	On the CNF-complexity of bipartite graphs containing no K2,2's	CoRR	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	CoRR	2012	DBLP BibTeX RDF
18	Marcel Wild	Revisitin the enumeration of all models of a Boolean 2-CNF	CoRR	2012	DBLP BibTeX RDF
18	Endre Boros, Aritanan Gruber	Hardness Results for Approximate Pure Horn CNF Formulae Minimization	CoRR	2012	DBLP BibTeX RDF
18	Ondrej Cepek, Petr Kucera, Petr Savický	Boolean functions with a simple certificate for CNF complexity.	Discret. Appl. Math.	2012	DBLP DOI BibTeX RDF
18	Matti Järvisalo, Armin Biere, Marijn Heule	Simulating Circuit-Level Simplifications on CNF.	J. Autom. Reason.	2012	DBLP DOI BibTeX RDF
18	Norbert Manthey	Coprocessor 2.0 - A Flexible CNF Simplifier - (Tool Presentation).	SAT	2012	DBLP DOI BibTeX RDF
18	Yael Ben-Haim, Alexander Ivrii, Oded Margalit, Arie Matsliah	Perfect Hashing and CNF Encodings of Cardinality Constraints.	SAT	2012	DBLP DOI BibTeX RDF
18	Dimitris Achlioptas, Ricardo Menchaca-Mendez	Exponential Lower Bounds for DPLL Algorithms on Satisfiable Random 3-CNF Formulas.	SAT	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.	ICISC	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.	OSIR@SIGIR	2012	DBLP BibTeX RDF
18	Aritanan Gruber, Endre Boros	Hardness Results for Approximate Pure Horn CNF Formulae Minimization.	ISAIM	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.	CCC	2012	DBLP DOI BibTeX RDF
18	Kazuyuki Amano	On Extremal k-CNF Formulas.	Electron. Notes Discret. Math.	2011	DBLP DOI BibTeX RDF
18	Kazuyuki Amano	Tight Bounds on the Average Sensitivity of k-CNF.	Theory Comput.	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.	SIAM J. Discret. Math.	2011	DBLP DOI BibTeX RDF
18	Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto 0001	An exact algorithm for the Boolean connectivity problem for k-CNF.	Theor. Comput. Sci.	2011	DBLP DOI BibTeX RDF
18	Olivier Bailleux	BoolVar/PB v1.0, a java library for translating pseudo-Boolean constraints into CNF formulae	CoRR	2011	DBLP BibTeX RDF
18	Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider	Satisfiability of Acyclic and Almost Acyclic CNF Formulas (II)	CoRR	2011	DBLP BibTeX RDF
18	Amir Aavani	Translating Pseudo-Boolean Constraints into CNF	CoRR	2011	DBLP BibTeX RDF
18	Arup Kumar Ghosh	Speeding up SAT solver by exploring CNF symmetries : Revisited	CoRR	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.	Discret. Appl. Math.	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.	UAI	2011	DBLP BibTeX RDF