Search results for "Satisfiability"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
23	Andrei Z. Broder, Alan M. Frieze, Eli Upfal	On the Satisfiability and Maximum Satisfiability of Random 3-CNF Formulas.	SODA	1993	DBLP DOI BibTeX RDF
18	Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin	Two-variable logic on data trees and XML reasoning.	J. ACM	2009	DBLP DOI BibTeX RDF	XML, consistency, Integrity constraints, DTDs, implications
18	Alessandro Cimatti, Marco Roveri, Stefano Tonetta	Requirements Validation for Hybrid Systems.	CAV	2009	DBLP DOI BibTeX RDF
18	Alessandro Bianco, Fabio Mogavero, Aniello Murano	Graded Computation Tree Logic.	LICS	2009	DBLP DOI BibTeX RDF
18	Jianer Chen, Yang Liu 0002	An Improved SAT Algorithm in Terms of Formula Length.	WADS	2009	DBLP DOI BibTeX RDF
18	Natthapong Jungteerapanich	A Tableau System for the Modal µ-Calculus.	TABLEAUX	2009	DBLP DOI BibTeX RDF
18	Joël Ouaknine, Alexander Rabinovich, James Worrell 0001	Time-Bounded Verification.	CONCUR	2009	DBLP DOI BibTeX RDF
18	Mohamed Faouzi Atig, Peter Habermehl	On Yen's Path Logic for Petri Nets.	RP	2009	DBLP DOI BibTeX RDF
18	Helmut Seidl, Kumar Neeraj Verma	Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying.	ACM Trans. Comput. Log.	2008	DBLP DOI BibTeX RDF	instantiation-based theorem proving, Cryptographic protocols, first-order logic, resolution, Horn clauses
18	Nadia Creignou, Heribert Vollmer	Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?.	Complexity of Constraints	2008	DBLP DOI BibTeX RDF
18	Heike Wehrheim	Bounded Model Checking for Partial Kripke Structures.	ICTAC	2008	DBLP DOI BibTeX RDF
18	Robert Wille, Hoang Minh Le 0001, Gerhard W. Dueck, Daniel Große	Quantified Synthesis of Reversible Logic.	DATE	2008	DBLP DOI BibTeX RDF
18	Laura Bozzelli	The Complexity of CTL* + Linear Past.	FoSSaCS	2008	DBLP DOI BibTeX RDF
18	Guilan Dai, Rujuan Liu, Chongchong Zhao, Changjun Hu	Timing Constraints Specification and Verification for Web Service Compositions.	APSCC	2008	DBLP DOI BibTeX RDF
18	Henrik Björklund, Wim Martens, Thomas Schwentick	Optimizing Conjunctive Queries over Trees Using Schema Information.	MFCS	2008	DBLP DOI BibTeX RDF
18	Riccardo Rosati 0001	Finite Model Reasoning in DL-Lite.	ESWC	2008	DBLP DOI BibTeX RDF
18	Richard Ostrowski, Lionel Paris	From XSAT to SAT by Exhibiting Equivalencies.	ICTAI (1)	2008	DBLP DOI BibTeX RDF
18	Sylvain Hallé, Roger Villemaire	Satisfying a Fragment of XQuery by Branching-Time Reduction.	TIME	2008	DBLP DOI BibTeX RDF
18	Wenhui Zhang	Model Checking with SAT-Based Characterization of ACTL Formulas.	ICFEM	2007	DBLP DOI BibTeX RDF
18	Marc Herbstritt, Vanessa Struve, Bernd Becker 0001	Application of Lifting in Partial Design Analysis.	MTV	2007	DBLP DOI BibTeX RDF
18	Kenichi Watanabe, Yoshio Nakajima, Naohiro Hayashibara, Tomoya Enokido, Makoto Takizawa 0001	Confidence-based Trustworthiness of Acquaintance Peers in Peer-to-Peer Overlay Networks.	ICDCS Workshops	2007	DBLP DOI BibTeX RDF
18	Yoshio Nakajima, Kenichi Watanabe, Valbona Barolli, Tomoya Enokido, Makoto Takizawa 0001	An Inter-peer Trustworthiness Based on Access Control in Peer-to-Peer Overlay Networks.	CISIS	2007	DBLP DOI BibTeX RDF
18	Domenico Cantone, Calogero G. Zarba	A Decision Procedure for Monotone Functions over Bounded and Complete Lattices.	Theory and Applications of Relational Structures as Knowledge Instruments	2006	DBLP DOI BibTeX RDF
18	Piero A. Bonatti, Carsten Lutz, Aniello Murano, Moshe Y. Vardi	The Complexity of Enriched µ-Calculi.	ICALP (2)	2006	DBLP DOI BibTeX RDF
18	Mikolaj Bojanczyk, Claire David, Anca Muscholl, Thomas Schwentick, Luc Segoufin	Two-variable logic on data trees and XML reasoning.	PODS	2006	DBLP DOI BibTeX RDF	data trees, first-order logic, decidability
18	Erika Ábrahám, Tobias Schubert 0001, Bernd Becker 0001, Martin Fränzle, Christian Herde	Parallel SAT Solving in Bounded Model Checking.	FMICS/PDMC	2006	DBLP DOI BibTeX RDF
18	Changrui Yu, Hongwei Wang 0009, Yan Luo	Extended Ontology Model and Ontology Checking Based on Description Logics.	FSKD	2006	DBLP DOI BibTeX RDF
18	Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, Daniele Zucchelli	Deciding Extensions of the Theory of Arrays by Integrating Decision Procedures and Instantiation Strategies.	JELIA	2006	DBLP DOI BibTeX RDF
18	Mustafa Jarrar, Stijn Heymans	Unsatisfiability Reasoning in ORM Conceptual Schemes.	EDBT Workshops	2006	DBLP DOI BibTeX RDF
18	Allen Van Gelder	Independently Checkable Proofs from Decision Procedures: Issues and Progress.	LPAR	2005	DBLP DOI BibTeX RDF
18	Marco Benedetti, Luigia Carlucci Aiello	SAT-Based Cooperative Planning: A Proposal.	Mechanizing Mathematical Reasoning	2005	DBLP DOI BibTeX RDF
18	Zurab Khasidashvili, Alexander Nadel, Amit Palti, Ziyad Hanna	Simultaneous SAT-Based Model Checking of Safety Properties.	Haifa Verification Conference	2005	DBLP DOI BibTeX RDF
18	Helmut Seidl, Kumar Neeraj Verma	Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying.	LPAR	2004	DBLP DOI BibTeX RDF
18	Jörg Flum, Martin Grohe	Model-Checking Problems as a Basis for Parameterized Intractability.	LICS	2004	DBLP DOI BibTeX RDF
18	Wei Li 0002, Peter van Beek	Guiding Real-World SAT Solving with Dynamic Hypergraph Separator Decomposition.	ICTAI	2004	DBLP DOI BibTeX RDF
18	Jan Johannsen, Martin Lange	CTL+ Is Complete for Double Exponential Time.	ICALP	2003	DBLP DOI BibTeX RDF
18	Paul Beame, Russell Impagliazzo, Toniann Pitassi, Nathan Segerlind	Memoization and DPLL: Formula Caching Proof Systems.	CCC	2003	DBLP DOI BibTeX RDF
18	Orna Kupferman, Ulrike Sattler, Moshe Y. Vardi	The Complexity of the Graded µ-Calculus.	CADE	2002	DBLP DOI BibTeX RDF
18	Viorica Sofronie-Stokkermans	On Uniform Word Problems Involving Bridging Operators on Distributive Lattices.	TABLEAUX	2002	DBLP DOI BibTeX RDF
18	Seda Ogrenci Memik, Farzan Fallah	Accelerated SAT-based Scheduling of Control/Data Flow Graphs.	ICCD	2002	DBLP DOI BibTeX RDF
18	Lintao Zhang, Sharad Malik	Towards a Symmetric Treatment of Satisfaction and Conflicts in Quantified Boolean Formula Evaluation.	CP	2002	DBLP DOI BibTeX RDF
18	Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Karem A. Sakallah	Solving difficult SAT instances in the presence of symmetry.	DAC	2002	DBLP DOI BibTeX RDF	difficult, faster, search, symmetry, SAT, CNF, speed-up, instances
18	Andrew Slater	Modelling More Realistic SAT Problems.	Australian Joint Conference on Artificial Intelligence	2002	DBLP DOI BibTeX RDF
18	Erich Grädel, Martin Otto 0001, Eric Rosen	Undecidability results on two-variable logics.	Arch. Math. Log.	1999	DBLP DOI BibTeX RDF
18	John Michael Robson, Volker Diekert	On Quadratic Word Equations.	STACS	1999	DBLP DOI BibTeX RDF
18	Martin Müller, Susumu Nishimura	Type Inference for First-Class Messages with Feature Constraints.	ASIAN	1998	DBLP DOI BibTeX RDF	first-class messages, feature constraints, complexity, object-oriented programming, constraint-based type inference
18	Marco Baioletti, Stefano Marcugini, Alfredo Milani	An Extension of SATPLAN for Planning with Constraints.	AIMSA	1998	DBLP DOI BibTeX RDF
18	Leszek Pacholski, Wieslaw Szwast, Lidia Tendera	Complexity of Two-Variable Logic with Counting.	LICS	1997	DBLP DOI BibTeX RDF
18	Farn Wang, Aloysius K. Mok	RTL and Refutation by Positive Cycles.	FME	1994	DBLP DOI BibTeX RDF
18	Klaus U. Schulz	On Existential Theories of List Concatenation.	CSL	1994	DBLP DOI BibTeX RDF
18	Patrick O'Keefe, Mitchell Wand	Type Inference for Partial Types is Decidable.	ESOP	1992	DBLP DOI BibTeX RDF
18	Balder ten Cate, Carsten Lutz	The complexity of query containment in expressive fragments of XPath 2.0.	J. ACM	2009	DBLP DOI BibTeX RDF	XML, complexity, satisfiability, XPath, containment
18	Matti Järvisalo, Tommi A. Junttila	Limitations of restricted branching in clause learning.	Constraints An Int. J.	2009	DBLP DOI BibTeX RDF	Branching heuristics, Clause learning, Backdoor sets, Proof complexity, Propositional satisfiability, DPLL, Problem structure
18	Gang Fang, Jin Xu, Shemin Zhang	Performing DNA computation with RecA-mediated triple-stranded DNA structure.	Nat. Comput.	2009	DBLP DOI BibTeX RDF	RecA protein, Satisfiability problem (SAT), Triple-stranded DNA structure, DNA computing, NP-complete problems
18	Inanç Seylan, Wojciech Jamroga	Description logic for coalitions.	AAMAS (1)	2009	DBLP BibTeX RDF	strategic logics, satisfiability, description logics, tableaux
18	Silvio Ghilardi, Enrica Nicolini, Daniele Zucchelli	A comprehensive combination framework.	ACM Trans. Comput. Log.	2008	DBLP DOI BibTeX RDF	modal and description logics, decision procedures, Combination, higher-order logic, satisfiability modulo theory
18	Jörg Endrullis, Johannes Waldmann, Hans Zantema	Matrix Interpretations for Proving Termination of Term Rewriting.	J. Autom. Reason.	2008	DBLP DOI BibTeX RDF	Matrix interpretations, Satisfiability, Termination, Term rewriting
18	Sebastien Siva, Lesi Wang	A SQL database system for solving constraints.	PIKM	2008	DBLP DOI BibTeX RDF	SQL, satisfiability (sat), constraint databases
18	John Thornton 0001, Duc Nghia Pham	Using Cost Distributions to Guide Weight Decay in Local Search for SAT.	PRICAI	2008	DBLP DOI BibTeX RDF	clause weighting, automated parameter tuning, Local search, satisfiability
18	Xiuqin Wang, Guangsheng Ma, Hao Wang	A Novel Method for All Solutions SAT Problem.	SNPD	2008	DBLP DOI BibTeX RDF	All Solutions, Observability Don't Cares, Circuit Structure, Boolean Satisfiability
18	Daniel Große, Robert Wille, Gerhard W. Dueck, Rolf Drechsler	Exact Synthesis of Elementary Quantum Gate Circuits for Reversible Functions with Don't Cares.	ISMVL	2008	DBLP DOI BibTeX RDF	Synthesis, Boolean Satisfiability, Reversible Logic
18	Fadi A. Aloul, Arathi Ramani, Karem A. Sakallah, Igor L. Markov	Solution and Optimization of Systems of Pseudo-Boolean Constraints.	IEEE Trans. Computers	2007	DBLP DOI BibTeX RDF	Pseudo Boolean (PB), Max-ONE, Global Routing, Conjunctive Normal Form (CNF), Backtrack Search, Integer Linear Programming (ILP), Max-SAT, Boolean Satisfiability (SAT)
18	Zhenhua Duan, Cong Tian	Decidability of Propositional Projection Temporal Logic with Infinite Models.	TAMC	2007	DBLP DOI BibTeX RDF	infinite model, model checking, satisfiability, decidability, interval temporal logic
18	Pierre Genevès, Nabil Layaïda, Alan Schmitt	Efficient static analysis of XML paths and types.	PLDI	2007	DBLP DOI BibTeX RDF	satisfiability, modal logic, XPath, type checking
18	Panagiotis Manolios, Daron Vroon 0001, Gayatri Subramanian	Automating component-based system assembly.	ISSTA	2007	DBLP DOI BibTeX RDF	integrated modular avionics, pseudo-boolean satisfiability, system assembly problem, component-based software development
18	Panagiotis Manolios, Marc Galceran Oms, Sergi Oliva Valls	Checking Pedigree Consistency with PCS.	TACAS	2007	DBLP DOI BibTeX RDF	Pedigree Consistency checking, bioinformatics, SAT, computational biology, Boolean satisfiability, genetics
18	Marco Antonio Cruz-Chavez, Rafael Rivera-López	A Local Search Algorithm for a SAT Representation of Scheduling Problems.	ICCSA (3)	2007	DBLP DOI BibTeX RDF	SAT formula, disjunctive graph, Reduced SAT Codification of JSSP, satisfiability, Job shop
18	Daniel Große, Xiaobo Chen, Gerhard W. Dueck, Rolf Drechsler	Exact sat-based toffoli network synthesis.	ACM Great Lakes Symposium on VLSI	2007	DBLP DOI BibTeX RDF	synthesis, minimization, boolean satisfiability, reversible logic, quantum circuits
18	Ali Ebnenasir	Diconic addition of failsafe fault-tolerance.	ASE	2007	DBLP DOI BibTeX RDF	addition of fault-tolerance, formal methods, satisfiability, divide and conquer
18	Heribert Vollmer	Computational Complexity of Constraint Satisfaction.	CiE	2007	DBLP DOI BibTeX RDF	computational complexity, constraint satisfaction, polymorphism, clone, Galois connection, satisfiability problems
18	Stefan Porschen	A CNF Formula Hierarchy over the Hypercube.	Australian Conference on Artificial Intelligence	2007	DBLP DOI BibTeX RDF	hypercube formula, variable closure, satisfiability, hypergraph, transversal
18	Deborah East, Miroslaw Truszczynski	Predicate-calculus-based logics for modeling and solving search problems.	ACM Trans. Comput. Log.	2006	DBLP DOI BibTeX RDF	pseudo-Boolean constraints, constraints, Satisfiability, search problems, predicate logic
18	Paolo Liberatore	Complexity results on DPLL and resolution.	ACM Trans. Comput. Log.	2006	DBLP DOI BibTeX RDF	Davis-Putnam, NP-completeness, propositional satisfiability
18	Domagoj Babic, Jesse D. Bingham, Alan J. Hu	B-Cubing: New Possibilities for Efficient SAT-Solving.	IEEE Trans. Computers	2006	DBLP DOI BibTeX RDF	SAT, Boolean satisfiability, search space pruning
18	Manolis Koubarakis, Spiros Skiadopoulos, Christos Tryfonopoulos	Logic and Computational Complexity for Boolean Information Retrieval.	IEEE Trans. Knowl. Data Eng.	2006	DBLP DOI BibTeX RDF	Boolean information retrieval, computational complexity, query languages, data models, satisfiability, proximity, entailment
18	Olivier Bailleux, Pierre Marquis	Some Computational Aspects of distance-sat.	J. Autom. Reason.	2006	DBLP DOI BibTeX RDF	computational complexity, satisfiability
18	Michael S. Livstone, Ron Weiss, Laura F. Landweber	Automated Design and Programming of a Microfluidic DNA Computer.	Nat. Comput.	2006	DBLP DOI BibTeX RDF	algorithm, NP-complete, satisfiability, DNA computing, microfluidics, Boolean expression
18	Hilderick A. van der Meiden, Willem F. Bronsvoort	Solving topological constraints for declarative families of objects.	Symposium on Solid and Physical Modeling	2006	DBLP DOI BibTeX RDF	families of objects, parametric and feature-based modelling, satisfiability, declarative specification, topological constraints
18	Sean Safarpour, Andreas G. Veneris, Gregg Baeckler, Richard Yuan	Efficient SAT-based Boolean matching for FPGA technology mapping.	DAC	2006	DBLP DOI BibTeX RDF	FPGA technology mapping, Boolean satisfiability, Boolean matching
18	Matti Järvisalo, Tommi A. Junttila, Ilkka Niemelä	Unrestricted vs restricted cut in a tableau method for Boolean circuits.	Ann. Math. Artif. Intell.	2005	DBLP DOI BibTeX RDF	cut rule, satisfiability, proof complexity, Boolean circuits, DPLL
18	Inês Lynce, João Marques-Silva 0001	Efficient data structures for backtrack search SAT solvers.	Ann. Math. Artif. Intell.	2005	DBLP DOI BibTeX RDF	backtrack search, propositional satisfiability
18	Paul W. Purdom, Daniel Le Berre, Laurent Simon	A parsimony tree for the SAT2002 competition.	Ann. Math. Artif. Intell.	2005	DBLP DOI BibTeX RDF	empirical evaluation, parsimony, Boolean satisfiability (SAT)
18	Laurent Simon, Daniel Le Berre, Edward A. Hirsch	The SAT2002 competition.	Ann. Math. Artif. Intell.	2005	DBLP DOI BibTeX RDF	empirical evaluation, Boolean satisfiability (SAT)
18	Renato Bruni	On exact selection of minimally unsatisfiable subformulae.	Ann. Math. Artif. Intell.	2005	DBLP DOI BibTeX RDF	infeasibility analysis, MUS selection, (Un)Satisfiability
18	Edward A. Hirsch, Arist Kojevnikov	UnitWalk: A new SAT solver that uses local search guided by unit clause elimination.	Ann. Math. Artif. Intell.	2005	DBLP DOI BibTeX RDF	local search, empirical evaluation, Boolean satisfiability
18	Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Francis Zane	An improved exponential-time algorithm for k-SAT.	J. ACM	2005	DBLP DOI BibTeX RDF	CNF satisfiability, randomized algorithms
18	Maher N. Mneimneh, Karem A. Sakallah	Principles of Sequential-Equivalence Verification.	IEEE Des. Test Comput.	2005	DBLP DOI BibTeX RDF	conceptual and algorithmic approache, ATPG, sequential-equivalence checking, satisfiability solvers
18	Stefan Szeider	Backdoor Sets for DLL Subsolvers.	J. Autom. Reason.	2005	DBLP DOI BibTeX RDF	unit propagation, pure literal elimination, backdoor sets, W[P]-completeness, satisfiability, parameterized complexity
18	John Thornton 0001	Clause Weighting Local Search for SAT.	J. Autom. Reason.	2005	DBLP DOI BibTeX RDF	local search, constraint satisfaction, satisfiability
18	Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson	Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas.	J. Autom. Reason.	2005	DBLP DOI BibTeX RDF	DPLL algorithms, satisfiability
18	Alexander Nareyek, Eugene C. Freuder, Robert Fourer, Enrico Giunchiglia, Robert P. Goldman, Henry A. Kautz, Jussi Rintanen, Austin Tate	Constraints and AI Planning.	IEEE Intell. Syst.	2005	DBLP DOI BibTeX RDF	planning, integer programming, constraint programming, propositional satisfiability
18	Priscila Machado Vieira Lima, Glaucia C. Pereira, M. Mariela Morveli-Espinoza, Felipe M. G. França	Mapping and Combining Combinatorial Problems into Energy Landscapes via Pseudo-Boolean Constraints.	BVAI	2005	DBLP DOI BibTeX RDF	Higher-order Networks, Pseudo-Boolean Constraints, Simulated Annealing, TSP, Satisfiability, Graph Colouring
18	Tetsuya Iizuka, Makoto Ikeda, Kunihiro Asada	Exact minimum-width transistor placement without dual constraint for CMOS cells.	ACM Great Lakes Symposium on VLSI	2005	DBLP DOI BibTeX RDF	exact minimum-width transistor placement, non-dual, boolean satisfiability
18	Sean Safarpour, Görschwin Fey, Andreas G. Veneris, Rolf Drechsler	Utilizing don't care states in SAT-based bounded sequential problems.	ACM Great Lakes Symposium on VLSI	2005	DBLP DOI BibTeX RDF	don't care states, unreachable states, satisfiability, bounded model checking, sequential equivalence checking
18	Andrew C. Ling, Deshanand P. Singh, Stephen Dean Brown	FPGA technology mapping: a study of optimality.	DAC	2005	DBLP DOI BibTeX RDF	resynthesis optimization, FPGA, boolean satisfiability, lookup table, cone
18	Ganapathy Parthasarathy, Madhu K. Iyer, Kwang-Ting Cheng, Forrest Brewer	Structural search for RTL with predicate learning.	DAC	2005	DBLP DOI BibTeX RDF	learning, satisfiability, interval arithmetic, predicate abstraction
18	Oliver Kullmann	Upper and Lower Bounds on the Complexity of Generalised Resolution and Generalised Constraint Satisfaction Problems.	Ann. Math. Artif. Intell.	2004	DBLP DOI BibTeX RDF	satisfiability problem (SAT), systems with partial instantiation, generalised resolution, lower bounds for resolution, upper bounds for SAT algorithms, automatisation of proof systems, generalised input resolution, generalised width restricted resolution, induced width of constraint satisfaction problems, constraint satisfaction problems, propositional logic, polynomial time hierarchies
18	Fumiaki Okushi, Allen Van Gelder	Persistent and Quasi-Persistent Lemmas in Propositional Model Elimination.	Ann. Math. Artif. Intell.	2004	DBLP DOI BibTeX RDF	Modoc, lemmas, satisfiability, resolution, refutation, Model Elimination
18	Iouliia Skliarova, António de Brito Ferrari	Reconfigurable Hardware SAT Solvers: A Survey of Systems.	IEEE Trans. Computers	2004	DBLP DOI BibTeX RDF	FPGA, reconfigurable computing, hardware acceleration, Boolean satisfiability
18	Mehdi Baradaran Tahoori	Application-Specific Bridging Fault Testing of FPGAs.	J. Electron. Test.	2004	DBLP DOI BibTeX RDF	field-programmable gate array, interconnect, satisfiability, bridging fault