Search results for "Satisfiability"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
18	Allen Van Gelder	Verifying Propositional Unsatisfiability: Pitfalls to Avoid.	SAT	2007	DBLP DOI BibTeX RDF
18	Stefan Szeider	Matched Formulas and Backdoor Sets.	SAT	2007	DBLP DOI BibTeX RDF
18	Stefan Andrei, Wei-Ngan Chin, Albert Mo Kim Cheng, Mihai Lupu	Automatic Debugging of Real-Time Systems Based on Incremental Satisfiability Counting.	IEEE Trans. Computers	2006	DBLP DOI BibTeX RDF	system development tools, automatic debugging, counting SAT problem, Real-time system, formal methods, timing constraint, incremental computation
18	Loganathan Lingappan, Srivaths Ravi 0001, Niraj K. Jha	Satisfiability-based test generation for nonseparable RTL controller-datapath circuits.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2006	DBLP DOI BibTeX RDF
18	Lucas Bordeaux, Youssef Hamadi, Lintao Zhang	Propositional Satisfiability and Constraint Programming: A comparative survey.	ACM Comput. Surv.	2006	DBLP DOI BibTeX RDF	Search, constraint satisfaction, SAT
18	Mohamed El-bachir Menai, Mohamed Batouche	An effective heuristic algorithm for the maximum satisfiability problem.	Appl. Intell.	2006	DBLP DOI BibTeX RDF	MAXSAT, Bose-Einstein distribution, Problem solving, Heuristic search, Extremal Optimization
18	Margarita V. Korovina, Nicolai N. Vorobjov Jr.	Satisfiability of Viability Constraints for Pfaffian Dynamics.	Ershov Memorial Conference	2006	DBLP DOI BibTeX RDF
18	Alexander Aiken	Scalable program analysis using Boolean satisfiability.	MEMOCODE	2006	DBLP DOI BibTeX RDF
18	Roberto Bruttomesso, Alessandro Cimatti, Anders Franzén, Alberto Griggio, Roberto Sebastiani	Delayed Theory Combination vs. Nelson-Oppen for Satisfiability Modulo Theories: A Comparative Analysis.	LPAR	2006	DBLP DOI BibTeX RDF
18	Sébastien Limet, Pierre Pillot	Deciding Satisfiability of Positive Second Order Joinability Formulae.	LPAR	2006	DBLP DOI BibTeX RDF
18	Arnaud Lallouet, Andrei Legtchenko	From satisfiability to consistency through certificates: application to partially defined constraints.	SAC	2006	DBLP DOI BibTeX RDF	solver construction, decision trees, constraint satisfaction
18	HoonSang Jin, Fabio Somenzi	Strong conflict analysis for propositional satisfiability.	DATE	2006	DBLP DOI BibTeX RDF
18	Lars Schewe	Generation of Oriented Matroids Using Satisfiability Solvers.	ICMS	2006	DBLP DOI BibTeX RDF
18	Uriel Feige, Jeong Han Kim, Eran Ofek	Witnesses for non-satisfiability of dense random 3CNF formulas.	FOCS	2006	DBLP DOI BibTeX RDF
18	Andreas Björklund, Thore Husfeldt	Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings.	ICALP (1)	2006	DBLP DOI BibTeX RDF
18	Bow-Yaw Wang	On the Satisfiability of Modular Arithmetic Formulae.	ATVA	2006	DBLP DOI BibTeX RDF
18	Jinghua Groppe, Sven Groppe	Satisfiability-Test, Rewriting and Refinement of Users' XPath Queries According to XML Schema Definitions.	ADBIS	2006	DBLP DOI BibTeX RDF
18	Uriel Feige, Elchanan Mossel, Dan Vilenchik	Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
18	Sheng Liu, Jian Zhang 0001	Retrieving and Matching RDF Graphs by Solving the Satisfiability Problem.	Web Intelligence	2006	DBLP DOI BibTeX RDF
18	Uwe Bubeck, Hans Kleine Büning	Dependency Quantified Horn Formulas: Models and Complexity.	SAT	2006	DBLP DOI BibTeX RDF
18	Zhaohui Fu, Sharad Malik	On Solving the Partial MAX-SAT Problem.	SAT	2006	DBLP DOI BibTeX RDF
18	António Morgado 0001, Paulo J. Matos, Vasco M. Manquinho, João Marques-Silva 0001	Counting Models in Integer Domains.	SAT	2006	DBLP DOI BibTeX RDF
18	Ashish Sabharwal, Carlos Ansótegui, Carla P. Gomes, Justin W. Hart, Bart Selman	QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency.	SAT	2006	DBLP DOI BibTeX RDF
18	Toni Jussila, Carsten Sinz, Armin Biere	Extended Resolution Proofs for Symbolic SAT Solving with Quantification.	SAT	2006	DBLP DOI BibTeX RDF
18	Allen Van Gelder	Toward leaner binary-clause reasoning in a satisfiability solver.	Ann. Math. Artif. Intell.	2005	DBLP DOI BibTeX RDF
18	Ateet Bhalla, Inês Lynce, José T. de Sousa, João Marques-Silva 0001	Heuristic-Based Backtracking Relaxation for Propositional Satisfiability.	J. Autom. Reason.	2005	DBLP DOI BibTeX RDF
18	Prabhat Mishra 0001, Heon-Mo Koo, Zhuo Huang	Language-driven Validation of Pipelined Processors using Satisfiability Solvers.	MTV	2005	DBLP DOI BibTeX RDF
18	Zhaohui Fu, Yinlei Yu, Sharad Malik	Considering Circuit Observability Don't Cares in CNF Satisfiability.	DATE	2005	DBLP DOI BibTeX RDF
18	Levent Aksoy, Ece Olcay Günes	An Evolutionary Local Search Algorithm for the Satisfiability Problem.	TAINN	2005	DBLP DOI BibTeX RDF
18	Stephen M. Majercik	APPSSAT: Approximate Probabilistic Planning Using Stochastic Satisfiability.	ECSQARU	2005	DBLP DOI BibTeX RDF
18	A. D. Parks	The Quality of Service Satisfiability Thesis: Resource and Performance Prediction for Multi-Processor Systems and Random Schedules.	IPDPS	2005	DBLP DOI BibTeX RDF
18	Wolfgang Blochinger, W. Westje, Wolfgang Küchlin, Sebastian Wedeniwski	ZetaSAT - Boolean SATisfiability solving on Desktop Grids.	CCGRID	2005	DBLP DOI BibTeX RDF
18	Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi A. Junttila, Peter van Rossum, Stephan Schulz 0001, Roberto Sebastiani	An Incremental and Layered Procedure for the Satisfiability of Linear Arithmetic Logic.	TACAS	2005	DBLP DOI BibTeX RDF
18	Vasco M. Manquinho, João Marques-Silva 0001	Satisfiability-Based Algorithms for Pseudo-Boolean Optimization Using Gomory Cuts and Search Restarts.	ICTAI	2005	DBLP DOI BibTeX RDF
18	Stefan Andrei, Albert Mo Kim Cheng, Wei-Ngan Chin, Mihai Lupu	Systematic Debugging of Real-Time Systems based on Incremental Satisfiability Counting.	IEEE Real-Time and Embedded Technology and Applications Symposium	2005	DBLP DOI BibTeX RDF
18	Daniel Singer, Alain Vagner	Parallel Resolution of the Satisfiability Problem (SAT) with OpenMP and MPI.	PPAM	2005	DBLP DOI BibTeX RDF
18	Kairong Zhang, Masahiro Nagamatu	Solving Satisfiability Problem by Parallel Execution of Neural Networks with Biases.	ICANN (2)	2005	DBLP DOI BibTeX RDF
18	Evgeny Dantsin, Alexander Wolpert	An Improved Upper Bound for SAT.	SAT	2005	DBLP DOI BibTeX RDF
18	Vasco M. Manquinho, João Marques-Silva 0001	On Applying Cutting Planes in DLL-Based Algorithms for Pseudo-Boolean Optimization.	SAT	2005	DBLP DOI BibTeX RDF
18	Uwe Bubeck, Hans Kleine Büning, Xishun Zhao	Quantifier Rewriting and Equivalence Models for Quantified Horn Formulas.	SAT	2005	DBLP DOI BibTeX RDF
18	Nachum Dershowitz, Ziyad Hanna, Jacob Katz	Bounded Model Checking with QBF.	SAT	2005	DBLP DOI BibTeX RDF
18	Mark H. Liffiton, Karem A. Sakallah	On Finding All Minimally Unsatisfiable Subformulas.	SAT	2005	DBLP DOI BibTeX RDF
18	Tian Sang, Paul Beame, Henry A. Kautz	Heuristics for Fast Exact Model Counting.	SAT	2005	DBLP DOI BibTeX RDF
18	Magnus Wahlström	Faster Exact Solving of SAT Formulae with a Low Number of Occurrences per Variable.	SAT	2005	DBLP DOI BibTeX RDF
18	Wojciech Plandowski	Satisfiability of word equations with constants is in PSPACE.	J. ACM	2004	DBLP DOI BibTeX RDF	String unification, word equations
18	Vilhelm Dahllöf	Applications of General Exact Satisfiability in Propositional Logic Modelling.	LPAR	2004	DBLP DOI BibTeX RDF
18	HoonSang Jin, Mohammad Awedh, Fabio Somenzi	CirCUs: A Satisfiability Solver Geared towards Bounded Model Checking.	CAV	2004	DBLP DOI BibTeX RDF
18	Daniel Kroening, Joël Ouaknine, Sanjit A. Seshia, Ofer Strichman	Abstraction-Based Satisfiability Solving of Presburger Arithmetic.	CAV	2004	DBLP DOI BibTeX RDF
18	Harold S. Connamacher, Michael Molloy 0001	The Exact Satisfiability Threshold for a Potentially Intractible Random Constraint Satisfaction Problem.	FOCS	2004	DBLP DOI BibTeX RDF
18	Ruiming Li, Dian Zhou, Donglei Du	Satisfiability and integer programming as complementary tools.	ASP-DAC	2004	DBLP DOI BibTeX RDF
18	Tetsuya Iizuka, Makoto Ikeda, Kunihiro Asada	High speed layout synthesis for minimum-width CMOS logic cells via Boolean satisfiability.	ASP-DAC	2004	DBLP DOI BibTeX RDF
18	Dieter van Melkebeek, Ran Raz	A Time Lower Bound for Satisfiability.	ICALP	2004	DBLP DOI BibTeX RDF
18	Mohammed Eltayeb, Atakan Dogan, Füsun Özgüner	A Path Selection Based Algorithm for Maximizing Self-satisfiability of Requests in Real-Time Grid Applications.	Euro-Par	2004	DBLP DOI BibTeX RDF
18	Zhao Xing, Weixiong Zhang	Efficient Strategies for (Weighted) Maximum Satisfiability.	CP	2004	DBLP DOI BibTeX RDF
18	Evgeny Dantsin, Alexander Wolpert	Derandomization of Schuler's Algorithm for SAT.	SAT (Selected Papers	2004	DBLP DOI BibTeX RDF
18	Hubie Chen, Víctor Dalmau	Looking Algebraically at Tractable Quantified Boolean Formulas.	SAT (Selected Papers	2004	DBLP DOI BibTeX RDF
18	Marijn Heule, Mark Dufour, Joris E. van Zwieten, Hans van Maaren	March_eq: Implementing Additional Reasoning into an Efficient Look-Ahead SAT Solver.	SAT (Selected Papers	2004	DBLP DOI BibTeX RDF
18	Yogesh S. Mahajan, Zhaohui Fu, Sharad Malik	Zchaff2004: An Efficient SAT Solver.	SAT (Selected Papers	2004	DBLP DOI BibTeX RDF
18	Paul B. Jackson, Daniel Sheridan	Clause Form Conversions for Boolean Circuits.	SAT (Selected Papers	2004	DBLP DOI BibTeX RDF
18	Carlos Ansótegui, Felip Manyà	Mapping Problems with Finite-Domain Variables to Problems with Boolean Variables.	SAT (Selected Papers	2004	DBLP DOI BibTeX RDF
18	Alessandro Armando, Claudio Castellini, Enrico Giunchiglia, Marco Maratea	A SAT-Based Decision Procedure for the Boolean Combination of Difference Constraints.	SAT (Selected Papers	2004	DBLP DOI BibTeX RDF
18	Enrico Giunchiglia, Massimo Narizzano, Armando Tacchella	QBF Reasoning on Real-World Instances.	SAT (Selected Papers	2004	DBLP DOI BibTeX RDF
18	Hui Xu 0001, Rob A. Rutenbar, Karem A. Sakallah	sub-SAT: a formulation for relaxed Boolean satisfiability with applications in routing.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2003	DBLP DOI BibTeX RDF
18	Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Karem A. Sakallah	Solving difficult instances of Boolean satisfiability in the presence of symmetry.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2003	DBLP DOI BibTeX RDF
18	Poul Frederick Williams, Henrik Reif Andersen, Henrik Hulgaard	Satisfiability checking using Boolean Expression Diagrams.	Int. J. Softw. Tools Technol. Transf.	2003	DBLP DOI BibTeX RDF
18	João Marques-Silva 0001, Luís Guerra e Silva	Solving Satisfiability in Combinational Circuits.	IEEE Des. Test Comput.	2003	DBLP DOI BibTeX RDF
18	Habiba Drias, Amine Taibi, Sofiane Zekour	Cooperative Ant Colonies for Solving the Maximum Weighted Satisfiability Problem.	IWANN (1)	2003	DBLP DOI BibTeX RDF
18	Dimitris Achlioptas, Assaf Naor, Yuval Peres	On the Maximum Satisfiability of Random Formulas.	FOCS	2003	DBLP DOI BibTeX RDF
18	Jin-Kao Hao, Frédéric Lardeux, Frédéric Saubion	Evolutionary Computing for the Satisfiability Problem.	EvoWorkshops	2003	DBLP DOI BibTeX RDF
18	Alan M. Frieze, Michael Molloy 0001	The Satisfiability Threshold for Randomly Generated Binary Constraint Satisfaction Problems.	RANDOM-APPROX	2003	DBLP DOI BibTeX RDF
18	Inês Lynce, João Marques-Silva 0001	Probing-Based Preprocessing Techniques for Propositional Satisfiability.	ICTAI	2003	DBLP DOI BibTeX RDF
18	Ateet Bhalla, Inês Lynce, José T. de Sousa, João Marques-Silva 0001	Heuristic-Based Backtracking for Propositional Satisfiability.	EPIA	2003	DBLP DOI BibTeX RDF
18	Jan Hidders	Satisfiability of XPath Expressions.	DBPL	2003	DBLP DOI BibTeX RDF
18	Christof Löding, Philipp Rohde	Model Checking and Satisfiability for Sabotage Modal Logic.	FSTTCS	2003	DBLP DOI BibTeX RDF
18	Mehdi Baradaran Tahoori	Using satisfiability in application-dependent testing of FPGA interconnects.	DAC	2003	DBLP DOI BibTeX RDF	field-programmable gate array, interconnect
18	Oliver Kullmann	The Combinatorics of Conflicts between Clauses.	SAT	2003	DBLP DOI BibTeX RDF
18	Ryan Williams 0001	On Computing k-CNF Formula Properties.	SAT	2003	DBLP DOI BibTeX RDF
18	Sven Baumer, Rainer Schuler	Improving a Probabilistic 3-SAT Algorithm by Dynamic Search and Independent Clause Pairs.	SAT	2003	DBLP DOI BibTeX RDF
18	Ian P. Gent, Enrico Giunchiglia, Massimo Narizzano, Andrew G. D. Rowley, Armando Tacchella	Watched Data Structures for QBF Solvers.	SAT	2003	DBLP DOI BibTeX RDF
18	Stefan Szeider	On Fixed-Parameter Tractable Parameterizations of SAT.	SAT	2003	DBLP DOI BibTeX RDF
18	Daniel Le Berre, Laurent Simon	The Essentials of the SAT 2003 Competition.	SAT	2003	DBLP DOI BibTeX RDF
18	Ashish Sabharwal, Paul Beame, Henry A. Kautz	Using Problem Structure for Efficient Clause Learning.	SAT	2003	DBLP DOI BibTeX RDF
18	Christian Bessière, Emmanuel Hebrard, Toby Walsh	Local Consistencies in SAT.	SAT	2003	DBLP DOI BibTeX RDF
18	Sergio Tessaris, Ian Horrocks 0001	Abox Satisfiability Reduced to Terminological Reasoning in Expressive Description Logics.	LPAR	2002	DBLP DOI BibTeX RDF
18	Lintao Zhang, Sharad Malik	The Quest for Efficient Boolean Satisfiability Solvers.	CAV	2002	DBLP DOI BibTeX RDF
18	Michael Alekhnovich, Alexander A. Razborov	Satisfiability, Branch-Width and Tseitin Tautologies.	FOCS	2002	DBLP DOI BibTeX RDF
18	Gi-Joon Nam, Karem A. Sakallah, Rob A. Rutenbar	Hybrid Routing for FPGAs by Integrating Boolean Satisfiability with Geometric Search.	FPL	2002	DBLP DOI BibTeX RDF
18	Hui Xu 0001, Rob A. Rutenbar, Karem A. Sakallah	sub-SAT: a formulation for relaxed boolean satisfiability with applications in routing.	ISPD	2002	DBLP DOI BibTeX RDF
18	Lintao Zhang, Sharad Malik	The Quest for Efficient Boolean Satisfiability Solvers.	CADE	2002	DBLP DOI BibTeX RDF
18	Lintao Zhang, Sharad Malik	Conflict driven learning in a quantified Boolean Satisfiability solver.	ICCAD	2002	DBLP DOI BibTeX RDF
18	DoRon B. Motter, Igor L. Markov	A Compressed Breadth-First Search for Satisfiability.	ALENEX	2002	DBLP DOI BibTeX RDF
18	Linda van Norden, Hans van Maaren	A Linear Programming Based Satisfiability Solver Using a New Horn-Driven Search Tree Design.	CP	2002	DBLP DOI BibTeX RDF
18	Peter Niebert, Moez Mahfoudh, Eugene Asarin, Marius Bozga, Oded Maler, Navendu Jain	Verification of Timed Automata via Satisfiability Checking.	FTRTFT	2002	DBLP DOI BibTeX RDF
18	Abdelwaheb Ayari, David A. Basin	QUBOS: Deciding Quantified Boolean Logic Using Propositional Satisfiability Solvers.	FMCAD	2002	DBLP DOI BibTeX RDF
18	Mohamed Tounsi 0002	A Genetic-Based Approach for Satisfiability Problems.	AISC	2002	DBLP DOI BibTeX RDF	Genetic Algorithm, SAT, NP-complete Problem, Hamiltonian Circuit
18	Takayuki Suyama, Makoto Yokoo, Hiroshi Sawada, Akira Nagoya	Solving satisfiability problems using reconfigurable computing.	IEEE Trans. Very Large Scale Integr. Syst.	2001	DBLP DOI BibTeX RDF
18	Farzan Fallah, Srinivas Devadas, Kurt Keutzer	Functional vector generation for HDL models using linearprogramming and Boolean satisfiability.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2001	DBLP DOI BibTeX RDF
18	Per Bjesse, Tim Leonard, Abdel Mokkedem	Finding Bugs in an Alpha Microprocessor Using Satisfiability Solvers.	CAV	2001	DBLP DOI BibTeX RDF
18	Zoran Ognjanovic, Jozef Kratica, Milos Milovanovic	A Genetic Algorithm for Satisfiability Problem in a Probabilistic Logic: A First Report.	ECSQARU	2001	DBLP DOI BibTeX RDF
18	Cristopher Moore, Pascal Tesson, Denis Thérien	Satisfiability of Systems of Equations over Finite Monoids.	MFCS	2001	DBLP DOI BibTeX RDF