Search results for "CNF"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
18	Vikraman Arvind, Somenath Biswas	On Certain Bandwidth Restricted Versions of the Satisfaiability Problem of Propositional CNF Formulas.	FSTTCS	1987	DBLP DOI BibTeX RDF
10	Holger Dell, Dieter van Melkebeek	Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses.	STOC	2010	DBLP DOI BibTeX RDF	arithmetic progression free sets, hereditary graph properties, vertex deletion problems, satisfiability, kernelization, vertex cover, parameterized complexity, probabilistically checkable proofs, feedback vertex set, sparsification
10	Endre Boros, Kazuhisa Makino	A Fast and Simple Parallel Algorithm for the Monotone Duality Problem.	ICALP (1)	2009	DBLP DOI BibTeX RDF
10	Éric Grégoire, Bertrand Mazure, Cédric Piette	Does This Set of Clauses Overlap with at Least One MUS?	CADE	2009	DBLP DOI BibTeX RDF
10	Albert Atserias, Johannes Klaus Fichte, Marc Thurley	Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution.	SAT	2009	DBLP DOI BibTeX RDF
10	Eugene Goldberg	Boundary Points and Resolution.	SAT	2009	DBLP DOI BibTeX RDF	proof quality, resolution, SAT-solver, boundary points
10	Roberto Asín, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell	Cardinality Networks and Their Applications.	SAT	2009	DBLP DOI BibTeX RDF
10	Maria Luisa Bonet, Katherine St. John	Efficiently Calculating Evolutionary Tree Measures Using SAT.	SAT	2009	DBLP DOI BibTeX RDF
10	Yibin Chen, Sean Safarpour, Andreas G. Veneris, João Marques-Silva 0001	Spatial and temporal design debug using partial MaxSAT.	ACM Great Lakes Symposium on VLSI	2009	DBLP DOI BibTeX RDF	maximum satisfiability, design debugging
10	Stefan S. Dantchev, Barnaby Martin	Cutting Planes and the Parameter Cutwidth.	CiE	2009	DBLP DOI BibTeX RDF
10	Stefan Porschen, Tatjana Schmidt	On Some SAT-Variants over Linear Formulas.	SOFSEM	2009	DBLP DOI BibTeX RDF	not-all-equal satisfiability, exact satisfiability, linear formula, linear hypergraph, bicolorability
10	Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä	Justification-Based Local Search with Adaptive Noise Strategies.	LPAR	2008	DBLP DOI BibTeX RDF
10	Thomas Douillard, Christophe Jermann	Splitting heuristics for disjunctive numerical constraints.	SAC	2008	DBLP DOI BibTeX RDF	splitting heuristics, numerical constraints, disjunctions
10	Grant Schoenebeck	Linear Level Lasserre Lower Bounds for Certain k-CSPs.	FOCS	2008	DBLP DOI BibTeX RDF
10	Subhash Khot, Rishi Saket	Hardness of Minimizing and Learning DNF Expressions.	FOCS	2008	DBLP DOI BibTeX RDF
10	Eli Ben-Sasson, Jakob Nordström	Short Proofs May Be Spacious: An Optimal Separation of Space and Length in Resolution.	FOCS	2008	DBLP DOI BibTeX RDF
10	Christopher Lynch, Duc-Khanh Tran	SMELS: Satisfiability Modulo Equality with Lazy Superposition.	ATVA	2008	DBLP DOI BibTeX RDF
10	Daniel Raible 0001, Henning Fernau	A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach.	MFCS	2008	DBLP DOI BibTeX RDF
10	Mark H. Liffiton, Karem A. Sakallah	Searching for Autarkies to Trim Unsatisfiable Clause Sets.	SAT	2008	DBLP DOI BibTeX RDF
10	Hans van Maaren, Siert Wieringa	Finding Guaranteed MUSes Fast.	SAT	2008	DBLP DOI BibTeX RDF
10	Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol	New Results on the Phase Transition for Random Quantified Boolean Formulas.	SAT	2008	DBLP DOI BibTeX RDF
10	Tobias Eibach, Enrico Pilz, Gunnar Völkel	Attacking Bivium Using SAT Solvers.	SAT	2008	DBLP DOI BibTeX RDF	Rsat, Bivium, Gröbner Base, Cryptography, Application, Stream Cipher, BDD, SAT Solver, eSTREAM, Trivium
10	Kazuo Iwama	SAT, UNSAT and Coloring.	SAT	2008	DBLP DOI BibTeX RDF
10	Jonathan Katz, Amit Sahai, Brent Waters	Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products.	EUROCRYPT	2008	DBLP DOI BibTeX RDF
10	Richard Ostrowski, Lionel Paris	From XSAT to SAT by Exhibiting Equivalencies.	ICTAI (1)	2008	DBLP DOI BibTeX RDF
10	Fabrício Vivas Andrade, Leandro Maia Silva, Antônio Otávio Fernandes	Improving SAT-based Combinational Equivalence Checking through circuit preprocessing.	ICCD	2008	DBLP DOI BibTeX RDF
10	Armin Biere, Robert Brummayer	Consistency Checking of All Different Constraints over Bit-Vectors within a SAT Solver.	FMCAD	2008	DBLP DOI BibTeX RDF
10	Eugene Goldberg	On Bridging Simulation and Formal Verification.	VMCAI	2008	DBLP DOI BibTeX RDF
10	Loganathan Lingappan, Niraj K. Jha	Satisfiability-Based Automatic Test Program Generation and Design for Testability for Microprocessors.	IEEE Trans. Very Large Scale Integr. Syst.	2007	DBLP DOI BibTeX RDF
10	Stefan Porschen	On variable-weighted exact satisfiability problems.	Ann. Math. Artif. Intell.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classifications (2000) 03B05, 68Q25, 05C85
10	Marko Samer, Stefan Szeider	Algorithms for Propositional Model Counting.	LPAR	2007	DBLP DOI BibTeX RDF
10	Panagiotis Manolios, Sudarshan K. Srinivasan, Daron Vroon 0001	BAT: The Bit-Level Analysis Tool.	CAV	2007	DBLP DOI BibTeX RDF
10	Subhash Khot, Assaf Naor	Linear Equations Modulo 2 and the L1 Diameter of Convex Bodies.	FOCS	2007	DBLP DOI BibTeX RDF
10	Stefan S. Dantchev, Barnaby Martin, Stefan Szeider	Parameterized Proof Complexity.	FOCS	2007	DBLP DOI BibTeX RDF
10	Chih-Cheng Tseng, Kwang-Cheng Chen	A Clustering Algorithm to Produce Power-Efficient Architecture for (N, B)-Connected Ad Hoc Networks.	ICC	2007	DBLP DOI BibTeX RDF
10	Roy Armoni, Limor Fix, Ranan Fraer, Tamir Heyman, Moshe Y. Vardi, Yakir Vizel, Yael Zbar	Deeper Bound in BMC by Combining Constant Propagation and Abstraction.	ASP-DAC	2007	DBLP DOI BibTeX RDF
10	Nachum Dershowitz, Iddo Tzameret	Complexity of Propositional Proofs Under a Promise.	ICALP	2007	DBLP DOI BibTeX RDF	random 3CNF, promise problems, resolution, proof complexity
10	Lionel Paris, Richard Ostrowski, Pierre Siegel, Lakhdar Sais	From Horn Strong Backdoor Sets to Ordered Strong Backdoor Sets.	MICAI	2007	DBLP DOI BibTeX RDF
10	Alexander S. Kulikov, Konstantin Kutzkov	New Bounds for MAX-SAT by Clause Learning.	CSR	2007	DBLP DOI BibTeX RDF
10	Ehsan Amiri, Evgeny S. Skvortsov	Pushing Random Walk Beyond Golden Ratio.	CSR	2007	DBLP DOI BibTeX RDF
10	Uwe Bubeck, Hans Kleine Büning	Bounded Universal Expansion for Preprocessing QBF.	SAT	2007	DBLP DOI BibTeX RDF
10	Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà	Mapping CSP into Many-Valued SAT.	SAT	2007	DBLP DOI BibTeX RDF
10	Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto 0001	On the Boolean Connectivity Problem for Horn Relations.	SAT	2007	DBLP DOI BibTeX RDF
10	Stefan Porschen, Ewald Speckenmeyer	Algorithms for Variable-Weighted 2-SAT and Dual Problems.	SAT	2007	DBLP DOI BibTeX RDF	weighted satisfiability, edge cover, graph factor, NP-hardness, optimization problem, perfect matching
10	Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy, Felip Manyà	A Complete Resolution Calculus for Signed Max-SAT.	ISMVL	2007	DBLP DOI BibTeX RDF
10	Witold Charatonik, Michal Wrona	2-SAT Problems in Some Multi-Valued Logics Based on Finite Lattices.	ISMVL	2007	DBLP DOI BibTeX RDF
10	Alexander A. Sherstov	Separating AC0 from depth-2 majority circuits.	STOC	2007	DBLP DOI BibTeX RDF	AC0, communication complexity, discrepancy, threshold circuits
10	Shirley Halevy, Oded Lachish, Ilan Newman, Dekel Tsur	Testing Properties of Constraint-Graphs.	CCC	2007	DBLP DOI BibTeX RDF
10	Martin Fürer, Shiva Prasad Kasiviswanathan	Algorithms for Counting 2-SatSolutions and Colorings with Applications.	AAIM	2007	DBLP DOI BibTeX RDF
10	Pavel Surynek	Solving Difficult SAT Instances Using Greedy Clique Decomposition.	SARA	2007	DBLP DOI BibTeX RDF	difficult instances, search, consistency, SAT, clique
10	Matthias Krause 0001	On the computational power of Boolean decision lists.	Comput. Complex.	2006	DBLP DOI BibTeX RDF	94C05, Subject classification. 68Q15, 06E30, 94C10
10	Josep Argelich, Felip Manyà	Exact Max-SAT solvers for over-constrained problems.	J. Heuristics	2006	DBLP DOI BibTeX RDF	Soft constraints, Solvers, Max-SAT
10	Olivier Bailleux, Pierre Marquis	Some Computational Aspects of distance-sat.	J. Autom. Reason.	2006	DBLP DOI BibTeX RDF	computational complexity, satisfiability
10	Warren A. Hunt Jr., Erik Reeber	A SAT-based procedure for verifying finite state machines in ACL2.	ACL2	2006	DBLP DOI BibTeX RDF	satisfiability solving, theorem proving, hardware verification, ACL2
10	Romanelli Lodron Zuim, José T. de Sousa, Claudionor José Nunes Coelho Jr.	A Fast SAT Solver Strategy Based on Negated Clauses.	VLSI-SoC	2006	DBLP DOI BibTeX RDF
10	Ping Gong 0004, Daoyun Xu	A New Lower Bound of Critical Function for (k, s)-SAT.	TAMC	2006	DBLP DOI BibTeX RDF
10	Leslie G. Valiant	Accidental Algorithms.	FOCS	2006	DBLP DOI BibTeX RDF
10	Yael Tauman Kalai, Ran Raz	Succinct Non-Interactive Zero-Knowledge Proofs with Preprocessing for LOGSNP.	FOCS	2006	DBLP DOI BibTeX RDF
10	Maria Luisa Bonet, Jordi Levy, Felip Manyà	A Complete Calculus for Max-SAT.	SAT	2006	DBLP DOI BibTeX RDF
10	Yuliya Zabiyaka, Adnan Darwiche	Functional Treewidth: Bounding Complexity in the Presence of Functional Dependencies.	SAT	2006	DBLP DOI BibTeX RDF
10	Himanshu Jain, Constantinos Bartzis, Edmund M. Clarke	Satisfiability Checking of Non-clausal Formulas Using General Matings.	SAT	2006	DBLP DOI BibTeX RDF
10	Hans Kleine Büning, Xishun Zhao	Minimal False Quantified Boolean Formulas.	SAT	2006	DBLP DOI BibTeX RDF
10	Naomi Nishimura, Prabhakar Ragde, Stefan Szeider	Solving #SAT Using Vertex Covers.	SAT	2006	DBLP DOI BibTeX RDF
10	Ilya Mironov, Lintao Zhang	Applications of SAT Solvers to Cryptanalysis of Hash Functions.	SAT	2006	DBLP DOI BibTeX RDF
10	Panagiotis Manolios, Yimin Zhang	Implementing Survey Propagation on Graphics Processing Units.	SAT	2006	DBLP DOI BibTeX RDF
10	Toni Jussila, Carsten Sinz, Armin Biere	Extended Resolution Proofs for Symbolic SAT Solving with Quantification.	SAT	2006	DBLP DOI BibTeX RDF
10	Stefan Porschen	Counting All Solutions of Minimum Weight Exact Satisfiability.	CIAC	2006	DBLP DOI BibTeX RDF	Minimum weight exact satisfiability, minimum weight set partition, counting problem, maximum weight independent set
10	Alan Mishchenko, Satrajit Chatterjee, Robert K. Brayton, Niklas Eén	Improvements to combinational equivalence checking.	ICCAD	2006	DBLP DOI BibTeX RDF
10	Sharon Barner, Cindy Eisner, Ziv Glazberg, Daniel Kroening, Ishai Rabinovitz	ExpliSAT: Guiding SAT-Based Software Verification with Explicit States.	Haifa Verification Conference	2006	DBLP DOI BibTeX RDF
10	Lionel Paris, Belaid Benhamou, Pierre Siegel	A Boolean Encoding Including SAT and n-ary CSPs.	AIMSA	2006	DBLP DOI BibTeX RDF	Logic and constraint programming, Automated reasoning, Knowledge representation and reasoning
10	Raihan H. Kibria, You Li	Optimizing the Initialization of Dynamic Decision Heuristics in DPLL SAT Solvers Using Genetic Programming.	EuroGP	2006	DBLP DOI BibTeX RDF
10	Ulrich Rückert 0002, Stefan Kramer 0001	A statistical approach to rule learning.	ICML	2006	DBLP DOI BibTeX RDF
10	Marco Cadoli, Thomas Eiter, Georg Gottlob	Complexity of propositional nested circumscription and nested abnormality theories.	ACM Trans. Comput. Log.	2005	DBLP DOI BibTeX RDF	Horn theories, nested abnormality theories, computational complexity, nonmonotonic reasoning, knowledge representation and reasoning, Circumscription
10	Xiaowei Li 0001, Guanghui Li 0001, Ming Shao	Formal Verification Techniques Based on Boolean Satisfiability Problem.	J. Comput. Sci. Technol.	2005	DBLP DOI BibTeX RDF	incremental satisfiability, minimal unsatisfiable formula, model checking, equivalence checking
10	DoRon B. Motter, Jarrod A. Roy, Igor L. Markov	Resolution cannot polynomially simulate compressed-BFS.	Ann. Math. Artif. Intell.	2005	DBLP DOI BibTeX RDF
10	Hans Kleine Büning, Xishun Zhao	Extension and equivalence problems for clause minimal formulae.	Ann. Math. Artif. Intell.	2005	DBLP DOI BibTeX RDF	clause minimal formulas, extension problem, complexity, equivalence problem
10	Renato Bruni	On exact selection of minimally unsatisfiable subformulae.	Ann. Math. Artif. Intell.	2005	DBLP DOI BibTeX RDF	infeasibility analysis, MUS selection, (Un)Satisfiability
10	Fabian Breg, Constantine D. Polychronopoulos	Computational network federations: a middleware architecture for network-based computing.	IEEE J. Sel. Areas Commun.	2005	DBLP DOI BibTeX RDF
10	Masaki Yamamoto 0001	An Improved O(1.234m)-Time Deterministic Algorithm for SAT.	ISAAC	2005	DBLP DOI BibTeX RDF
10	Stefan Porschen	Solving Minimum Weight Exact Satisfiability in Time O(20.2441n).	ISAAC	2005	DBLP DOI BibTeX RDF	minimum weight exact satisfiability, branching tree, minimum perfect matching, NP-completeness, exact algorithm
10	Allen Van Gelder	Pool Resolution and Its Relation to Regular Resolution and DPLL with Clause Learning.	LPAR	2005	DBLP DOI BibTeX RDF
10	Hossein M. Sheini, Karem A. Sakallah	Pueblo: A Modern Pseudo-Boolean SAT Solver.	DATE	2005	DBLP DOI BibTeX RDF
10	Ronald Cramer, Ivan Damgård, Yuval Ishai	Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation.	TCC	2005	DBLP DOI BibTeX RDF
10	Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Karem A. Sakallah	Dynamic symmetry-breaking for improved Boolean optimization.	ASP-DAC	2005	DBLP DOI BibTeX RDF
10	Magnus Wahlström	An Algorithm for the SAT Problem for Formulae of Linear Length.	ESA	2005	DBLP DOI BibTeX RDF
10	Emmanuel Zarpas	Benchmarking SAT Solvers for Bounded Model Checking.	SAT	2005	DBLP DOI BibTeX RDF
10	Mark H. Liffiton, Karem A. Sakallah	On Finding All Minimally Unsatisfiable Subformulas.	SAT	2005	DBLP DOI BibTeX RDF
10	Wei Wei 0040, Bart Selman	A New Approach to Model Counting.	SAT	2005	DBLP DOI BibTeX RDF
10	Marijn Heule, Hans van Maaren	Observed Lower Bounds for Random 3-SAT Phase Transition Density Using Linear Programming.	SAT	2005	DBLP DOI BibTeX RDF
10	Magnus Wahlström	Faster Exact Solving of SAT Formulae with a Low Number of Occurrences per Variable.	SAT	2005	DBLP DOI BibTeX RDF
10	HoonSang Jin, HyoJung Han, Fabio Somenzi	Efficient Conflict Analysis for Finding All Satisfying Assignments of a Boolean Circuit.	TACAS	2005	DBLP DOI BibTeX RDF
10	Honglei Zeng, Sheila A. McIlraith	The Role of Redundant Clauses in Solving Satisfiability Problems.	CP	2005	DBLP DOI BibTeX RDF
10	Kristal T. Pollack, Scott A. Brandt	Efficient Access Control for Distributed Hierarchical File Systems.	MSST	2005	DBLP DOI BibTeX RDF
10	Mohamed El-bachir Menai	A Two-Phase Backbone-Based Search Heuristic for Partial MAX-SAT - An Initial Investigation.	IEA/AIE	2005	DBLP DOI BibTeX RDF
10	Rémi Monasson	A Generating Function Method for the Average-Case Analysis of DPLL.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
10	Mohamed El-bachir Menai, Mohamed Batouche	A Backbone-Based Co-evolutionary Heuristic for Partial MAX-SAT.	Artificial Evolution	2005	DBLP DOI BibTeX RDF
10	Kameshwar Chandrasekar, Michael S. Hsiao	Q-PREZ: QBF Evaluation Using Partition, Resolution and Elimination with ZBDDs.	VLSI Design	2005	DBLP DOI BibTeX RDF
10	Qingshuang Jiang, Syed Sibte Raza Abidi	From Clusters to Rules: A Hybrid Framework for Generalized Symbolic Rule Induction.	ICMLC	2005	DBLP DOI BibTeX RDF
10	Gi-Joon Nam, Fadi A. Aloul, Karem A. Sakallah, Rob A. Rutenbar	A Comparative Study of Two Boolean Formulations of FPGA Detailed Routing Constraints.	IEEE Trans. Computers	2004	DBLP DOI BibTeX RDF
10	Vilhelm Dahllöf	Applications of General Exact Satisfiability in Propositional Logic Modelling.	LPAR	2004	DBLP DOI BibTeX RDF