Search results for "satisfiability"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
24	François Bry, Hendrik Decker, Rainer Manthey	A Uniform Approach to Constraint Satisfaction and Constraint Satisfiability in Deductive Databases.	EDBT	1988	DBLP DOI BibTeX RDF
24	François Bry, Rainer Manthey	Proving Finite Satisfiability of Deductive Databases.	CSL	1987	DBLP DOI BibTeX RDF
24	Weichen Liu, Zonghua Gu 0001, Jiang Xu 0001, Xiaowen Wu, Yaoyao Ye	Satisfiability Modulo Graph Theory for Task Mapping and Scheduling on Multiprocessor Systems.	IEEE Trans. Parallel Distributed Syst.	2011	DBLP DOI BibTeX RDF	scheduling, Multiprocessor, satisfiability, design space exploration
24	Roberto Battiti	Maximum Satisfiability Problem.	Encyclopedia of Optimization	2009	DBLP DOI BibTeX RDF	History-sensitive heuristics, Approximation algorithms, Local search, Maximum satisfiability
24	Pei Hu, Guiming Luo, Chongyuan Yin	Computation of Satisfiability Degree Based on CNF.	FSKD (6)	2009	DBLP DOI BibTeX RDF	satisfiability degree computation, horn abduction, CNF
24	Limin Chen, Hong Hu 0001, Zhongzhi Shi	Web Service Composition as Satisfiability Checking in Dynamic Description Logics.	GCC	2009	DBLP DOI BibTeX RDF	dynamic description logics, Semantic Web, satisfiability, description logics, Web service composition
24	Jingchao Chen	Building a Hybrid SAT Solver via Conflict-Driven, Look-Ahead and XOR Reasoning Techniques.	SAT	2009	DBLP DOI BibTeX RDF	Conflict-driven, XOR reasoning, Hybrid solving technique, search pruning technique, Look-ahead, Boolean satisfiability (SAT)
24	Stefan Porschen, Tatjana Schmidt, Ewald Speckenmeyer	On Some Aspects of Mixed Horn Formulas.	SAT	2009	DBLP DOI BibTeX RDF	Mixed Horn formula, polynomial time reduction, NP-completeness, satisfiability, exact algorithm
24	Ruei-Rung Lee, Jie-Hong Roland Jiang, Wei-Lun Hung	Bi-decomposing large Boolean functions via interpolation and satisfiability solving.	DAC	2008	DBLP DOI BibTeX RDF	bi-decomposition, satisfiability, logic synthesis, Craig interpolation
24	Dominik Scheder, Philipp Zumstein	How Many Conflicts Does It Need to Be Unsatisfiable?	SAT	2008	DBLP DOI BibTeX RDF	unsatisfiable formulas, Lovász Local Lemma, satisfiability, conflict graph
24	Stefan Porschen, Ewald Speckenmeyer	A CNF Class Generalizing Exact Linear Formulas.	SAT	2008	DBLP DOI BibTeX RDF	CNF satisfiability, exact linear formula, fibre-transversal, hypergraph
24	Dimitris Achlioptas, Assaf Naor, Yuval Peres	On the maximum satisfiability of random formulas.	J. ACM	2007	DBLP DOI BibTeX RDF	Maximum satisfiability
24	Lengning Liu, Miroslaw Truszczynski	Satisfiability Testing of Boolean Combinations of Pseudo-Boolean Constraints using Local-search Techniques.	Constraints An Int. J.	2007	DBLP DOI BibTeX RDF	Pseudo-Boolean constraints, Boolean satisfiability, Stochastic local search
24	Benjamin W. Wah, Zhe Wu 0002	Penalty Formulations and Trap-Avoidance Strategies for Solving Hard Satisfiability Problems.	J. Comput. Sci. Technol.	2005	DBLP DOI BibTeX RDF	techniques of algorithms, penalty formulation, search, constraint satisfaction, Boolean satisfiability, knowledge representation and reasoning, saddle point
24	Bing Li, Chao Wang 0001, Fabio Somenzi	Abstraction refinement in symbolic model checking using satisfiability as the only decision procedure.	Int. J. Softw. Tools Technol. Transf.	2005	DBLP DOI BibTeX RDF	Unsatisfiability proof, Bounded model checking, Satisfiability problem, Abstraction refinement
24	Stefan Andrei	Counting for Satisfiability by Inverting Resolution.	Artif. Intell. Rev.	2004	DBLP DOI BibTeX RDF	counting truth assignments, algorithms, satisfiability
24	Gi-Joon Nam, Karem A. Sakallah, Rob A. Rutenbar	Satisfiability-Based Layout Revisited: Detailed Routing of Complex FPGAs vis Search-Based Boolean SAT.	FPGA	1999	DBLP DOI BibTeX RDF	conflict-directed search, Boolean satisfiability, FPGA routing
24	Zhe Wu 0002, Benjamin W. Wah	Solving Hard Satisfiability Problems: A Unified Algorithm Based on Discrete Lagrange Multipliers.	ICTAI	1999	DBLP DOI BibTeX RDF	DIMACS benchmarks, discrete Lagrange-multiplier method, first-order search procedure, satisfiability, traps
24	Nicole Nemer-Preece, Ralph W. Wilkerson	Parallel genetic algorithm to solve the satisfiability problem.	SAC	1998	DBLP DOI BibTeX RDF	David-Putnam method, genetic algorithms, parallel processing, satisfiability problem, model generation
24	Sha Guo, Wei Sun 0002, Mark Allen Weiss	On Satisfiability, Equivalence, and Impication Problems Involving Conjunctive Queries in Database Systems.	IEEE Trans. Knowl. Data Eng.	1996	DBLP DOI BibTeX RDF	derivability problem, Database, NP-hard, satisfiability, conjunctive queries, implication problem
24	Stephen J. Hartley	Steiner systems and the Boolean satisfiability problem.	SAC	1996	DBLP DOI BibTeX RDF	Boolean satisfiability problem, Steiner systems, genetic algorithms, combinatorial optimization
24	Michel X. Goemans, David P. Williamson	Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming.	J. ACM	1995	DBLP DOI BibTeX RDF	Approximation algorithms, randomized algorithms, satisfiability, convex optimization
24	Jun Gu	Global Optimization for Satisfiability (SAT) Problem.	IEEE Trans. Knowl. Data Eng.	1994	DBLP DOI BibTeX RDF	global optimization algorithms, VLSI engineering, DNF local search methods, Universal SAT problem model, UniSAT, discrete SAT problem, Boolean space, unconstrained global optimization problem, real space, direct correspondence, global minimum point, backtracking/resolution procedures, optimisation, inference, inference mechanisms, search problems, automated reasoning, formal logic, CNF, conjunctive normal form, computing theory, satisfiability problem, SAT problem, mathematical logic
24	Anil Kamath, Rajeev Motwani 0001, Krishna V. Palem, Paul G. Spirakis	Tail Bounds for Occupancy and the Satisfiability Threshold Conjecture	FOCS	1994	DBLP DOI BibTeX RDF	tail bounds, satisfiability threshold conjecture, random allocation, random 3-SAT formulas, randomized algorithms, upper bound, probabilistic analysis, structural property, occupancy
23	Emiko Soroka, Mykel J. Kochenderfer, Sanjay Lall	Satisfiability.jl: Satisfiability Modulo Theories in Julia.	CoRR	2023	DBLP DOI BibTeX RDF
23	George Katsirelos	An Analysis of Core-Guided Maximum Satisfiability Solvers Using Linear Programming.	SAT	2023	DBLP DOI BibTeX RDF
23	Christopher Lynch, Stephen Miner	Complete Trigger Selection in Satisfiability Modulo First-Order Theories.	SMT	2023	DBLP BibTeX RDF
23	Hao Hu 0008	Interpretable Machine Learning Models via Maximum Boolean Satisfiability. (Interpretable Machine Learning Models via Maximum Boolean Satisfiability).		2022	RDF
23	Hao-Ren Wang, Kuan-Hua Tu, Jie-Hong Roland Jiang, Christoph Scholl 0001	Quantifier Elimination in Stochastic Boolean Satisfiability.	SAT	2022	DBLP DOI BibTeX RDF
23	Milan Mossé, Harry Sha, Li-Yang Tan	A Generalization of the Satisfiability Coding Lemma and Its Applications.	SAT	2022	DBLP DOI BibTeX RDF
23	Andreas Niskanen, Jeremias Berg, Matti Järvisalo	Incremental Maximum Satisfiability.	SAT	2022	DBLP DOI BibTeX RDF
23	Lucas Clemente Vella, Leonardo Alt	On Satisfiability of Polynomial Equations over Large Prime Fields.	SMT	2022	DBLP BibTeX RDF
23	Marie Fortin, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann 0002	HyperLTL Satisfiability is Σ11-complete, HyperCTL* Satisfiability is Σ12-complete.	CoRR	2021	DBLP BibTeX RDF
23	Marie Fortin, Louwe B. Kuijer, Patrick Totzke, Martin Zimmermann 0002	HyperLTL Satisfiability Is Σ₁¹-Complete, HyperCTL* Satisfiability Is Σ₁²-Complete.	MFCS	2021	DBLP DOI BibTeX RDF
23	Miki Hermann, Gernot Salzer	MCP: Capturing Big Data by Satisfiability (Tool Description).	SAT	2021	DBLP DOI BibTeX RDF
23	Jiwei Jin, Yiqi Lv, Cunjing Ge, Feifei Ma, Jian Zhang 0001	Investigating the Existence of Costas Latin Squares via Satisfiability Testing.	SAT	2021	DBLP DOI BibTeX RDF
23	Christoph Lüders	Computing Tropical Prevarieties With Satisfiability Modulo Theories (SMT) Solvers.	PAAR+SC²@IJCAR	2020	DBLP BibTeX RDF
23	Milan Ceska 0002, Jirí Matyás, Vojtech Mrazek, Tomás Vojnar	Satisfiability Solving Meets Evolutionary Optimisation in Designing Approximate Circuits.	SAT	2020	DBLP DOI BibTeX RDF
23	Oleksii Omelchenko, Andrei A. Bulatov	Satisfiability Threshold for Power Law Random 2-SAT in Configuration Model.	SAT	2019	DBLP DOI BibTeX RDF
23	Jakub Michaliszyn, Jan Otop, Piotr Witkowski 0001	Satisfiability versus Finite Satisfiability in Elementary Modal Logics.	Fundam. Informaticae	2018	DBLP DOI BibTeX RDF
23	Ilias S. Kotsireas	Hard Combinatorial Problems: A Challenge for Satisfiability.	SC-Square@FLOC	2018	DBLP BibTeX RDF
23	Tobias Friedrich 0001, Ralf Rothenberger	Sharpness of the Satisfiability Threshold for Non-uniform Random k-SAT.	SAT	2018	DBLP DOI BibTeX RDF
23	Sean A. Weaver, Hannah J. Roberts, Michael J. Smith 0012	XOR-Satisfiability Set Membership Filters.	SAT	2018	DBLP DOI BibTeX RDF
23	Erika Ábrahám, Jasper Nalbach, Gereon Kremer	Embedding the Virtual Substitution Method in the Model Constructing Satisfiability Calculus Framework.	SC²@ISSAC	2017	DBLP BibTeX RDF
23	Raphaël Berthon, Christophe Ringeissen	Satisfiability Modulo Free Data Structures Combined with Bridging Functions.	SMT@IJCAR	2016	DBLP BibTeX RDF
23	Mateus de Oliveira Oliveira	Satisfiability via Smooth Pictures.	SAT	2016	DBLP DOI BibTeX RDF
23	Shaowei Cai 0001, Chuan Luo 0002, Kaile Su	CCAnr: A Configuration Checking Based Local Search Solver for Non-random Satisfiability.	SAT	2015	DBLP DOI BibTeX RDF
23	Philipp Rümmer, Christoph M. Wintersteiger (eds.)	Proceedings of the 12th International Workshop on Satisfiability Modulo Theories, SMT 2014, affiliated with the 26th International Conference on Computer Aided Verification (CAV 2014), the 7th International Joint Conference on Automated Reasoning (IJCAR 2014), and the 17th International Conference on Theory and Applications of Satisfiability Testing (SAT 2014), Vienna, Austria, July 17-18, 2014.	SMT	2014	DBLP BibTeX RDF
23	Alexey Ignatiev, António Morgado 0001, João Marques-Silva 0001	On Reducing Maximum Independent Set to Minimum Satisfiability.	SAT	2014	DBLP DOI BibTeX RDF
23	Francesco Alberti, Silvio Ghilardi, Natasha Sharygina	Decision Procedures for Flat Array Properties.	SMT	2014	DBLP BibTeX RDF
23	Edmund S. L. Lam, Iliano Cervesato	Reasoning About Set Comprehensions.	SMT	2014	DBLP BibTeX RDF
23	Konstantin Korovin, Marek Kosta, Thomas Sturm 0001	Towards Conflict-Driven Learning for Virtual Substitution.	SMT	2014	DBLP BibTeX RDF
23	Daniel J. Fremont, Sanjit A. Seshia	Speeding Up SMT-Based Quantitative Program Analysis.	SMT	2014	DBLP BibTeX RDF
23	To Van Khanh, Xuan-Tung Vu, Mizuhito Ogawa	raSAT: SMT for Polynomial Inequality.	SMT	2014	DBLP BibTeX RDF
23	Tim King 0001, Clark W. Barrett, Cesare Tinelli	Leveraging Linear and Mixed Integer Programming for SMT.	SMT	2014	DBLP BibTeX RDF
23	Hristina Palikareva, Cristian Cadar	Multi-solver Support in Symbolic Execution.	SMT	2014	DBLP BibTeX RDF
23	Mats Carlsson, Olga Grinchtein, Justin Pearson	Protocol Log Analysis with Constraint Programming.	SMT	2014	DBLP BibTeX RDF
23	Richard Bonichon, David Déharbe, Cláudia Tavares	Extending SMT-LIB v2 with λ-Terms and Polymorphism.	SMT	2014	DBLP BibTeX RDF
23	Guillaume Melquiond	Automating the Verification of Floating-Point Algorithms.	SMT	2014	DBLP BibTeX RDF
23	Clark W. Barrett	SMT: Where do we go from here?	SMT	2014	DBLP BibTeX RDF
23	Marek Kosta, Thomas Sturm 0001, Andreas Dolzmann	Better Answers to Real Questions.	SMT	2014	DBLP BibTeX RDF
23	Jürgen Christ, Jochen Hoenicke	Weakly Equivalent Arrays.	SMT	2014	DBLP BibTeX RDF
23	Marcelo Finger, Ronan LeBras, Carla P. Gomes, Bart Selman	Solutions for Hard and Soft Constraints Using Optimized Probabilistic Satisfiability.	SAT	2013	DBLP DOI BibTeX RDF
23	Alexey Ignatiev, Mikolás Janota, João Marques-Silva 0001	Quantified Maximum Satisfiability: - A Core-Guided Approach.	SAT	2013	DBLP DOI BibTeX RDF
23	Jakub Michaliszyn, Jan Otop, Piotr Witkowski 0001	Satisfiability vs. Finite Satisfiability in Elementary Modal Logics	GandALF	2012	DBLP DOI BibTeX RDF
23	Anh-Dung Phan, Nikolaj S. Bjørner, David Monniaux	Anatomy of Alternating Quantifier Satisfiability (Work in progress).	SMT@IJCAR	2012	DBLP DOI BibTeX RDF
23	Nikolaj S. Bjørner, Kenneth L. McMillan, Andrey Rybalchenko	Program Verification as Satisfiability Modulo Theories.	SMT@IJCAR	2012	DBLP DOI BibTeX RDF
23	Donald E. Knuth	Satisfiability and The Art of Computer Programming.	SAT	2012	DBLP DOI BibTeX RDF
23	Chu Min Li, Yu Li	Satisfying versus Falsifying in Local Search for Satisfiability - (Poster Presentation).	SAT	2012	DBLP DOI BibTeX RDF
23	Nadia Creignou, Heribert Vollmer	Parameterized Complexity of Weighted Satisfiability Problems.	SAT	2012	DBLP DOI BibTeX RDF
23	Serge Gaspers, Stefan Szeider	Strong Backdoors to Nested Satisfiability.	SAT	2012	DBLP DOI BibTeX RDF
23	Chu Min Li, Wanxia Wei, Yu Li	Exploiting Historical Relationships of Clauses and Variables in Local Search for Satisfiability - (Poster Presentation).	SAT	2012	DBLP DOI BibTeX RDF
23	Evgeny Dantsin, Edward A. Hirsch	Satisfiability Certificates Verifiable in Subexponential Time.	SAT	2011	DBLP DOI BibTeX RDF
23	Alessandro Previti, Raghuram Ramanujan, Marco Schaerf, Bart Selman	Applying UCT to Boolean Satisfiability.	SAT	2011	DBLP DOI BibTeX RDF
23	Allen Van Gelder	Generalized Conflict-Clause Strengthening for Satisfiability Solvers.	SAT	2011	DBLP DOI BibTeX RDF
23	Sebastian Ordyniak, Daniël Paulusma, Stefan Szeider	Satisfiability of Acyclic and almost Acyclic CNF Formulas (II).	SAT	2011	DBLP DOI BibTeX RDF
23	Ewald Speckenmeyer, Andreas Wotzlaw, Stefan Porschen	A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs.	SAT	2011	DBLP DOI BibTeX RDF
23	Hadi Katebi, Karem A. Sakallah, Igor L. Markov	Symmetry and Satisfiability: An Update.	SAT	2010	DBLP DOI BibTeX RDF
23	Anton Belov, Zbigniew Stachniak	Improved Local Search for Circuit Satisfiability.	SAT	2010	DBLP DOI BibTeX RDF
23	Anton Belov, Zbigniew Stachniak	Improving Variable Selection Process in Stochastic Local Search for Propositional Satisfiability.	SAT	2009	DBLP DOI BibTeX RDF
23	Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy	Solving (Weighted) Partial MaxSAT through Satisfiability Testing.	SAT	2009	DBLP DOI BibTeX RDF
23	Knot Pipatsrisawat, Adnan Darwiche	Width-Based Restart Policies for Clause-Learning Satisfiability Solvers.	SAT	2009	DBLP DOI BibTeX RDF
23	Adrian Balint, Michael Henn, Oliver Gableske	A Novel Approach to Combine a SLS- and a DPLL-Solver for the Satisfiability Problem.	SAT	2009	DBLP DOI BibTeX RDF
23	João Marques-Silva 0001, Vasco M. Manquinho	Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms.	SAT	2008	DBLP DOI BibTeX RDF
23	Knot Pipatsrisawat, Adnan Darwiche	A Lightweight Component Caching Scheme for Satisfiability Solvers.	SAT	2007	DBLP DOI BibTeX RDF
23	Miguel F. Anjos	Semidefinite Optimization Approaches for Satisfiability and Maximum-Satisfiability Problems.	J. Satisf. Boolean Model. Comput.	2006	DBLP DOI BibTeX RDF
23	Himanshu Jain, Constantinos Bartzis, Edmund M. Clarke	Satisfiability Checking of Non-clausal Formulas Using General Matings.	SAT	2006	DBLP DOI BibTeX RDF
23	Anton Belov, Zbigniew Stachniak	Substitutional Definition of Satisfiability in Classical Propositional Logic.	SAT	2005	DBLP DOI BibTeX RDF
23	Chu Min Li, Wenqi Huang	Diversification and Determinism in Local Search for Satisfiability.	SAT	2005	DBLP DOI BibTeX RDF
23	Hossein M. Sheini, Karem A. Sakallah	A Scalable Method for Solving Satisfiability of Integer Linear Arithmetic Logic.	SAT	2005	DBLP DOI BibTeX RDF
23	Weixiong Zhang	Configuration landscape analysis and backbone guided local search: Part I: Satisfiability and maximum satisfiability.	Artif. Intell.	2004	DBLP DOI BibTeX RDF
23	Danila A. Sinopalnikov	Satisfiability Threshold of the Skewed Random k-SAT.	SAT	2004	DBLP BibTeX RDF
23	Ravi Gummadi, N. S. Narayanaswamy, Venkatakrishnan Ramaswamy	Algorithms for Satisfiability using Independent Sets of Variables.	SAT	2004	DBLP BibTeX RDF
23	Daijue Tang, Yinlei Yu, Darsh Ranjan, Sharad Malik	Analysis of Search Based Algorithms for Satisfiability of Quantified Boolean Formulas Arising from Circuit State Space Diameter Problems.	SAT	2004	DBLP BibTeX RDF
23	Guoqiang Pan, Moshe Y. Vardi	Search vs. Symbolic Techniques in Satisfiability Solving.	SAT	2004	DBLP BibTeX RDF
23	Nachum Dershowitz, Jieh Hsiang, Guan-Shieng Huang, Daher Kaiss	Boolean Ring Satisfiability.	SAT	2004	DBLP BibTeX RDF
23	HoonSang Jin, Fabio Somenzi	CirCUs: A Hybrid Satisfiability Solver.	SAT	2004	DBLP BibTeX RDF
23	Daniele Pretolani	Hypergraph Reductions and Satisfiability Problems.	SAT	2003	DBLP DOI BibTeX RDF
23	John V. Franco, Michal Kouril, John S. Schlipf, Jeffrey Ward, Sean A. Weaver, Michael R. Dransfield, W. Mark Vanfleet	SBSAT: a State-Based, BDD-Based Satisfiability Solver.	SAT	2003	DBLP DOI BibTeX RDF
23	Zhe Wu 0002, Benjamin W. Wah	Trap Escaping Strategies in Discrete Lagrangian Methods for Solving Hard Satisfiability and Maximum Satisfiability Problems.	AAAI/IAAI	1999	DBLP BibTeX RDF