Search results for "CNF"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
18	Narendra S. Chaudhari	3-CNF-Satisfiability in Polynomial Time.	IICAI	2011	DBLP BibTeX RDF
18	Son Thanh To, Tran Cao Son, Enrico Pontelli	Conjunctive Representations in Contingent Planning: Prime Implicates Versus Minimal CNF Formula.	AAAI	2011	DBLP DOI BibTeX RDF
18	Marijn Heule, Matti Järvisalo, Armin Biere	Efficient CNF Simplification Based on Binary Implication Graphs.	SAT	2011	DBLP DOI BibTeX RDF
18	Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider	Satisfiability of Acyclic and almost Acyclic CNF Formulas (II).	SAT	2011	DBLP DOI BibTeX RDF
18	Amir Aavani	Translating Pseudo-Boolean Constraints into CNF.	SAT	2011	DBLP DOI BibTeX RDF
18	Joseph Selman, Mohamed R. Amer, Alan Fern, Sinisa Todorovic	PEL-CNF: Probabilistic event logic conjunctive normal form for video interpretation.	ICCV Workshops	2011	DBLP DOI BibTeX RDF
18	Miroslav N. Velev, Ping Gao 0002	CNF encodings of cardinality in formal methods for robustness checking of gate-level circuits.	ISCAS	2011	DBLP DOI BibTeX RDF
18	Son Thanh To, Enrico Pontelli, Tran Cao Son	On the Effectiveness of CNF and DNF Representations in Contingent Planning.	IJCAI	2011	DBLP DOI BibTeX RDF
18	Eli Ben-Sasson, Russell Impagliazzo	Random Cnf's are Hard for the Polynomial Calculus.	Comput. Complex.	2010	DBLP DOI BibTeX RDF
18	Anton Dries, Luc De Raedt, Siegfried Nijssen	Mining Predictive k-CNF Expressions.	IEEE Trans. Knowl. Data Eng.	2010	DBLP DOI BibTeX RDF	data mining, machine learning, Concept learning
18	Olivier Bailleux	On the CNF encoding of cardinality constraints and beyond	CoRR	2010	DBLP BibTeX RDF
18	Karthekeyan Chandrasekaran, Navin Goyal, Bernhard Haeupler	Satisfiability Thresholds for k-CNF Formula with Bounded Variable Intersections	CoRR	2010	DBLP BibTeX RDF
18	Angelo De Caro, Vincenzo Iovino, Giuseppe Persiano	Efficient Fully Secure (Hierarchical) Predicate Encryption for Conjunctions, Disjunctions and k-CNF/DNF formulae.	IACR Cryptol. ePrint Arch.	2010	DBLP BibTeX RDF
18	Marijn Heule, Matti Järvisalo, Armin Biere	Clause Elimination Procedures for CNF Formulas.	LPAR (Yogyakarta)	2010	DBLP DOI BibTeX RDF
18	Daniel Tille, Stephan Eggersglüß, Rene Krenz-Baath, Jürgen Schlöffel, Rolf Drechsler	Improving CNF representations in SAT-based ATPG for industrial circuits using BDDs.	ETS	2010	DBLP DOI BibTeX RDF
18	Bernardo C. Vieira, Fabrício Vivas Andrade, Antônio Otávio Fernandes	A modular CNF-based SAT solver.	SBCCI	2010	DBLP DOI BibTeX RDF
18	Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto 0001	An Exact Algorithm for the Boolean Connectivity Problem for k-CNF.	SAT	2010	DBLP DOI BibTeX RDF
18	Uwe Bubeck, Hans Kleine Büning	Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN.	SAT	2010	DBLP DOI BibTeX RDF
18	Lijun Dong, Dan Zhang 0010, Yanyong Zhang, Dipankar Raychaudhuri	Optimized Content Caching and Request Capture in CNF Networks.	WICON	2010	DBLP DOI BibTeX RDF
18	Dominik Scheder	Unsatisfiable Linear CNF Formulas Are Large and Complex.	STACS	2010	DBLP DOI BibTeX RDF
18	Son Thanh To, Tran Cao Son, Enrico Pontelli	A New Approach to Conformant Planning Using CNF*.	ICAPS	2010	DBLP BibTeX RDF
18	Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider	Satisfiability of Acyclic and Almost Acyclic CNF Formulas.	FSTTCS	2010	DBLP DOI BibTeX RDF
18	Chris Calabro, Russell Impagliazzo, Ramamohan Paturi	On the Exact Complexity of Evaluating Quantified k-CNF.	IPEC	2010	DBLP DOI BibTeX RDF
18	Tatjana Schmidt	Computational complexity of SAT, XSAT and NAE-SAT for linear and mixed Horn CNF formulas.		2010	RDF
18	Uwe Bubeck, Hans Kleine Büning	A new 3-CNF transformation by parallel-serial graphs.	Inf. Process. Lett.	2009	DBLP DOI BibTeX RDF
18	Yong Gao 0001	Data reductions, fixed parameter tractability, and random weighted d-CNF satisfiability.	Artif. Intell.	2009	DBLP DOI BibTeX RDF
18	Carmel Domshlak, Jörg Hoffmann 0001, Ashish Sabharwal	Friends or Foes? On Planning as Satisfiability and Abstract CNF Encodings.	J. Artif. Intell. Res.	2009	DBLP DOI BibTeX RDF
18	Dominik Scheder	Unsatisfiable Linear CNF Formulas Are Large, and Difficult to Construct Explicitely	CoRR	2009	DBLP BibTeX RDF
18	Stefan Porschen, Ewald Speckenmeyer, Xishun Zhao	Linear CNF formulas and satisfiability.	Discret. Appl. Math.	2009	DBLP DOI BibTeX RDF
18	Steven D. Prestwich	CNF Encodings.	Handbook of Satisfiability	2009	DBLP DOI BibTeX RDF
18	Weinan Zhao, Weimin Wu	ASIG: An all-solution SAT solver for CNF formulas.	CAD/Graphics	2009	DBLP DOI BibTeX RDF
18	Benjamin Chambers, Panagiotis Manolios, Daron Vroon 0001	Faster SAT solving with better CNF generation.	DATE	2009	DBLP DOI BibTeX RDF
18	Anbulagan, John K. Slaney	Towards a Generic CNF Simplifier for Minimising Structured Problem Hardness.	ICTAI	2009	DBLP DOI BibTeX RDF
18	Éric Grégoire, Bertrand Mazure, Lakhdar Sais	Local Autarkies Searching for the Dynamic Partition of CNF Formulae.	ICTAI	2009	DBLP DOI BibTeX RDF
18	Anbulagan, Alban Grastien	Importance of Variables Semantic in CNF Encoding of Cardinality Constraints.	SARA	2009	DBLP BibTeX RDF
18	Edward A. Hirsch	Exact Algorithms for General CNF SAT.	Encyclopedia of Algorithms	2008	DBLP DOI BibTeX RDF
18	Yong Gao 0001	A Fixed-Parameter Algorithm for Random Instances of Weighted d-CNF Satisfiability	CoRR	2008	DBLP BibTeX RDF
18	Heidi Gebauer	Unsatisfiable (k,(4*2^k/k))-CNF formulas	CoRR	2008	DBLP BibTeX RDF
18	Dominik Scheder	Satisfiability of Almost Disjoint CNF Formulas	CoRR	2008	DBLP BibTeX RDF
18	Dominik Scheder, Philipp Zumstein	An Improved Bound on the Number of Conflicts in Unsatisfiable k-CNF Formulas	CoRR	2008	DBLP BibTeX RDF
18	Josep Argelich, Inês Lynce	CNF Instances from the Software Package Installation Problem.	RCRA	2008	DBLP BibTeX RDF
18	João Marques-Silva 0001, Inês Lynce	Towards Robust CNF Encodings of Cardinality Constraints.	CP	2007	DBLP DOI BibTeX RDF
18	Shlomo Hoory, Stefan Szeider	A Note on Unsatisfiable k-CNF Formulas with Few Occurrences per Variable.	SIAM J. Discret. Math.	2006	DBLP DOI BibTeX RDF
18	Thomas Stibor, Jonathan Timmis, Claudia Eckert 0001	The Link between r-contiguous Detectors and k-CNF Satisfiability.	IEEE Congress on Evolutionary Computation	2006	DBLP DOI BibTeX RDF
18	Vijay Durairaj, Priyank Kalla	Guiding CNF-SAT Search by Analyzing Constraint-Variable Dependencies and Clause Lengths.	HLDVT	2006	DBLP DOI BibTeX RDF
18	Marina Langlois, Robert H. Sloan, György Turán	Horn Upper Bounds of Random 3-CNF: A Computational Study.	AI&M	2006	DBLP BibTeX RDF
18	Akihiro Matsuura	A Note on Approximating Inclusion-Exclusion for k-CNF Formulas.	IEICE Trans. Inf. Syst.	2005	DBLP BibTeX RDF
18	Paolo Liberatore	Redundancy in logic I: CNF propositional formulae.	Artif. Intell.	2005	DBLP DOI BibTeX RDF
18	Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener	On converting CNF to DNF.	Theor. Comput. Sci.	2005	DBLP DOI BibTeX RDF
18	Petr Kucera	On the size of maximum renamable Horn sub-CNF.	Discret. Appl. Math.	2005	DBLP DOI BibTeX RDF
18	Vishnu C. Vimjam, Michael S. Hsiao	Increasing the deducibility in CNF instances for efficient SAT-based bounded model checking.	HLDVT	2005	DBLP DOI BibTeX RDF
18	Rajat Arora, Michael S. Hsiao	CNF formula simplification using implication reasoning.	HLDVT	2004	DBLP DOI BibTeX RDF
18	Adnan Darwiche	New Advances in Compiling CNF into Decomposable Negation Normal Form.	ECAI	2004	DBLP BibTeX RDF
18	Marijn Heule, Hans van Maaren	Aligning CNF- and Equivalence-reasoning.	SAT	2004	DBLP BibTeX RDF
18	Olivier Bailleux, Yacine Boufkhad	Full CNF Encoding: The Counting Constraints Case.	SAT	2004	DBLP BibTeX RDF
18	Daniel Sheridan	The Optimality of a Fast CNF Conversion and its Use with SAT.	SAT	2004	DBLP BibTeX RDF
18	Miroslav N. Velev	Using Automatic Case Splits and Efficient CNF Translation to Guide a SAT-solver when Formally Verifying Out-Of-Order Processors.	AI&M	2004	DBLP BibTeX RDF
18	Kazuyuki Amano, Kazuo Iwama, Akira Maruoka, Kenshi Matsuo, Akihiro Matsuura	Inclusion-exclusion for k-CNF formulas.	Inf. Process. Lett.	2003	DBLP DOI BibTeX RDF
18	Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener	On Converting CNF to DNF	Electron. Colloquium Comput. Complex.	2003	DBLP BibTeX RDF
18	Nadia Creignou, Hervé Daudé	Smooth and sharp thresholds for random k-XOR-CNF satisfiability.	RAIRO Theor. Informatics Appl.	2003	DBLP DOI BibTeX RDF
18	Reinhard Pichler	On the complexity of equational problems in CNF.	J. Symb. Comput.	2003	DBLP DOI BibTeX RDF
18	Sivaram Gopalakrishnan, Vijay Durairaj, Priyank Kalla	Integrating CNF and BDD based SAT solvers.	HLDVT	2003	DBLP DOI BibTeX RDF
18	Ryan Williams 0001	On Computing k-CNF Formula Properties.	SAT	2003	DBLP DOI BibTeX RDF
18	Irina Perfilieva, Vladik Kreinovich	A new universal approximation result for fuzzy systems, which reflects CNF DNF duality.	Int. J. Intell. Syst.	2002	DBLP DOI BibTeX RDF
18	Kazuo Iwama, Daisuke Kawai, Shuichi Miyazaki, Yasuo Okabe, Jun Umemoto	Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM.	ACM J. Exp. Algorithmics	2002	DBLP DOI BibTeX RDF
18	Paolo Liberatore	Redundancy in Logic I: CNF Propositional Formulae	CoRR	2002	DBLP BibTeX RDF
18	Paolo Liberatore	The Complexity of Checking Redundancy of CNF Propositional Formulae.	ECAI	2002	DBLP BibTeX RDF
18	Stephan Schulz 0001	A Comparison of Different Techniques for Grounding Near-Propositional CNF Formulae.	FLAIRS	2002	DBLP BibTeX RDF
18	Sven Baumer, Juan Luis Esteban, Jacobo Torán	Minimally Unsatisfiable CNF Formulas.	Bull. EATCS	2001	DBLP BibTeX RDF
18	Mitchell A. Harris	Counting Satisfiable k-CNF Formulas.	CP	2001	DBLP DOI BibTeX RDF
18	El-Sayed M. El-Horbaty	A Linear Time Parallel Algorithm for the 2-CNF Satisfiability Problem.	Egypt. Comput. Sci. J.	2000	DBLP BibTeX RDF
18	Yacine Boufkhad, Olivier Dubois 0002	Length of Prime Implicants and Number of Solutions of Random CNF Formulae.	Theor. Comput. Sci.	1999	DBLP DOI BibTeX RDF
18	Carlos Domingo, Nina Mishra, Leonard Pitt	Efficient Read-Restricted Monotone CNF/DNF Dualization by Learning with Membership Queries.	Mach. Learn.	1999	DBLP DOI BibTeX RDF
18	Oliver Kullmann	Investigating a general hierarchy of polynomially decidable classes of CNF's based on short tree-like resolution proofs	Electron. Colloquium Comput. Complex.	1999	DBLP BibTeX RDF
18	Nadia Creignou, Hervé Daudé	Satisfiability Threshold for Random XOR-CNF Formulas.	Discret. Appl. Math.	1999	DBLP DOI BibTeX RDF
18	Eli Ben-Sasson, Russell Impagliazzo	Random CNF's are Hard for the Polynomial Calculus.	FOCS	1999	DBLP DOI BibTeX RDF	polynomial calculus, satisfiability, proof complexity
18	Wenqi Huang, Wei Li 0022	A hopeful CNF-SAT algorithm - Its high efficiency, industrial application and limitation.	J. Comput. Sci. Technol.	1998	DBLP DOI BibTeX RDF
18	Gennady Davydov, Inna Davydova, Hans Kleine Büning	An Efficient Algorithm for the Minimal Unsatisfiability Problem for a Subclass of CNF.	Ann. Math. Artif. Intell.	1998	DBLP DOI BibTeX RDF
18	Geoff Sutcliffe, Christian B. Suttner	The TPTP Problem Library - CNF Release v1.2.1.	J. Autom. Reason.	1998	DBLP DOI BibTeX RDF
18	Paul Beame, Richard M. Karp, Toniann Pitassi, Michael E. Saks	On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas.	STOC	1998	DBLP DOI BibTeX RDF
18	Anavai Ramesh, George Becker, Neil V. Murray	CNF and DNF Considered Harmful for Computing Prime Implicants/Implicates.	J. Autom. Reason.	1997	DBLP DOI BibTeX RDF
18	Rahul Roy-Chowdhury, Mukesh Dalal	Model-Theoretic Semantics and Tractable Algorithm for CNF-BCP.	AAAI/IAAI	1997	DBLP BibTeX RDF
18	Ewald Speckenmeyer, Max Böhm, Peter Heusch	On the imbalance of distributions of solutions of CNF-formulas and its impact on satisfiability solvers.	Satisfiability Problem: Theory and Applications	1996	DBLP DOI BibTeX RDF
18	Evangelos Triantaphyllou, Allen L. Soyster	A Relationship Between CNF and DNF Systems Derivable from Examples.	INFORMS J. Comput.	1995	DBLP DOI BibTeX RDF
18	Raymond J. Mooney	Encouraging Experimental Results on Learning CNF.	Mach. Learn.	1995	DBLP DOI BibTeX RDF
18	Byungki Cha, Kazuo Iwama	Performance Test of Local Search Algorithms Using New Types of Random CNF Formulas.	IJCAI	1995	DBLP BibTeX RDF
18	Andrew T. Ogielski	Minimal Samples of Positive Examples Identifying k-CNF Boolean Functions	Inf. Comput.	1994	DBLP DOI BibTeX RDF
18	Harry B. Hunt III, Madhav V. Marathe, Richard Edwin Stearns	Generalized CNF Satisfiability Problems and Non-Efficient.	SCT	1994	DBLP DOI BibTeX RDF
18	Robert Cowen, Katherine Wyatt	BREAKUP: a preprocessing algorithm for satisfiability testing of CNF formulas.	Notre Dame J. Formal Log.	1993	DBLP DOI BibTeX RDF
18	Andrei Z. Broder, Alan M. Frieze, Eli Upfal	On the Satisfiability and Maximum Satisfiability of Random 3-CNF Formulas.	SODA	1993	DBLP DOI BibTeX RDF
18	Reiner Hähnle	Short CNF in Finitely-Valued Logics.	ISMIS	1993	DBLP DOI BibTeX RDF
18	Shankar Vaidyanathan, S. Lakshmivarahan	Analysis of Upper Bound in Valiant's Model for Learning Bounded CNF Expressions.	SAC	1993	DBLP DOI BibTeX RDF
18	Zhi-Zhong Chen	A Fast and Efficient Parallel Algorithm for Finding a Satisfying Truth Assignment to a 2-CNF Formula.	Inf. Process. Lett.	1992	DBLP DOI BibTeX RDF
18	David J. Haglin	Approximating Maximum 2-CNF Satisfiability.	Parallel Process. Lett.	1992	DBLP DOI BibTeX RDF
18	Kazuo Iwama, Hidetoshi Abeta, Eiji Miyano	Random Generation of Satisfiable and Unsatisfiable CNF Predicates.	IFIP Congress (1)	1992	DBLP BibTeX RDF
18	Daniel S. Hirschberg, Michael J. Pazzani	Average Case Analysis of Learning kappa-CNF Concepts.	ML	1992	DBLP DOI BibTeX RDF
18	Vikraman Arvind, Somenath Biswas	On Some Bandwidth Restricted Versions of the Satisfiability Problem of Propositional CNF Formulas.	Theor. Comput. Sci.	1989	DBLP DOI BibTeX RDF
18	Kazuo Iwama	CNF Satisfiability Test by Counting and Polynomial Average Time.	SIAM J. Comput.	1989	DBLP DOI BibTeX RDF
18	Stephen A. Cook, Michael Luby	A Simple Parallel Algorithm for Finding a Satisfying Truth Assignment to a 2-CNF Formula.	Inf. Process. Lett.	1988	DBLP DOI BibTeX RDF
18	Vikraman Arvind, Somenath Biswas	An O(n²) Algorithm for the Satisfiability Problem of a Subset of Propositional Sentences in CNF That Includes All Horn Sentences.	Inf. Process. Lett.	1987	DBLP DOI BibTeX RDF