Search results for "Satisfiability"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
25	Sergey Babenyshev, Vladimir V. Rybakov	Decidability of Hybrid Logic with Local Common Knowledge Based on Linear Temporal Logic LTL.	CiE	2008	DBLP DOI BibTeX RDF	multi-agent logics, relational Kripke-Hintikka models, decidability algorithms, satisfiability, linear temporal logic, hybrid logics
25	Elitza N. Maneva, Elchanan Mossel, Martin J. Wainwright	A new look at survey propagation and its generalizations.	J. ACM	2007	DBLP DOI BibTeX RDF	sum-product, survey propagation, message-passing, Markov random field, belief propagation, Gibbs sampling, Satisfiability problems, factor graph, k-SAT
25	Kenichi Watanabe, Yoshio Nakajima, Tomoya Enokido, Makoto Takizawa 0001	Ranking factors in peer-to-peer overlay networks.	ACM Trans. Auton. Adapt. Syst.	2007	DBLP DOI BibTeX RDF	P2P overlay networks, acquaintances, ranking factor, satisfiability, trustworthiness
25	Priscila Machado Vieira Lima, M. Mariela Morveli-Espinoza, Felipe M. G. França	Logic as Energy: A SAT-Based Approach.	BVAI	2007	DBLP DOI BibTeX RDF	ARQ-PROP II, higher-order neural networks, propositional reasoner, satyrus, satisfiability
25	Matteo Pradella, Angelo Morzenti, Pierluigi San Pietro	The symmetry of the past and of the future: bi-infinite time in the verification of temporal properties.	ESEC/SIGSOFT FSE	2007	DBLP DOI BibTeX RDF	bi-infinite time, satisfiability checking, temporal logic, bounded model checking
25	Verónica Borja Macías, Pilar Pozos Parra	Model-based belief merging without distance measures.	AAMAS	2007	DBLP DOI BibTeX RDF	integrity constraints and multiagent systems, partial satisfiability, belief merging
25	Agostino Dovier, Andrea Formisano 0001, Eugenio G. Omodeo	Decidability results for sets with atoms.	ACM Trans. Comput. Log.	2006	DBLP DOI BibTeX RDF	Prenex sentences, set-hyperset theories, syllogistics, unification, quantifier elimination, satisfiability problem
25	Robert Nieuwenhuis, Albert Oliveras, Cesare Tinelli	Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T).	J. ACM	2006	DBLP DOI BibTeX RDF	SAT solvers, Satisfiability Modulo Theories
25	Wahid Chrabakh, Richard Wolski	GridSAT: Design and Implementation of a Computational Grid Application.	J. Grid Comput.	2006	DBLP DOI BibTeX RDF	Scheduling, Parallel, Distributed, Satisfiability, Computational Grid
25	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
25	Philippe Chapdelaine, Nadia Creignou	The complexity of Boolean constraint satisfaction local search problems.	Ann. Math. Artif. Intell.	2005	DBLP DOI BibTeX RDF	PLS-complete, optimization, complexity, local search, satisfiability, PLS
25	Daniele Pretolani	Probability logic and optimization SAT: The PSAT and CPA models.	Ann. Math. Artif. Intell.	2005	DBLP DOI BibTeX RDF	CNF formulas, ideal matrices, probability, logic, directed graphs, propositional satisfiability
25	Olga Tveretina, Hans Zantema	A Proof System and a Decision Procedure for Equality Logic.	LATIN	2004	DBLP DOI BibTeX RDF	Equality logic, satisfiability, resolution
25	Andrei A. Krokhin, Peter Jeavons 0001, Peter Jonsson	Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra.	J. ACM	2003	DBLP DOI BibTeX RDF	Allen's algebra, dichotomy theorem, representing graphs by intervals, satisfiability of temporal constraints, tractable cases, complexity, NP-completeness
25	Martin Fränzle, Christian Herde	Efficient SAT Engines for Concise Logics: Accelerating Proof Search for Zero-One Linear Constraint Systems.	LPAR	2003	DBLP DOI BibTeX RDF	non-clausal propositional logic, zero-one linear constraint systems, Satisfiability, proof search, acceleration techniques
25	Richard Ostrowski, Bertrand Mazure, Lakhdar Sais, Éric Grégoire	Eliminating Redundancies in SAT Search Trees.	ICTAI	2003	DBLP DOI BibTeX RDF	Davis and Putnam´s algorithm, Boolean search and satisfiability, SAT
25	Wahid Chrabakh, Richard Wolski	GridSAT: A Chaff-based Distributed SAT Solver for the Grid.	SC	2003	DBLP DOI BibTeX RDF	ComputationalGrid, Parallel, Distributed, Satisfiability
25	Xiaolong Jin, Jiming Liu 0001	Multiagent SAT (MASSAT): Autonomous Pattern Search in Constrained Domains.	IDEAL	2002	DBLP DOI BibTeX RDF	Autonomous Pattern Search, Satisfiability Problem (SAT), MASSAT, Multiagent System
25	Jianer Chen, Iyad A. Kanj	Improved Exact Algorithms for MAX-SAT.	LATIN	2002	DBLP DOI BibTeX RDF	exact algorithms, parameterized algorithms, maximum satisfiability
25	Habiba Drias, Mohamed Khabzaoui	Scatter Search with Random Walk Strategy for SAT and MAX-W-SAT Problems.	IEA/AIE	2001	DBLP DOI BibTeX RDF	Weighted maximum satisfiability problem, genetic algorithm, heuristic search, optimization problem, scatter search, evolutionary approach
25	Richard J. Lipton, Anastasios Viglas	On the Complexity of SAT.	FOCS	1999	DBLP DOI BibTeX RDF	time-space, log-space uniform circuits, lower bounds, satisfiability
25	Piotr Berman, Marek Karpinski	On Some Tighter Inapproximability Results (Extended Abstract).	ICALP	1999	DBLP DOI BibTeX RDF	Approximation Hardness, Bounded Dependency Satisfiability, Breakpoint Graphs, Node Cover, Approximation Algorithms, Independent Set, MAX-CUT, Sorting by Reversals
25	Jianer Chen, Donald K. Friesen, Hao Zheng	Tight Bound on Johnson's Algoritihm for Max-SAT.	CCC	1997	DBLP DOI BibTeX RDF	optimization, approximation algorithm, maximum satisfiability, performance ratio
25	Yonit Kesten, Zohar Manna, Hugh McGuire, Amir Pnueli	A Decision Algorithm for Full Propositional Temporal Logic.	CAV	1993	DBLP DOI BibTeX RDF	satisfiability checking, validity checking, past and future operators, incremental tableau, model checking, temporal logic, automatic verification
24	Haiou Shen, Hantao Zhang 0001	Improving exact algorithms for MAX-2-SAT.	Ann. Math. Artif. Intell.	2005	DBLP DOI BibTeX RDF	exact algorithms, propositional satisfiability, maximum satisfiability
24	Joe Kilian, Erez Petrank	An Efficient Noninteractive Zero-Knowledge Proof System for NP with General Assumptions.	J. Cryptol.	1998	DBLP DOI BibTeX RDF	Efficient proofs, Noninteractive zero knowledge, Efficient proofs, Noninteractive zero knowledge, Zero knowledge, Zero knowledge, Key words, One-way permutations, One-way permutations, Circuit satisfiability, Circuit satisfiability
24	Yevgeny Kazakov, Ian Pratt-Hartmann	A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics.	LICS	2009	DBLP DOI BibTeX RDF
24	Pavel Klinov, Bijan Parsia	On Improving the Scalability of Checking Satisfiability in Probabilistic Description Logics.	SUM	2009	DBLP DOI BibTeX RDF
24	Maria Paola Bonacina, Christopher Lynch, Leonardo Mendonça de Moura	On Deciding Satisfiability by DPLL(G+T) and Unsound Theorem Proving.	CADE	2009	DBLP DOI BibTeX RDF
24	Andrew M. Sutton, L. Darrell Whitley, Adele E. Howe	A polynomial time computation of the exact correlation structure of k-satisfiability landscapes.	GECCO	2009	DBLP DOI BibTeX RDF	combinatorial optimization, fitness landscapes
24	Linh Anh Nguyen, Andrzej Szalas	ExpTime Tableaux for Checking Satisfiability of a Knowledge Base in the Description Logic ALC\mathcal{ALC}.	ICCCI	2009	DBLP DOI BibTeX RDF
24	Yasunori Ishihara, Takuji Morimoto, Shougo Shimizu, Kenji Hashimoto, Toru Fujiwara	A Tractable Subclass of DTDs for XPath Satisfiability with Sibling Axes.	DBPL	2009	DBLP DOI BibTeX RDF
24	Prabhat Mishra 0001, Mingsong Chen	Efficient Techniques for Directed Test Generation Using Incremental Satisfiability.	VLSI Design	2009	DBLP DOI BibTeX RDF
24	Chris Calabro, Russell Impagliazzo, Ramamohan Paturi	The Complexity of Satisfiability of Small Depth Circuits.	IWPEC	2009	DBLP DOI BibTeX RDF
24	Vasco M. Manquinho, João Marques-Silva 0001, Jordi Planes	Algorithms for Weighted Boolean Optimization.	SAT	2009	DBLP DOI BibTeX RDF
24	Daniel Johannsen, Igor Razgon, Magnus Wahlström	Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences.	SAT	2009	DBLP DOI BibTeX RDF
24	Lukas Kroc, Ashish Sabharwal, Bart Selman	Relaxed DPLL Search for MaxSAT.	SAT	2009	DBLP DOI BibTeX RDF
24	Nadia Creignou, Hervé Daudé, Uwe Egly, Raphaël Rossignol	(1, 2)-QSAT: A Good Candidate for Understanding Phase Transitions Mechanisms.	SAT	2009	DBLP DOI BibTeX RDF
24	Tino Teige, Martin Fränzle	Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic.	CPAIOR	2008	DBLP DOI BibTeX RDF
24	João Marques-Silva 0001, Inês Lynce, Vasco M. Manquinho	Symmetry Breaking for Maximum Satisfiability.	LPAR	2008	DBLP DOI BibTeX RDF
24	Wei-Min Wu, Min-Chuan Chen	USAT: An Integrated Platform for Satisfiability Solving and Model Checking.	CSSE (4)	2008	DBLP DOI BibTeX RDF
24	Emanuele Di Rosa, Enrico Giunchiglia, Marco Maratea	Computing All Optimal Solutions in Satisfiability Problems with Preferences.	CP	2008	DBLP DOI BibTeX RDF
24	Stephan Kottler, Michael Kaufmann 0001, Carsten Sinz	A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors.	SAT	2008	DBLP DOI BibTeX RDF
24	Florian Letombe, João Marques-Silva 0001	Improvements to Hybrid Incremental SAT Algorithms.	SAT	2008	DBLP DOI BibTeX RDF
24	Emanuel Kieronski, Lidia Tendera	On Finite Satisfiability of the Guarded Fragment with Equivalence or Transitive Guards.	LPAR	2007	DBLP DOI BibTeX RDF
24	Hratch Mangassarian, Andreas G. Veneris, Sean Safarpour, Farid N. Najm, Magdy S. Abadir	Maximum circuit activity estimation using pseudo-boolean satisfiability.	DATE	2007	DBLP DOI BibTeX RDF
24	Kristin Y. Rozier, Moshe Y. Vardi	LTL Satisfiability Checking.	SPIN	2007	DBLP DOI BibTeX RDF
24	Dorothea Baumeister, Jörg Rothe	Satisfiability Parsimoniously Reduces to the TantrixTM Rotation Puzzle Problem.	MCU	2007	DBLP DOI BibTeX RDF	rotation puzzle, tiling of the plane, parsimonious reduction, computational complexity, counting problem
24	Shujun Deng, Jinian Bian, Weimin Wu, Xiaoqing Yang, Yanni Zhao	EHSAT: An Efficient RTL Satisfiability Solver Using an Extended DPLL Procedure.	DAC	2007	DBLP DOI BibTeX RDF
24	Alan Mishchenko, Jin S. Zhang, Subarnarekha Sinha, Jerry R. Burch, Robert K. Brayton, Malgorzata Chrzanowska-Jeske	Using simulation and satisfiability to compute flexibilities in Boolean networks.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2006	DBLP DOI BibTeX RDF
24	Anatoly Chebotarev, Sergey Krivoi	Improved Resolution-Based Method for Satisfiability Checking Formulas of the Language L.	Ershov Memorial Conference	2006	DBLP DOI BibTeX RDF
24	Nachiketh R. Potlapally, Anand Raghunathan, Srivaths Ravi 0001, Niraj K. Jha, Ruby B. Lee	Satisfiability-based framework for enabling side-channel attacks on cryptographic software.	DATE Designers' Forum	2006	DBLP DOI BibTeX RDF
24	Eldar Fischer, Frédéric Magniez, Michel de Rougemont	Approximate Satisfiability and Equivalence.	LICS	2006	DBLP DOI BibTeX RDF
24	Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. Maneva, Christos H. Papadimitriou	The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies.	ICALP (1)	2006	DBLP DOI BibTeX RDF
24	Adnan Darwiche	Searching While Keeping a Trace: The Evolution from Satisfiability to Knowledge Compilation.	IJCAR	2006	DBLP DOI BibTeX RDF
24	Sven Schewe, Bernd Finkbeiner	Satisfiability and Finite Model Property for the Alternating-Time mu-Calculus.	CSL	2006	DBLP DOI BibTeX RDF
24	Annegret Habel, Karl-Heinz Pennemann	Satisfiability of High-Level Conditions.	ICGT	2006	DBLP DOI BibTeX RDF
24	Yinlei Yu, Sharad Malik	Lemma Learning in SMT on Linear Constraints.	SAT	2006	DBLP DOI BibTeX RDF
24	Wieslaw Szwast, Lidia Tendera	On the Finite Satisfiability Problem for the Guarded Fragment with Transitivity.	LPAR	2005	DBLP DOI BibTeX RDF	computational complexity, transitivity, decision problem, guarded fragment, finite model
24	Marco Bozzano, Roberto Bruttomesso, Alessandro Cimatti, Tommi A. Junttila, Silvio Ranise, Peter van Rossum, Roberto Sebastiani	Efficient Satisfiability Modulo Theories via Delayed Theory Combination.	CAV	2005	DBLP DOI BibTeX RDF
24	Paola Festa, Panos M. Pardalos, Leonidas S. Pitsoulis, Mauricio G. C. Resende	GRASP with Path-Relinking for the Weighted Maximum Satisfiability Problem.	WEA	2005	DBLP DOI BibTeX RDF
24	Kameshwar Chandrasekar, Michael S. Hsiao	Integration of Learning Techniques into Incremental Satisfiability for Efficient Path-Delay Fault Test Generation.	DATE	2005	DBLP DOI BibTeX RDF
24	Joachim Kneis, Daniel Mölle, Stefan Richter 0001, Peter Rossmanith	On the Parameterized Complexity of Exact Satisfiability Problems.	MFCS	2005	DBLP DOI BibTeX RDF
24	Michael Benedikt, Wenfei Fan, Floris Geerts	XPath satisfiability in the presence of DTDs.	PODS	2005	DBLP DOI BibTeX RDF
24	Cristopher Moore, Gabriel Istrate, Demetrios D. Demopoulos, Moshe Y. Vardi	A Continuous-Discontinuous Second-Order Transition in the Satisfiability of Random Horn-SAT Formulas.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
24	Alessandro Armando, Maria Paola Bonacina, Silvio Ranise, Stephan Schulz 0001	On a Rewriting Approach to Satisfiability Procedures: Extension, Combination of Theories and an Experimental Appraisal.	FroCoS	2005	DBLP DOI BibTeX RDF
24	Finnegan Southey	Constraint Metrics for Local Search.	SAT	2005	DBLP DOI BibTeX RDF
24	Marijn Heule, Hans van Maaren	Observed Lower Bounds for Random 3-SAT Phase Transition Density Using Linear Programming.	SAT	2005	DBLP DOI BibTeX RDF
24	Venkatesan Guruswami	Inapproximability Results for Set Splitting and Satisfiability Problems with No Mixed Clauses.	Algorithmica	2004	DBLP DOI BibTeX RDF	Set splitting, Hardness of approximations, PCP, Gadgets
24	Sean Safarpour, Andreas G. Veneris, Rolf Drechsler, Joanne Lee	Managing Don't Cares in Boolean Satisfiability.	DATE	2004	DBLP DOI BibTeX RDF
24	Jan Johannsen	Satisfiability Problems Complete for Deterministic Logarithmic Space.	STACS	2004	DBLP DOI BibTeX RDF
24	Stephen M. Majercik	Nonchronological Backtracking in Stochastic Boolean Satisfiability.	ICTAI	2004	DBLP DOI BibTeX RDF
24	Ian Horrocks 0001, Peter F. Patel-Schneider	Reducing OWL Entailment to Description Logic Satisfiability.	ISWC	2003	DBLP DOI BibTeX RDF
24	M. Lange	Satisfiability and Completeness of Converse-PDL Replayed.	KI	2003	DBLP DOI BibTeX RDF
24	Govert van Drimmelen	Satisfiability in Alternating-time Temporal Logic.	LICS	2003	DBLP DOI BibTeX RDF
24	Wen Yu, Weimin Zheng	An Effective Molecular Algorithm for Solving the Satisfiability Problem.	APPT	2003	DBLP DOI BibTeX RDF
24	Loganathan Lingappan, Srivaths Ravi 0001, Niraj K. Jha	Test Generation for Non-separable RTL Controller-datapath Circuits using a Satisfiability based Approach.	ICCD	2003	DBLP DOI BibTeX RDF
24	Sebastian Brand, Rosella Gennari, Maarten de Rijke	Constraint Methods for Modal Satisfiability.	CSCLP	2003	DBLP DOI BibTeX RDF
24	Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah	Shatter: efficient symmetry-breaking for boolean satisfiability.	DAC	2003	DBLP DOI BibTeX RDF	clause learning, logic simplification, routing, symmetries, SAT, CNF, backtrack search, graph automorphism
24	Per Bjesse, James H. Kukula, Robert F. Damiano, Ted Stanion, Yunshan Zhu	Guiding SAT Diagnosis with Tree Decompositions.	SAT	2003	DBLP DOI BibTeX RDF
24	Jean-Marie Le Bars	The 0-1 law fails for frame satisfiability of propositional modal logic.	LICS	2002	DBLP DOI BibTeX RDF	Computational Complexity, Finite Model Theory, Modal and Temporal Logics
24	Per Bjesse	Industrial Model Checking Based on Satisfiability Solvers.	SPIN	2002	DBLP DOI BibTeX RDF
24	Eugene Goldberg	Testing Satisfiability of CNF Formulas by Computing a Stable Set of Points.	CADE	2002	DBLP DOI BibTeX RDF
24	Enrico Giunchiglia, Massimo Narizzano, Armando Tacchella	QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability.	IJCAR	2001	DBLP DOI BibTeX RDF
24	Joonyoung Kim, Jesse Whittemore, Karem A. Sakallah, João P. Marques Silva	On Applying Incremental Satisfiability to Delay Fault Testing.	DATE	2000	DBLP DOI BibTeX RDF
24	Tommi A. Junttila, Ilkka Niemelä	Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking.	Computational Logic	2000	DBLP DOI BibTeX RDF
24	Joonyoung Kim, Jesse Whittemore, Karem A. Sakallah	On Solving Stack-Based Incremental Satisfiability Problems.	ICCD	2000	DBLP DOI BibTeX RDF
24	Venkatesan Guruswami	Inapproximability results for set splitting and satisfiability problems with no mixed clauses.	APPROX	2000	DBLP DOI BibTeX RDF
24	João P. Marques Silva, Karem A. Sakallah	Boolean satisfiability in electronic design automation.	DAC	2000	DBLP DOI BibTeX RDF
24	Toby Walsh	Reformulating Propositional Satisfiability as Constraint Satisfaction.	SARA	2000	DBLP DOI BibTeX RDF
24	Marco Platzner, Giovanni De Micheli	Acceleration of Satisfiability Algorithms by Reconfigurable Hardware.	FPL	1998	DBLP DOI BibTeX RDF
24	Pavel Pudlák	Satisfiability - Algorithms and Logic.	MFCS	1998	DBLP DOI BibTeX RDF
24	François Bry, Sunna Torge 0001	A Deduction Method Complete for Refutation and Finite Satisfiability.	JELIA	1998	DBLP DOI BibTeX RDF
24	Peixin Zhong, Pranav Ashar, Sharad Malik, Margaret Martonosi	Using Reconfigurable Computing Techniques to Accelerate Problems in the CAD Domain: A Case Study with Boolean Satisfiability.	DAC	1998	DBLP DOI BibTeX RDF	reconstruction, emulation, visibility, functional simulation
24	Paul R. Stephan, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli	Combinational test generation using satisfiability.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1996	DBLP DOI BibTeX RDF
24	Sha Guo, Wei Sun 0002, Mark Allen Weiss	Solving Satisfiability and Implication Problems in Database Systems.	ACM Trans. Database Syst.	1996	DBLP DOI BibTeX RDF	satisfiabilty, reasoning, equivalence, deduction, implication
24	Tai Joon Park, Allen Van Gelder	Partitioning Methods for Satisfiability Testing on Large Formulas.	CADE	1996	DBLP DOI BibTeX RDF
24	Tracy Larrabee	Test pattern generation using Boolean satisfiability.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1992	DBLP DOI BibTeX RDF
24	Ingo Schiermeyer	Solving 3-Satisfiability in Less Then 1, 579n Steps.	CSL	1992	DBLP DOI BibTeX RDF
24	Bert den Boer	More Efficient Match-Making and Satisfiability: The Five Card Trick.	EUROCRYPT	1989	DBLP DOI BibTeX RDF