Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
18 | Narendra S. Chaudhari |
3-CNF-Satisfiability in Polynomial Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IICAI ![In: Proceedings of the 5th Indian International Conference on Artificial Intelligence, IICAI 2011, Tumkur, Karnataka State, India, December 14-16, 2011, pp. 590-609, 2011, IICAI, 978-0-9727412-8-6. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
18 | Son Thanh To, Tran Cao Son, Enrico Pontelli |
Conjunctive Representations in Contingent Planning: Prime Implicates Versus Minimal CNF Formula. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAAI ![In: Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2011, San Francisco, California, USA, August 7-11, 2011, pp. 1023-1028, 2011, AAAI Press. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
18 | Marijn Heule, Matti Järvisalo, Armin Biere |
Efficient CNF Simplification Based on Binary Implication Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2011 - 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings, pp. 201-215, 2011, Springer, 978-3-642-21580-3. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI 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) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2011 - 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings, pp. 47-60, 2011, Springer, 978-3-642-21580-3. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
18 | Amir Aavani |
Translating Pseudo-Boolean Constraints into CNF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2011 - 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings, pp. 357-359, 2011, Springer, 978-3-642-21580-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCV Workshops ![In: IEEE International Conference on Computer Vision Workshops, ICCV 2011 Workshops, Barcelona, Spain, November 6-13, 2011, pp. 680-687, 2011, IEEE Computer Society, 978-1-4673-0062-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCAS ![In: International Symposium on Circuits and Systems (ISCAS 2011), May 15-19 2011, Rio de Janeiro, Brazil, pp. 1479-1482, 2011, IEEE, 978-1-4244-9473-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22, 2011, pp. 2033-2038, 2011, IJCAI/AAAI, 978-1-57735-516-8. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
18 | Eli Ben-Sasson, Russell Impagliazzo |
Random Cnf's are Hard for the Polynomial Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 19(4), pp. 501-519, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
18 | Anton Dries, Luc De Raedt, Siegfried Nijssen |
Mining Predictive k-CNF Expressions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 22(5), pp. 743-748, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
data mining, machine learning, Concept learning |
18 | Olivier Bailleux |
On the CNF encoding of cardinality constraints and beyond ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1012.3853, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
18 | Karthekeyan Chandrasekaran, Navin Goyal, Bernhard Haeupler |
Satisfiability Thresholds for k-CNF Formula with Bounded Variable Intersections ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1006.3030, 2010. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2010, pp. 492, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
18 | Marijn Heule, Matti Järvisalo, Armin Biere |
Clause Elimination Procedures for CNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR (Yogyakarta) ![In: Logic for Programming, Artificial Intelligence, and Reasoning - 17th International Conference, LPAR-17, Yogyakarta, Indonesia, October 10-15, 2010. Proceedings, pp. 357-371, 2010, Springer, 978-3-642-16241-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ETS ![In: 15th European Test Symposium, ETS 2010, Prague, Czech Republic, May 24-28, 2010, pp. 176-181, 2010, IEEE Computer Society, 978-1-4244-5833-2. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
18 | Bernardo C. Vieira, Fabrício Vivas Andrade, Antônio Otávio Fernandes |
A modular CNF-based SAT solver. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SBCCI ![In: Proceedings of the 23rd Annual Symposium on Integrated Circuits and Systems Design, SBCCI 2010, São Paulo, Brazil, September 6-9, 2010, pp. 198-203, 2010, ACM, 978-1-4503-0152-7. The full citation details ...](Pics/full.jpeg) |
2010 |
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) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2010, 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010. Proceedings, pp. 172-180, 2010, Springer, 978-3-642-14185-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2010, 13th International Conference, SAT 2010, Edinburgh, UK, July 11-14, 2010. Proceedings, pp. 58-70, 2010, Springer, 978-3-642-14185-0. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
18 | Lijun Dong, Dan Zhang 0010, Yanyong Zhang, Dipankar Raychaudhuri |
Optimized Content Caching and Request Capture in CNF Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WICON ![In: Proceedings of the 5th Annual International Conference on Wireless Internet, WICON 2010, Singapore, March 1-3, 2010, pp. 1-9, 2010, ICST / IEEE, 978-963-9799-86-8. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
18 | Dominik Scheder |
Unsatisfiable Linear CNF Formulas Are Large and Complex. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 27th International Symposium on Theoretical Aspects of Computer Science, STACS 2010, March 4-6, 2010, Nancy, France, pp. 621-632, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-16-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
18 | Son Thanh To, Tran Cao Son, Enrico Pontelli |
A New Approach to Conformant Planning Using CNF*. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICAPS ![In: Proceedings of the 20th International Conference on Automated Planning and Scheduling, ICAPS 2010, Toronto, Ontario, Canada, May 12-16, 2010, pp. 169-176, 2010, AAAI. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
18 | Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider |
Satisfiability of Acyclic and Almost Acyclic CNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 84-95, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
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) |
IPEC ![In: Parameterized and Exact Computation - 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings, pp. 50-59, 2010, Springer, 978-3-642-17492-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
18 | Tatjana Schmidt |
Computational complexity of SAT, XSAT and NAE-SAT for linear and mixed Horn CNF formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2010 |
RDF |
|
18 | Uwe Bubeck, Hans Kleine Büning |
A new 3-CNF transformation by parallel-serial graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 109(7), pp. 376-379, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Yong Gao 0001 |
Data reductions, fixed parameter tractability, and random weighted d-CNF satisfiability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Artif. Intell. ![In: Artif. Intell. 173(14), pp. 1343-1366, 2009. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Artif. Intell. Res. ![In: J. Artif. Intell. Res. 36, pp. 415-469, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Dominik Scheder |
Unsatisfiable Linear CNF Formulas Are Large, and Difficult to Construct Explicitely ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0905.1587, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
18 | Stefan Porschen, Ewald Speckenmeyer, Xishun Zhao |
Linear CNF formulas and satisfiability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 157(5), pp. 1046-1068, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Steven D. Prestwich |
CNF Encodings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Satisfiability ![In: Handbook of Satisfiability, pp. 75-97, 2009, IOS Press, 978-1-58603-929-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Weinan Zhao, Weimin Wu |
ASIG: An all-solution SAT solver for CNF formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAD/Graphics ![In: 11th International Conference on Computer-Aided Design and Computer Graphics, CAD/Graphics 2009, Huangshan, China, August 19-21, 2009, pp. 508-513, 2009, IEEE, 978-1-4244-3699-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Benjamin Chambers, Panagiotis Manolios, Daron Vroon 0001 |
Faster SAT solving with better CNF generation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DATE ![In: Design, Automation and Test in Europe, DATE 2009, Nice, France, April 20-24, 2009, pp. 1590-1595, 2009, IEEE, 978-1-4244-3781-8. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Anbulagan, John K. Slaney |
Towards a Generic CNF Simplifier for Minimising Structured Problem Hardness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAI ![In: ICTAI 2009, 21st IEEE International Conference on Tools with Artificial Intelligence, Newark, New Jersey, USA, 2-4 November 2009, pp. 99-106, 2009, IEEE Computer Society, 978-0-7695-3920-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Éric Grégoire, Bertrand Mazure, Lakhdar Sais |
Local Autarkies Searching for the Dynamic Partition of CNF Formulae. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAI ![In: ICTAI 2009, 21st IEEE International Conference on Tools with Artificial Intelligence, Newark, New Jersey, USA, 2-4 November 2009, pp. 107-114, 2009, IEEE Computer Society, 978-0-7695-3920-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
18 | Anbulagan, Alban Grastien |
Importance of Variables Semantic in CNF Encoding of Cardinality Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SARA ![In: Eighth Symposium on Abstraction, Reformulation, and Approximation, SARA 2009, Lake Arrowhead, California, USA, 8-10 August 2009, 2009, AAAI. The full citation details ...](Pics/full.jpeg) |
2009 |
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 - 2008 Edition, 2008, Springer, 978-0-387-30770-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
18 | Yong Gao 0001 |
A Fixed-Parameter Algorithm for Random Instances of Weighted d-CNF Satisfiability ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0806.4652, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
18 | Heidi Gebauer |
Unsatisfiable (k,(4*2^k/k))-CNF formulas ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0810.1904, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
18 | Dominik Scheder |
Satisfiability of Almost Disjoint CNF Formulas ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0807.1282, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
18 | Dominik Scheder, Philipp Zumstein |
An Improved Bound on the Number of Conflicts in Unsatisfiable k-CNF Formulas ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0806.1148, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
18 | Josep Argelich, Inês Lynce |
CNF Instances from the Software Package Installation Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RCRA ![In: Proceedings of the 15th RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, Udine, Italy, December 12-13, 2008., 2008, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
18 | João Marques-Silva 0001, Inês Lynce |
Towards Robust CNF Encodings of Cardinality Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2007, 13th International Conference, CP 2007, Providence, RI, USA, September 23-27, 2007, Proceedings, pp. 483-497, 2007, Springer, 978-3-540-74969-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
18 | Shlomo Hoory, Stefan Szeider |
A Note on Unsatisfiable k-CNF Formulas with Few Occurrences per Variable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 20(2), pp. 523-528, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Thomas Stibor, Jonathan Timmis, Claudia Eckert 0001 |
The Link between r-contiguous Detectors and k-CNF Satisfiability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Congress on Evolutionary Computation ![In: IEEE International Conference on Evolutionary Computation, CEC 2006, part of WCCI 2006, Vancouver, BC, Canada, 16-21 July 2006, pp. 491-498, 2006, IEEE, 0-7803-9487-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
18 | Vijay Durairaj, Priyank Kalla |
Guiding CNF-SAT Search by Analyzing Constraint-Variable Dependencies and Clause Lengths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HLDVT ![In: Eleventh Annual IEEE International High-Level Design Validation and Test Workshop 2006, Monterey, CA, USA, Nov 9-10, 2006, pp. 155-161, 2006, IEEE Computer Society, 1-4244-0679-X. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AI&M ![In: International Symposium on Artificial Intelligence and Mathematics, AI&Math 2006, Fort Lauderdale, Florida, USA, January 4-6, 2006, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP BibTeX RDF |
|
18 | Akihiro Matsuura |
A Note on Approximating Inclusion-Exclusion for k-CNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEICE Trans. Inf. Syst. ![In: IEICE Trans. Inf. Syst. 88-D(1), pp. 100-102, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
18 | Paolo Liberatore |
Redundancy in logic I: CNF propositional formulae. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Artif. Intell. ![In: Artif. Intell. 163(2), pp. 203-232, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
18 | Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener |
On converting CNF to DNF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 347(1-2), pp. 325-335, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
18 | Petr Kucera |
On the size of maximum renamable Horn sub-CNF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 149(1-3), pp. 126-130, 2005. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HLDVT ![In: Tenth IEEE International High-Level Design Validation and Test Workshop 2005, Napa Valley, CA, USA, November 30 - December 2, 2005, pp. 184-191, 2005, IEEE Computer Society, 0-7803-9571-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
18 | Rajat Arora, Michael S. Hsiao |
CNF formula simplification using implication reasoning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HLDVT ![In: Ninth IEEE International High-Level Design Validation and Test Workshop 2004, Sonoma Valley, CA, USA, November 10-12, 2004, pp. 129-134, 2004, IEEE Computer Society, 0-7803-8714-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
18 | Adnan Darwiche |
New Advances in Compiling CNF into Decomposable Negation Normal Form. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECAI ![In: Proceedings of the 16th Eureopean Conference on Artificial Intelligence, ECAI'2004, including Prestigious Applicants of Intelligent Systems, PAIS 2004, Valencia, Spain, August 22-27, 2004, pp. 328-332, 2004, IOS Press, 1-58603-452-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
18 | Marijn Heule, Hans van Maaren |
Aligning CNF- and Equivalence-reasoning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: SAT 2004 - The Seventh International Conference on Theory and Applications of Satisfiability Testing, 10-13 May 2004, Vancouver, BC, Canada, Online Proceedings, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
18 | Olivier Bailleux, Yacine Boufkhad |
Full CNF Encoding: The Counting Constraints Case. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: SAT 2004 - The Seventh International Conference on Theory and Applications of Satisfiability Testing, 10-13 May 2004, Vancouver, BC, Canada, Online Proceedings, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
18 | Daniel Sheridan |
The Optimality of a Fast CNF Conversion and its Use with SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: SAT 2004 - The Seventh International Conference on Theory and Applications of Satisfiability Testing, 10-13 May 2004, Vancouver, BC, Canada, Online Proceedings, 2004. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AI&M ![In: International Symposium on Artificial Intelligence and Mathematics, AI&M 2004, Fort Lauderdale, Florida, USA, January 4-6, 2004, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
18 | Kazuyuki Amano, Kazuo Iwama, Akira Maruoka, Kenshi Matsuo, Akihiro Matsuura |
Inclusion-exclusion for k-CNF formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 87(2), pp. 111-117, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
18 | Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener |
On Converting CNF to DNF ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR03, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP BibTeX RDF |
|
18 | Nadia Creignou, Hervé Daudé |
Smooth and sharp thresholds for random k-XOR-CNF satisfiability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RAIRO Theor. Informatics Appl. ![In: RAIRO Theor. Informatics Appl. 37(2), pp. 127-147, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
18 | Reinhard Pichler |
On the complexity of equational problems in CNF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Comput. ![In: J. Symb. Comput. 36(1-2), pp. 235-269, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
18 | Sivaram Gopalakrishnan, Vijay Durairaj, Priyank Kalla |
Integrating CNF and BDD based SAT solvers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HLDVT ![In: Eighth IEEE International High-Level Design Validation and Test Workshop 2003, San Francisco, CA, USA, November 12-14, 2003, pp. 51-56, 2003, IEEE Computer Society, 0-7803-8236-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
18 | Ryan Williams 0001 |
On Computing k-CNF Formula Properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing, 6th International Conference, SAT 2003. Santa Margherita Ligure, Italy, May 5-8, 2003 Selected Revised Papers, pp. 330-340, 2003, Springer, 3-540-20851-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
18 | Irina Perfilieva, Vladik Kreinovich |
A new universal approximation result for fuzzy systems, which reflects CNF DNF duality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Intell. Syst. ![In: Int. J. Intell. Syst. 17(12), pp. 1121-1130, 2002. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 7, pp. 2, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
18 | Paolo Liberatore |
Redundancy in Logic I: CNF Propositional Formulae ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR cs.AI/0211031, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
18 | Paolo Liberatore |
The Complexity of Checking Redundancy of CNF Propositional Formulae. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECAI ![In: Proceedings of the 15th European Conference on Artificial Intelligence, ECAI'2002, Lyon, France, July 2002, pp. 262-266, 2002, IOS Press. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
18 | Stephan Schulz 0001 |
A Comparison of Different Techniques for Grounding Near-Propositional CNF Formulae. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FLAIRS ![In: Proceedings of the Fifteenth International Florida Artificial Intelligence Research Society Conference, May 14-16, 2002, Pensacola Beach, Florida, USA, pp. 72-76, 2002, AAAI Press, 1-57735-141-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
18 | Sven Baumer, Juan Luis Esteban, Jacobo Torán |
Minimally Unsatisfiable CNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Bull. EATCS ![In: Bull. EATCS 74, pp. 190-192, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
|
18 | Mitchell A. Harris |
Counting Satisfiable k-CNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2001, 7th International Conference, CP 2001, Paphos, Cyprus, November 26 - December 1, 2001, Proceedings, pp. 765, 2001, Springer, 3-540-42863-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
18 | El-Sayed M. El-Horbaty |
A Linear Time Parallel Algorithm for the 2-CNF Satisfiability Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Egypt. Comput. Sci. J. ![In: Egypt. Comput. Sci. J. 22(1), 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP BibTeX RDF |
|
18 | Yacine Boufkhad, Olivier Dubois 0002 |
Length of Prime Implicants and Number of Solutions of Random CNF Formulae. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 215(1-2), pp. 1-30, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
18 | Carlos Domingo, Nina Mishra, Leonard Pitt |
Efficient Read-Restricted Monotone CNF/DNF Dualization by Learning with Membership Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mach. Learn. ![In: Mach. Learn. 37(1), pp. 89-110, 1999. The full citation details ...](Pics/full.jpeg) |
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 ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR99, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP BibTeX RDF |
|
18 | Nadia Creignou, Hervé Daudé |
Satisfiability Threshold for Random XOR-CNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 96-97, pp. 41-53, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
18 | Eli Ben-Sasson, Russell Impagliazzo |
Random CNF's are Hard for the Polynomial Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 40th Annual Symposium on Foundations of Computer Science, FOCS '99, 17-18 October, 1999, New York, NY, USA, pp. 415-421, 1999, IEEE Computer Society, 0-7695-0409-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Sci. Technol. ![In: J. Comput. Sci. Technol. 13(1), pp. 9-12, 1998. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Math. Artif. Intell. ![In: Ann. Math. Artif. Intell. 23(3-4), pp. 229-245, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
18 | Geoff Sutcliffe, Christian B. Suttner |
The TPTP Problem Library - CNF Release v1.2.1. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 21(2), pp. 177-203, 1998. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, Dallas, Texas, USA, May 23-26, 1998, pp. 561-571, 1998, ACM, 0-89791-962-9. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
18 | Anavai Ramesh, George Becker, Neil V. Murray |
CNF and DNF Considered Harmful for Computing Prime Implicants/Implicates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 18(3), pp. 337-356, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
18 | Rahul Roy-Chowdhury, Mukesh Dalal |
Model-Theoretic Semantics and Tractable Algorithm for CNF-BCP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAAI/IAAI ![In: Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Applications of Artificial Intelligence Conference, AAAI 97, IAAI 97, July 27-31, 1997, Providence, Rhode Island, USA., pp. 227-232, 1997, AAAI Press / The MIT Press, 0-262-51095-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Satisfiability Problem: Theory and Applications ![In: Satisfiability Problem: Theory and Applications, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, March 11-13, 1996, pp. 669-676, 1996, DIMACS/AMS, 978-0-8218-0479-7. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
18 | Evangelos Triantaphyllou, Allen L. Soyster |
A Relationship Between CNF and DNF Systems Derivable from Examples. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFORMS J. Comput. ![In: INFORMS J. Comput. 7(3), pp. 283-285, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
18 | Raymond J. Mooney |
Encouraging Experimental Results on Learning CNF. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mach. Learn. ![In: Mach. Learn. 19(1), pp. 79-92, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
18 | Byungki Cha, Kazuo Iwama |
Performance Test of Local Search Algorithms Using New Types of Random CNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI 95, Montréal Québec, Canada, August 20-25 1995, 2 Volumes, pp. 304-311, 1995, Morgan Kaufmann. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP BibTeX RDF |
|
18 | Andrew T. Ogielski |
Minimal Samples of Positive Examples Identifying k-CNF Boolean Functions ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 113(2), pp. 220-229, September 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
18 | Harry B. Hunt III, Madhav V. Marathe, Richard Edwin Stearns |
Generalized CNF Satisfiability Problems and Non-Efficient. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCT ![In: Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28 - July 1, 1994, pp. 356-366, 1994, IEEE Computer Society, 0-8186-5670-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
18 | Robert Cowen, Katherine Wyatt |
BREAKUP: a preprocessing algorithm for satisfiability testing of CNF formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Notre Dame J. Formal Log. ![In: Notre Dame J. Formal Log. 34(4), pp. 602-606, 1993. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 25-27 January 1993, Austin, Texas, USA., pp. 322-330, 1993, ACM/SIAM, 0-89791-562-3. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
18 | Reiner Hähnle |
Short CNF in Finitely-Valued Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMIS ![In: Methodologies for Intelligent Systems, 7th International Symposium, ISMIS '93, Trondheim, Norway, June 15-18, 1993, Proceedings, pp. 49-58, 1993, Springer, 3-540-56804-2. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
18 | Shankar Vaidyanathan, S. Lakshmivarahan |
Analysis of Upper Bound in Valiant's Model for Learning Bounded CNF Expressions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 1993 ACM/SIGAPP Symposium on Applied Computing: States of the Art and Practice, SAC'93, Indianapolis, IN, USA, February 14-16, 1993, pp. 754-761, 1993, ACM, 0-89791-567-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 43(4), pp. 191-193, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
18 | David J. Haglin |
Approximating Maximum 2-CNF Satisfiability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Parallel Process. Lett. ![In: Parallel Process. Lett. 2, pp. 181-187, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
18 | Kazuo Iwama, Hidetoshi Abeta, Eiji Miyano |
Random Generation of Satisfiable and Unsatisfiable CNF Predicates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IFIP Congress (1) ![In: Algorithms, Software, Architecture - Information Processing '92, Volume 1, Proceedings of the IFIP 12th World Computer Congress, Madrid, Spain, 7-11 September 1992, pp. 322-328, 1992, North-Holland, 0-444-89747-X. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP BibTeX RDF |
|
18 | Daniel S. Hirschberg, Michael J. Pazzani |
Average Case Analysis of Learning kappa-CNF Concepts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ML ![In: Proceedings of the Ninth International Workshop on Machine Learning (ML 1992), Aberdeen, Scotland, UK, July 1-3, 1992, pp. 206-211, 1992, Morgan Kaufmann, 1-55860-247-X. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
18 | Vikraman Arvind, Somenath Biswas |
On Some Bandwidth Restricted Versions of the Satisfiability Problem of Propositional CNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 68(2), pp. 123-134, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
18 | Kazuo Iwama |
CNF Satisfiability Test by Counting and Polynomial Average Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 18(2), pp. 385-391, 1989. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 27(3), pp. 141-145, 1988. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 24(1), pp. 67-69, 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|