Search results for "Satisfiability"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
34	Yuichi Asahiro, Kazuo Iwama, Eiji Miyano	Random generation of test instances with controlled attributes.	Cliques, Coloring, and Satisfiability	1993	DBLP DOI BibTeX RDF
34	Olivier Dubois 0002, Pascal André, Yacine Boufkhad, Jacques Carlier	SAT versus UNSAT.	Cliques, Coloring, and Satisfiability	1993	DBLP DOI BibTeX RDF
34	Gary Lewandowski, Anne Condon	Experiments with parallel graph coloring heuristics and applications of graph coloring.	Cliques, Coloring, and Satisfiability	1993	DBLP DOI BibTeX RDF
34	Egon Balas, Sebastián Ceria, Gérard Cornuéjols, Gábor Pataki	Polyhedral methods for the maximum clique problem.	Cliques, Coloring, and Satisfiability	1993	DBLP DOI BibTeX RDF
31	Stefan Göller	On the Complexity of Reasoning About Dynamic Policies.	CSL	2007	DBLP DOI BibTeX RDF
31	Erika Ábrahám, Bernd Becker 0001, Felix Klaedtke, Martin Steffen	Optimizing Bounded Model Checking for Linear Hybrid Systems.	VMCAI	2005	DBLP DOI BibTeX RDF
31	Chang Xu 0001, Shing-Chi Cheung, Xiangye Xiao	Semantic Interpretation and Matching of Web Services.	ER	2004	DBLP DOI BibTeX RDF
31	Witold Charatonik, Jean-Marc Talbot	Atomic Set Constraints with Projection.	RTA	2002	DBLP DOI BibTeX RDF
31	Edith Hemaspaandra	The Complexity of Poor Man's Logic.	STACS	2000	DBLP DOI BibTeX RDF
31	Charles G. Nelson, Derek C. Oppen	A Simplifier Based on Efficient Decision Algorithms.	POPL	1978	DBLP DOI BibTeX RDF
31	Volker Weber	On the Complexity of Branching-Time Logics.	CSL	2009	DBLP DOI BibTeX RDF	complexity of satisfiability, pebble automata, alternating tree automata, forgettable past, CTL, branching-time logic
31	Petr Cintula	Two notions of compactness in Gödel logics.	Stud Logica	2005	DBLP DOI BibTeX RDF	Gödel logic, Logic, Satisfiability, Compactness, Entailment
31	Will Marrero	Using BDDs to Decide CTL.	TACAS	2005	DBLP DOI BibTeX RDF	validity, satisfiability, BDDs, CTL, tableau
31	Alon Y. Halevy, Inderpal Singh Mumick, Yehoshua Sagiv, Oded Shmueli	Static analysis in datalog extensions.	J. ACM	2001	DBLP DOI BibTeX RDF	query satisfiability, Abstract interpretation, datalog, query containment
31	Witold Charatonik, Andreas Podelski	Set Constraints with Intersection.	LICS	1997	DBLP DOI BibTeX RDF	satisfiability test, set-based program analysis, DEXPTIME-complete, complexity characterization, negative set constraints, negated conjuncts, negated inclusion, computability, decidability, intersection, inclusions, set constraints
31	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
31	Mohamed Qasem, Adam Prügel-Bennett	Complexity of Max-SAT using stochastic algorithms.	GECCO	2008	DBLP DOI BibTeX RDF	hill-climbing., satisfiability, phase transition, maximum satisfiability
30	Leonardo Mendonça de Moura, Nikolaj S. Bjørner	Satisfiability Modulo Theories: An Appetizer.	SBMF	2009	DBLP DOI BibTeX RDF
30	Valentin Goranko, Dmitry Shkatov	Tableau-Based Procedure for Deciding Satisfiability in the Full Coalitional Multiagent Epistemic Logic.	LFCS	2009	DBLP DOI BibTeX RDF
30	João Marques-Silva 0001, Jordi Planes	Algorithms for Maximum Satisfiability using Unsatisfiable Cores.	DATE	2008	DBLP DOI BibTeX RDF
30	Lynn Stevenson, Katarina Britz, Tertia Hörne	KT and S4 Satisfiability in a Constraint Logic Environment.	PRICAI	2008	DBLP DOI BibTeX RDF
30	Stefan Porschen	On variable-weighted exact satisfiability problems.	Ann. Math. Artif. Intell.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classifications (2000) 03B05, 68Q25, 05C85
30	Michael Bauland, Thomas Schneider 0002, Henning Schnoor, Ilka Schnoor, Heribert Vollmer	The Complexity of Generalized Satisfiability for Linear Temporal Logic.	FoSSaCS	2007	DBLP DOI BibTeX RDF	computational complexity, linear temporal logic
30	Stefan Andrei, Gabriel Manolache, Roland H. C. Yap, Victor Felea	Approximate Satisfiability Counting.	SYNASC	2007	DBLP DOI BibTeX RDF
30	Vittorio Bilò	On Satisfiability Games and the Power of Congestion Games.	AAIM	2007	DBLP DOI BibTeX RDF
30	Igor Gammer, Eyal Amir	Solving Satisfiability in Ground Logic with Equality by Efficient Conversion to Propositional Logic.	SARA	2007	DBLP DOI BibTeX RDF
30	Gilles Audemard, Lakhdar Sais	Circuit Based Encoding of CNF Formula.	SAT	2007	DBLP DOI BibTeX RDF
30	Martin Davis	SAT: Past and Future.	SAT	2007	DBLP DOI BibTeX RDF
30	Sebastian Bala	Complexity of Regular Language Matching and Other Decidable Cases of the Satisfiability Problem for Constraints Between Regular Open Terms.	Theory Comput. Syst.	2006	DBLP DOI BibTeX RDF
30	Jinghua Groppe, Sven Groppe	A Prototype of a Schema-Based XPath Satisfiability Tester.	DEXA	2006	DBLP DOI BibTeX RDF
30	Michael Bauland, Edith Hemaspaandra, Henning Schnoor, Ilka Schnoor	Generalized Modal Satisfiability.	STACS	2006	DBLP DOI BibTeX RDF	computational complexity, modal logic
30	Daijue Tang, Sharad Malik	Solving Quantified Boolean Formulas with Circuit Observability Don't Cares.	SAT	2006	DBLP DOI BibTeX RDF
30	Clark W. Barrett, Leonardo Mendonça de Moura, Aaron Stump	SMT-COMP: Satisfiability Modulo Theories Competition.	CAV	2005	DBLP DOI BibTeX RDF
30	Joachim Niehren, Tim Priesnitz, Zhendong Su 0001	Complexity of Subtype Satisfiability over Posets.	ESOP	2005	DBLP DOI BibTeX RDF
30	Paul Gastin, Dietrich Kuske	Uniform Satisfiability Problem for Local Temporal Logics over Mazurkiewicz Traces.	CONCUR	2005	DBLP DOI BibTeX RDF
30	Moayad Fahim Ali, Andreas G. Veneris, Sean Safarpour, Magdy S. Abadir, Rolf Drechsler, Alexander Smith 0001	Debugging Sequential Circuits Using Boolean Satisfiability.	MTV	2004	DBLP DOI BibTeX RDF
30	Moayad Fahim Ali, Andreas G. Veneris, Alexander Smith 0001, Sean Safarpour, Rolf Drechsler, Magdy S. Abadir	Debugging sequential circuits using Boolean satisfiability.	ICCAD	2004	DBLP DOI BibTeX RDF
30	Bernhard Schwarz	The Complexity of Satisfiability Problems over Finite Lattices.	STACS	2004	DBLP DOI BibTeX RDF
30	Daniel Le Berre, Laurent Simon, Armando Tacchella	Challenges in the QBF Arena: the SAT'03 Evaluation of QBF Solvers.	SAT	2003	DBLP DOI BibTeX RDF
30	Victor V. Toporkov	Satisfiability of Dataflow Models of Distributed Programs.	Program. Comput. Softw.	2001	DBLP DOI BibTeX RDF
30	Lefteris M. Kirousis, Phokion G. Kolaitis	The Complexity of Minimal Satisfiability Problems.	STACS	2001	DBLP DOI BibTeX RDF
30	Alon Y. Levy, Inderpal Singh Mumick, Yehoshua Sagiv, Oded Shmueli	Equivalence, Query-Reachability, and Satisfiability in Datalog Extensions.	PODS	1993	DBLP DOI BibTeX RDF	Datalog
30	Allen Van Gelder	A Satisfiability Tester for Non-Clausal Propositional Calculus.	CADE	1984	DBLP DOI BibTeX RDF
30	Anthony Monnet, Roger Villemaire	Scalable formula decomposition for propositional satisfiability.	C3S2E	2010	DBLP DOI BibTeX RDF	scalability, SAT, tree decomposition, propositional satisfiability, DPLL
30	Kanupriya Gulati, Sunil P. Khatri	Boolean satisfiability on a graphics processor.	ACM Great Lakes Symposium on VLSI	2010	DBLP DOI BibTeX RDF	survey propagation, gpgpu, boolean satisfiability
30	Ramamohan Paturi, Pavel Pudlák	On the complexity of circuit satisfiability.	STOC	2010	DBLP DOI BibTeX RDF	NP-completeness, circuit satisfiability
30	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
30	Ashish Sabharwal	SymChaff: exploiting symmetry in a structure-aware satisfiability solver.	Constraints An Int. J.	2009	DBLP DOI BibTeX RDF	SymChaff, Complete multi-class symmetry, Global symmetry, High-level representation, Planning, SAT, Boolean satisfiability
30	Juan Frausto Solís, Felix Martinez-Rios	Golden Ratio Annealing for Satisfiability Problems Using Dynamically Cooling Schemes.	ISMIS	2008	DBLP DOI BibTeX RDF	Golden Ratio, Simulated Annealing, Satisfiability Problem
30	Pascal Vander-Swalmen, Gilles Dequen, Michaël Krajecki	On Multi-threaded Satisfiability Solving with OpenMP.	IWOMP	2008	DBLP DOI BibTeX RDF	collaborative, parallel, combinatorial optimization, satisfiability, OpenMP, dll
30	Yichen Xie 0001, Alex Aiken	Saturn: A scalable framework for error detection using Boolean satisfiability.	ACM Trans. Program. Lang. Syst.	2007	DBLP DOI BibTeX RDF	Program analysis, error detection, Boolean satisfiability
30	Azzam Maraee, Mira Balaban	Efficient Reasoning About Finite Satisfiability of UML Class Diagrams with Constrained Generalization Sets.	ECMDA-FA	2007	DBLP DOI BibTeX RDF	finite satisfiability, reasoning about class diagram, generalization set constraints, class hierarchy structure, consistency, UML class diagram, cardinality constraints
30	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
30	Fadi A. Aloul, Karem A. Sakallah, Igor L. Markov	Efficient Symmetry Breaking for Boolean Satisfiability.	IEEE Trans. Computers	2006	DBLP DOI BibTeX RDF	clause learning, satisfiability (SAT), symmetries, conjunctive normal form (CNF), Backtrack Search, graph automorphism
30	Enrico Giunchiglia, Yuliya Lierler, Marco Maratea	Answer Set Programming Based on Propositional Satisfiability.	J. Autom. Reason.	2006	DBLP DOI BibTeX RDF	answer set programming, propositional satisfiability
30	Jin S. Zhang, Alan Mishchenko, Robert K. Brayton, Malgorzata Chrzanowska-Jeske	Symmetry detection for large Boolean functions using circuit representation, simulation, and satisfiability.	DAC	2006	DBLP DOI BibTeX RDF	and-inverter graphs, classical symmetries, simulation, boolean functions, boolean satisfiability
30	Stefan Porschen, Ewald Speckenmeyer, Bert Randerath	On Linear CNF Formulas.	SAT	2006	DBLP DOI BibTeX RDF	linear CNF formula, edge colouring, linear hypergraph, NP-completeness, satisfiability, latin square
30	Stefan Porschen, Bert Randerath, Ewald Speckenmeyer	Exact 3-satisfiability is decidable in time O(20.16254n).	Ann. Math. Artif. Intell.	2005	DBLP DOI BibTeX RDF	exact satisfiability, autonomous clause pattern, formula graph, NP-completeness, perfect matching
30	Clark W. Barrett, Leonardo Mendonça de Moura, Aaron Stump	Design and Results of the First Satisfiability Modulo Theories Competition (SMT-COMP 2005).	J. Autom. Reason.	2005	DBLP DOI BibTeX RDF	competition, decision procedures, satisfiability modulo theories
30	Yichen Xie 0001, Alexander Aiken	Scalable error detection using boolean satisfiability.	POPL	2005	DBLP DOI BibTeX RDF	program analysis, error detection, boolean satisfiability
30	Vasco M. Manquinho, João P. Marques Silva	Satisfiability-Based Algorithms for Boolean Optimization.	Ann. Math. Artif. Intell.	2004	DBLP DOI BibTeX RDF	binate covering problem, non-chronological backtracking, branch-and-bound, backtrack search, propositional satisfiability
30	William N. N. Hung, Xiaoyu Song, El Mostapha Aboulhamid, Andrew A. Kennings, Alan J. Coppola	Segmented channel routability via satisfiability.	ACM Trans. Design Autom. Electr. Syst.	2004	DBLP DOI BibTeX RDF	Satisfiability
30	Kairong Zhang, Masahiro Nagamatu	Mixed Parallel Execution of Algorithms for Satisfiability Problem.	Intelligent Information Processing	2004	DBLP DOI BibTeX RDF	neural network, parallel execution, Satisfiability problem, Lagrangian method
30	Hans Kleine Büning, Xishun Zhao	Equivalence Models for Quantified Boolean Formulas.	SAT (Selected Papers	2004	DBLP DOI BibTeX RDF	equivalence model, model checking, complexity, satisfiability, equivalence, Quantified Boolean formula
30	Hans van Maaren, Linda van Norden	Hidden Threshold Phenomena for Fixed-Density SAT-formulae.	SAT	2003	DBLP DOI BibTeX RDF	Horn, graph-3-coloring, satisfiability, thresholds, 3-SAT
30	Edward A. Hirsch, Arist Kojevnikov	Solving Boolean Satisfiability Using Local Search Guided by Unit Clause Elimination.	CP	2001	DBLP DOI BibTeX RDF	local search, empirical evaluation, Boolean satisfiability
30	Emil Gizdarski, Hideo Fujiwara	Spirit: satisfiability problem implementation for redundancy identification and test generation.	Asian Test Symposium	2000	DBLP DOI BibTeX RDF	Boolean satisfiability method, SPIRIT, ATPG system, logic testing, computability, automatic test pattern generation, combinational circuits, combinational circuits, test pattern generation, test sets
30	Carlos Areces, Wiet Bouma, Maarten de Rijke	Feature Interaction as a Satisfiability Problem.	MASCOTS	1999	DBLP DOI BibTeX RDF	Satisfiability, Description Logics, Feature Interaction, Automated Deduction
30	Habiba Drias	Randomness in Heuristics: An Experimental Investigation for the Maximum Satisfiability Problem.	IWANN (1)	1999	DBLP DOI BibTeX RDF	genetic algorithm, heuristics, local search, randomness, tabu search, maximum satisfiability
30	João Marques-Silva 0001, Thomas Glass	Combinational Equivalence Checking Using Satisfiability and Recursive Learning.	DATE	1999	DBLP DOI BibTeX RDF	Boolean Satisfiability, Recursive Learning, Combinational Equivalence Checking
30	Matthias Ringe, Thomas Lindenkreuz, Erich Barke	Path Verification Using Boolean Satisfiability.	DATE	1998	DBLP DOI BibTeX RDF	False Path Problem, Dynamic Esperance, Satisfiability, Static Timing Analysis
30	Vasco M. Manquinho, Paulo F. Flores, João P. Marques Silva, Arlindo L. Oliveira	Prime Implicant Computation Using Satisfiability Algorithms.	ICTAI	1997	DBLP DOI BibTeX RDF	Integer Programming Algorithms, Propositional Satisfiability Algorithms, Backtrack Search Strategies, Prime Implicants
30	João P. Marques Silva, Karem A. Sakallah	GRASP - a new search algorithm for satisfiability.	ICCAD	1996	DBLP DOI BibTeX RDF	Non-chronological Backtracking, Automatic Test Pattern Generation, Backtracking, Search Algorithms, Propositional Satisfiability, Electronic Design Automation
30	Masahiro Nagamatu, Torao Yanaru	Lagrangian Method for Satisfiability Problems of Propositional Calculus.	ANNES	1995	DBLP DOI BibTeX RDF	neural network, stability, satisfiability problem, Lagrangian method, propositional calculus
29	Moshe Y. Vardi	Symbolic Techniques in Propositional Satisfiability Solving.	SAT	2009	DBLP DOI BibTeX RDF
29	Hyondeuk Kim, Fabio Somenzi, HoonSang Jin	Efficient Term-ITE Conversion for Satisfiability Modulo Theories.	SAT	2009	DBLP DOI BibTeX RDF
29	Maarten Mariën, Johan Wittocx, Marc Denecker, Maurice Bruynooghe	SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions.	SAT	2008	DBLP DOI BibTeX RDF
29	Zbigniew Stachniak, Anton Belov	Speeding-Up Non-clausal Local Search for Propositional Satisfiability with Clause Learning.	SAT	2008	DBLP DOI BibTeX RDF
29	Fadi A. Aloul, Nagarajan Kandasamy	Sensor Deployment for Failure Diagnosis in Networked Aerial Robots: A Satisfiability-Based Approach.	SAT	2007	DBLP DOI BibTeX RDF	0-1 ILP, UAV networks, distributed systems, fault diagnosis, SAT
29	Eric I. Hsu, Sheila A. McIlraith	Characterizing Propagation Methods for Boolean Satisfiability.	SAT	2006	DBLP DOI BibTeX RDF
29	Andrew C. Ling, Deshanand P. Singh, Stephen Dean Brown	FPGA Logic Synthesis Using Quantified Boolean Satisfiability.	SAT	2005	DBLP DOI BibTeX RDF
29	Ravi Gummadi, N. S. Narayanaswamy, Venkatakrishnan Ramaswamy	Algorithms for Satisfiability Using Independent Sets of Variables.	SAT (Selected Papers	2004	DBLP DOI BibTeX RDF
29	HoonSang Jin, Fabio Somenzi	CirCUs: A Hybrid Satisfiability Solver.	SAT (Selected Papers	2004	DBLP DOI BibTeX RDF
29	Stefan Porschen, Bert Randerath, Ewald Speckenmeyer	Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems.	SAT	2003	DBLP DOI BibTeX RDF
29	Guilhem Semerjian, Rémi Monasson	A Study of Pure Random Walk on Random Satisfiability Problems with "Physical" Methods.	SAT	2003	DBLP DOI BibTeX RDF
25	Kord Eickmeyer, Martin Grohe, Magdalena Grüber	Approximation of Natural W[P]-Complete Minimisation Problems Is Hard.	CCC	2008	DBLP DOI BibTeX RDF	derandomisation, parameterized complexity, inapproximability
25	Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, Daniele Zucchelli	Decision procedures for extensions of the theory of arrays.	Ann. Math. Artif. Intell.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classifications (2000) 68T27, 03B25, 03B70, 68T15
25	Maria Paola Bonacina, Mnacho Echenim	T-Decision by Decomposition.	CADE	2007	DBLP DOI BibTeX RDF
25	Stefan Andrei, Wei-Ngan Chin, Martin C. Rinard	Incremental Deterministic Planning.	SYNASC	2006	DBLP DOI BibTeX RDF
25	Aaron R. Bradley, Zohar Manna, Henny B. Sipma	What's Decidable About Arrays?	VMCAI	2006	DBLP DOI BibTeX RDF
25	Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir	Guarded Open Answer Set Programming with Generalized Literals.	FoIKS	2006	DBLP DOI BibTeX RDF
25	Stefan S. Dantchev, Frank D. Valencia	On the computational limits of infinite satisfaction.	SAC	2005	DBLP DOI BibTeX RDF	infinite CSP, open CSP, decidability, constraint satisfaction problems
25	Víctor Dalmau, Daniel K. Ford	Generalized Satisfability with Limited Occurrences per Variable: A Study through Delta-Matroid Parity.	MFCS	2003	DBLP DOI BibTeX RDF
25	Weixiong Zhang	Phase Transitions and Backbones of 3-SAT and Maximum 3-SAT.	CP	2001	DBLP DOI BibTeX RDF
25	Kousha Etessami, Moshe Y. Vardi, Thomas Wilke	First-Order Logic with Two Variables and Unary Temporal Logic.	LICS	1997	DBLP DOI BibTeX RDF
25	Erich Grädel, Martin Otto 0001, Eric Rosen	Undecidability Results on Two-Variable Logics.	STACS	1997	DBLP DOI BibTeX RDF
25	Srinivas Devadas, Kurt Keutzer, Jacob K. White 0001	Estimation of power dissipation in CMOS combinational circuits using Boolean function manipulation.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1992	DBLP DOI BibTeX RDF
25	John H. Reif, Gary L. Peterson	A Dynamic Logic of Multiprocessing with Incomplete Information.	POPL	1980	DBLP DOI BibTeX RDF
25	Jens Groth	Linear Algebra with Sub-linear Zero-Knowledge Arguments.	CRYPTO	2009	DBLP DOI BibTeX RDF	Sub-linear size zero-knowledge arguments, public-coin special honest verifier zero-knowledge, Pedersen commitments, linear algebra, circuit satisfiability
25	Himanshu Jain, Edmund M. Clarke	Efficient SAT solving for non-clausal formulas using DPLL, graphs, and watched cuts.	DAC	2009	DBLP DOI BibTeX RDF	NNF, verification, Boolean satisfiability, DPLL