Equality-based binary resolution
Journal of the ACM (JACM)
Experiments with a generic reduction computer
ACM SIGACT News
Inference with path resolution and semantic graphs
Journal of the ACM (JACM)
Many hard examples for resolution
Journal of the ACM (JACM)
Stratification and knowledge base management
Journal of Symbolic Computation
Boolean unification - The story so far
Journal of Symbolic Computation
Logic programming as constructivism: a formalization and its application to databases
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
An incremental method for generating prime implicants/implicates
Journal of Symbolic Computation
Proceedings of the 1990 ACM/IEEE conference on Supercomputing
Efficient local search for very large-scale satisfiability problems
ACM SIGART Bulletin
Communications of the ACM
Dissolution: making paths vanish
Journal of the ACM (JACM)
Z-module reasoning: an equality-oriented proving method with built-in ring axioms
Journal of the ACM (JACM)
Optimal Reconfiguration Algorithms for Real-Time Fault-Tolerant Processor Arrays
IEEE Transactions on Parallel and Distributed Systems
Knowledge compilation and theory approximation
Journal of the ACM (JACM)
ICS '96 Proceedings of the 10th international conference on Supercomputing
GRASP—a new search algorithm for satisfiability
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
DAC '98 Proceedings of the 35th annual Design Automation Conference
Watermarking techniques for intellectual property protection
DAC '98 Proceedings of the 35th annual Design Automation Conference
An intermediate design language and its analysis
SIGSOFT '98/FSE-6 Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering
Algorithms for propositional KB approximation
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Logical representation and computation of optimal decisions in a qualitative setting
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Experimenting with power default reasoning
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
FPGA '99 Proceedings of the 1999 ACM/SIGDA seventh international symposium on Field programmable gate arrays
GRASP: A Search Algorithm for Propositional Satisfiability
IEEE Transactions on Computers
Symbolic model checking using SAT procedures instead of BDDs
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
A massively-parallel easily-scalable satisfiability solver using reconfigurable hardware
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Detecting false timing paths: experiments on PowerPC microprocessors
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
On the satisfiability and maximum satisfiability of random 3-CNF formulas
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A new method for consequence finding and compilation in restricted languages
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Sacre: a constraint satisfaction problem based theorem prover
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Theorem-Proving on the Computer
Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Automatic Theorem Proving With Renamable and Semantic Resolution
Journal of the ACM (JACM)
Properties of Programs and the First-Order Predicate Calculus
Journal of the ACM (JACM)
The Unit Proof and the Input Proof in Theorem Proving
Journal of the ACM (JACM)
Fuzzy Logic and the Resolution Principle
Journal of the ACM (JACM)
Automatic Theorem Proving with Built-in Theories Including Equality, Partial Ordering, and Sets
Journal of the ACM (JACM)
A Unifying View of Some Linear Herbrand Procedures
Journal of the ACM (JACM)
A New Class of Automated Theorem-Proving Algorithms
Journal of the ACM (JACM)
Parallel genetic algorithm to solve the satisfiability problem
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Direct finite first-order model generation with negative constraint propagation heuristic
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Boolean satisfiability in electronic design automation
Proceedings of the 37th Annual Design Automation Conference
Alcoa: the alloy constraint analyzer
Proceedings of the 22nd international conference on Software engineering
A BDD-based satisfiability infrastructure using the unate recursive paradigm
DATE '00 Proceedings of the conference on Design, automation and test in Europe
On using satisfiability-based pruning techniques in covering algorithms
DATE '00 Proceedings of the conference on Design, automation and test in Europe
QuickCheck: a lightweight tool for random testing of Haskell programs
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Automating first-order relational logic
SIGSOFT '00/FSE-8 Proceedings of the 8th ACM SIGSOFT international symposium on Foundations of software engineering: twenty-first century applications
An Assessment of Techniques for Proving Program Correctness
ACM Computing Surveys (CSUR)
Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
LPSAT: a unified approach to RTL satisfiability
Proceedings of the conference on Design, automation and test in Europe
Multi-clock path analysis using propositional satisfiability
ASP-DAC '00 Proceedings of the 2000 Asia and South Pacific Design Automation Conference
A machine program for theorem-proving
Communications of the ACM
Circuit-based Boolean Reasoning
Proceedings of the 38th annual Design Automation Conference
A sharp threshold in proof complexity
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Accelerating boolean satisfiability through application specific processing
Proceedings of the 14th international symposium on Systems synthesis
Rigorous results for random (2 + p)-SAT
Theoretical Computer Science - Phase transitions in combinatorial problems
Results related to threshold phenomena research in satisfiability: lower bounds
Theoretical Computer Science - Phase transitions in combinatorial problems
Satisfiability models and algorithms for circuit delay computation
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Size space tradeoffs for resolution
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Bounded Model Checking Using Satisfiability Solving
Formal Methods in System Design
Algorithms for quantified Boolean formulas
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Introduction to logic-based artificial intelligence
Logic-based artificial intelligence
SAT and ATPG: algorithms for Boolean decision problems
Logic Synthesis and Verification
Solving Satisfiability Problems Using Elliptic Approximations. A Note on Volumes and Weights
Annals of Mathematics and Artificial Intelligence
An Overview of Backtrack Search Satisfiability Algorithms
Annals of Mathematics and Artificial Intelligence
Average case results for satisfiability algorithms under the random-clause-width model
Annals of Mathematics and Artificial Intelligence
Automating the synthesis of decision procedures in a constructive metatheory
Annals of Mathematics and Artificial Intelligence
Boosting complete techniques thanks to local search methods
Annals of Mathematics and Artificial Intelligence
An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF
Annals of Mathematics and Artificial Intelligence
Annals of Mathematics and Artificial Intelligence
Parallel cooperative propositional theorem proving
Annals of Mathematics and Artificial Intelligence
A propositional theorem prover to solve planning and other problems
Annals of Mathematics and Artificial Intelligence
A taxonomy of parallel strategies for deduction
Annals of Mathematics and Artificial Intelligence
Some interesting research directions in satisfiability
Annals of Mathematics and Artificial Intelligence
CLIN-S - A Semantically Guided First-Order Theorem Prover
Journal of Automated Reasoning
LINUS - A Link Instantion Prover with Unit Support
Journal of Automated Reasoning
Ordered Semantic Hyper-Linking
Journal of Automated Reasoning
Autarky Pruning in Propositional Model Elimination Reduces Failure Redundancy
Journal of Automated Reasoning
Positive Unit Hyperresolution Tableaux and Their Application to Minimal Model Generation
Journal of Automated Reasoning
A SAT Solver Using Reconfigurable Hardware and Virtual Logic
Journal of Automated Reasoning
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems
Journal of Automated Reasoning
The Propositional Formula Checker HeerHugo
Journal of Automated Reasoning
Proving Consistency Assertions for Automotive Product Data Management
Journal of Automated Reasoning
Logical Cryptanalysis as a SAT Problem
Journal of Automated Reasoning
Guided Local Search for Solving SAT and Weighted MAX-SAT Problems
Journal of Automated Reasoning
Implementing the Davis–Putnam Method
Journal of Automated Reasoning
Resolution versus Search: Two Strategies for SAT
Journal of Automated Reasoning
New Worst-Case Upper Bounds for SAT
Journal of Automated Reasoning
Nonsystematic Search and No-Good Learning
Journal of Automated Reasoning
Parallelization of a Hyper-Linking–Based Theorem Prover
Journal of Automated Reasoning
Partial Instantiation Methods for Inference in First-Order Logic
Journal of Automated Reasoning
Proving Unsatisfiability of CNFs Locally
Journal of Automated Reasoning
SAT-Based Decision Procedures for Classical Modal Logics
Journal of Automated Reasoning
Trace-Based Methods for Solving Nonlinear Global Optimization and Satisfiability Problems
Journal of Global Optimization
A Discrete Lagrangian-Based Global-SearchMethod for Solving Satisfiability Problems
Journal of Global Optimization
Efficient Algorithms for the Inference of Minimum Size DFAs
Machine Learning
Run-time performance optimization of an FPGA-based deduction engine for SAT solvers
ACM Transactions on Design Automation of Electronic Systems (TODAES)
An algorithm based on tabu search for satisfiability problem
Journal of Computer Science and Technology
A Tutorial on Stålmarck‘s Proof Procedure for PropositionalLogic
Formal Methods in System Design - Special issue on formal methods for computer-added design
The Automation of Proof: A Historical and Sociological Exploration
IEEE Annals of the History of Computing
Convergence Properties of Optimization Algorithms for the SAT Problem
IEEE Transactions on Computers
IEEE Transactions on Knowledge and Data Engineering
Global Optimization for Satisfiability (SAT) Problem
IEEE Transactions on Knowledge and Data Engineering
Solving Satisfiability Via Boltzmann Machines
IEEE Transactions on Pattern Analysis and Machine Intelligence
Complete on average Boolean satisfiability
Journal of Complexity
Mini-buckets: A general scheme for bounded inference
Journal of the ACM (JACM)
Backtrack searching in the presence of symmetry
Nordic Journal of Computing
Logical Inference of Horn Clauses in Petri Net Models
IEEE Transactions on Knowledge and Data Engineering
On the Accuracy and Running Time of GSAT
EPIA '99 Proceedings of the 9th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
The Impact of Branching Heuristics in Propositional Satisfiability Algorithms
EPIA '99 Proceedings of the 9th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
Towards Provably Complete Stochastic Search Algorithms for Satisfiability
EPIA '01 Proceedings of the10th Portuguese Conference on Artificial Intelligence on Progress in Artificial Intelligence, Knowledge Extraction, Multi-agent Systems, Logic Programming and Constraint Solving
Compiling Problem Specifications into SAT
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
A Service-Based Agent Framework for Distributed Symbolic Computation
HPCN Europe 2000 Proceedings of the 8th International Conference on High-Performance Computing and Networking
Automated Theorem Proving Proof and Model Generation with Disconnection Tableaux
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
NP-SPEC: An Executable Specification Language for Solving All Problems in NP
PADL '99 Proceedings of the First International Workshop on Practical Aspects of Declarative Languages
Checking Consistency of Database Constraints: a Logical Basis
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Complexity Issues in the Davis and Putnam Scheme
AIMSA '00 Proceedings of the 9th International Conference on Artificial Intelligence: Methodology, Systems, and Applications
A Tutorial on Stålmarcks's Proof Procedure for Propositional Logic
FMCAD '98 Proceedings of the Second International Conference on Formal Methods in Computer-Aided Design
A Fixpoint Based Encoding for Bounded Model Checking
FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
A DPLL-Based Calculus for Ground Satisfiability Modulo Theories
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Improved Exact Algorithms for MAX-SAT
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Symbolic Model Checking without BDDs
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Satisfiability Checking Using Boolean Expression Diagrams
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Shape Analysis through Predicate Abstraction and Model Checking
VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Deploying Distributed State Information in Mobile Agent Systems
CooplS '01 Proceedings of the 9th International Conference on Cooperative Information Systems
Pruning Techniques for the SAT-Based Bounded Model Checking Problem
CHARME '01 Proceedings of the 11th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
A Compressed Breadth-First Search for Satisfiability
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Some Remarks on Boolean Constraint Propagation
Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
PRICAI '02 Proceedings of the 7th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence
Formal Verification Methods for Industrial Hardware Design
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
Automatic Generation of Implied Clauses for SAT
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Recovering and Exploiting Structural Knowledge from CNF Formulas
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
Semi-formal Bounded Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
The Quest for Efficient Boolean Satisfiability Solvers
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
A Space-Efficient Randomized DNA Algorithm for k-SAT
DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
On the Automatizability of Resolution and Related Propositional Proof Systems
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Run-Time Performance Optimization of an FPGA-Based Deduction Engine for SAT Solvers
FPL '01 Proceedings of the 11th International Conference on Field-Programmable Logic and Applications
Replacement Rules with Definition Detection
Selected Papers from Automated Deduction in Classical and Non-Classical Logics
On Logical Method for Counting Dedekind Numbers
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Solving the Satisfiability Problem through Boolean Networks
AI*IA '99 Proceedings of the 6th Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence
Applying the Davis-Putnam Procedure to Non-clausal Formulas
AI*IA '99 Proceedings of the 6th Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence
The SAT-Based Approach for Classical Modal Logics
AI*IA '99 Proceedings of the 6th Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence
The Non-Recursive Power of Erroneous Computation
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
AVAL: An Enumerative Method for SAT
CL '00 Proceedings of the First International Conference on Computational Logic
Journal of Symbolic Computation
SAT and ATPG: Boolean engines for formal hardware verification
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
ATPG-based logic synthesis: an overview
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
A fast pseudo-boolean constraint solver
Proceedings of the 40th annual Design Automation Conference
SAT-based unbounded symbolic model checking
Proceedings of the 40th annual Design Automation Conference
Inference methods for a pseudo-boolean satisfiability solver
Eighteenth national conference on Artificial intelligence
Combining inference and search for the propositional satisfiability problem
Eighteenth national conference on Artificial intelligence
First-order logic Davis-Putnam-Logemann-Loveland procedure
Exploring artificial intelligence in the new millennium
A Scalable, Loadable Custom Programmable Logic Device for Solving Boolean Satisfiability Problems
FCCM '00 Proceedings of the 2000 IEEE Symposium on Field-Programmable Custom Computing Machines
Examples of hard tautologies in the propositional calculus
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
On the validity and complexity of bounded resolution
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
On the lengths of proofs in the propositional calculus (Preliminary Version)
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
The predicate elimination strategy in theorem proving
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Instance-Specific Accelerators for Minimum Covering
The Journal of Supercomputing
Formal Verification Using Bounded Model Checking: SAT versus Sequential ATPG Engines
VLSID '03 Proceedings of the 16th International Conference on VLSI Design
A complete adaptive algorithm for propositional satisfiability
Discrete Applied Mathematics
Equivalence Checking Combining a Structural SAT-Solver, BDDs, and Simulation
ICCD '00 Proceedings of the 2000 IEEE International Conference on Computer Design: VLSI in Computers & Processors
Overcoming the Christmas Tree Syndrome
ICTAI '99 Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence
Solving Hard Satisfiability Problems: A Unified Algorithm Based on Discrete Lagrange Multipliers
ICTAI '99 Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence
Principles of inverse computation and the Universal resolving algorithm
The essence of computation
From type inference to configuration
The essence of computation
Optimal utterances in dialogue protocols
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Resolution lower bounds for the weak functional pigeonhole principle
Theoretical Computer Science - Logic and complexity in computer science
Contingent planning under uncertainty via stochastic satisfiability
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
The description logic handbook
Solving Satisfiability in Combinational Circuits
IEEE Design & Test
Approximating minimal unsatisfiable subformulae by means of adaptive core search
Discrete Applied Mathematics - The renesse issue on satisfiability
How to fake an RSA signature by encoding modular root finding as a SAT problem
Discrete Applied Mathematics - The renesse issue on satisfiability
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT
Discrete Applied Mathematics - The renesse issue on satisfiability
Worst-case study of local search for MAX-k-SAT
Discrete Applied Mathematics - The renesse issue on satisfiability
On the structure of some classes of minimal unsatisfiable formulas
Discrete Applied Mathematics - The renesse issue on satisfiability
Equivalent literal propagation in the DLL procedure
Discrete Applied Mathematics - The renesse issue on satisfiability
A satisfiability procedure for quantified boolean formulae
Discrete Applied Mathematics - The renesse issue on satisfiability
Formal methods for the validation of automotive product configuration data
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
Accelerating Bounded Model Checking of Safety Properties
Formal Methods in System Design
Herbrand Award Acceptance Speech
Journal of Automated Reasoning
Annals of Mathematics and Artificial Intelligence
Satisfiability-Based Algorithms for Boolean Optimization
Annals of Mathematics and Artificial Intelligence
Persistent and Quasi-Persistent Lemmas in Propositional Model Elimination
Annals of Mathematics and Artificial Intelligence
Enhancing disjunctive logic programming systems by SAT checkers
Artificial Intelligence
On sufficient conditions for unsatisfiability of random formulas
Journal of the ACM (JACM)
Combining satisfiability techniques from AI and OR
The Knowledge Engineering Review
A Comparison between SAT and CSP Techniques
Constraints
On the automatizability of resolution and related propositional proof systems
Information and Computation
A sharp threshold in proof complexity yields lower bounds for satisfiability search
Journal of Computer and System Sciences - STOC 2001
A Comparative Study of Two Boolean Formulations of FPGA Detailed Routing Constraints
IEEE Transactions on Computers
An efficient finite-domain constraint solver for circuits
Proceedings of the 41st annual Design Automation Conference
CAMA: A Multi-Valued Satisfiability Solver
Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
Iterative Abstraction using SAT-based BMC with Proof Analysis
Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
Algorithms for four variants of the exact satisfiability problem
Theoretical Computer Science
DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
A logical toolbox for knowledge approximation
TARK '01 Proceedings of the 8th conference on Theoretical aspects of rationality and knowledge
Approximate reasoning and non-omniscient agents
TARK '92 Proceedings of the 4th conference on Theoretical aspects of reasoning about knowledge
Counting for Satisfiability by Inverting Resolution
Artificial Intelligence Review
On SAT Instance Classes and a Method for Reliable Performance Experiments with SAT Solvers
Annals of Mathematics and Artificial Intelligence
Annals of Mathematics and Artificial Intelligence
Efficient Data Structures for Backtrack Search SAT Solvers
Annals of Mathematics and Artificial Intelligence
Toward Leaner Binary-Clause Reasoning in a Satisfiability Solver
Annals of Mathematics and Artificial Intelligence
Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
Journal of Computer and System Sciences
An EFSM-based approach for functional ATPG
GLSVLSI '05 Proceedings of the 15th ACM Great Lakes symposium on VLSI
IEEE Intelligent Systems
Resolution cannot polynomially simulate compressed-BFS
Annals of Mathematics and Artificial Intelligence
Journal of Algorithms
A Parallelization Scheme Based on Work Stealing for a Class of SAT Solvers
Journal of Automated Reasoning
Efficient SAT solving: beyond supercubes
Proceedings of the 42nd annual Design Automation Conference
Prime clauses for fast enumeration of satisfying assignments to boolean circuits
Proceedings of the 42nd annual Design Automation Conference
Lemma Exchange in a Microcontroller Based Parallel SAT Solver
ISVLSI '05 Proceedings of the IEEE Computer Society Annual Symposium on VLSI: New Frontiers in VLSI Design
Intelligent search strategies based on adaptive Constraint Handling Rules
Theory and Practice of Logic Programming
MaxSolver: an efficient exact algorithm for (weighted) maximum satisfiability
Artificial Intelligence
Compiling problem specification into SAT
Artificial Intelligence - Special volume on reformulation
Unrestricted vs restricted cut in a tableau method for Boolean circuits
Annals of Mathematics and Artificial Intelligence
Functional test generation based on word-level SAT
Journal of Systems Architecture: the EUROMICRO Journal
Guiding CNF-SAT search via efficient constraint partitioning
Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design
Integrating CNF and BDD based SAT solvers
HLDVT '03 Proceedings of the Eighth IEEE International Workshop on High-Level Design Validation and Test Workshop
Logic transformation and coding theory-based frameworks for Boolean satisfiability
HLDVT '03 Proceedings of the Eighth IEEE International Workshop on High-Level Design Validation and Test Workshop
Complexity results on DPLL and resolution
ACM Transactions on Computational Logic (TOCL)
Validating the result of a Quantified Boolean Formula (QBF) solver: theory and practice
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
EFSM Manipulation to Increase High-Level ATPG Effectiveness
ISQED '06 Proceedings of the 7th International Symposium on Quality Electronic Design
An effective heuristic algorithm for the maximum satisfiability problem
Applied Intelligence
Narrow proofs may be spacious: separating space and width in resolution
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The probabilistic analysis of a greedy satisfiability algorithm
Random Structures & Algorithms
Conformant planning via heuristic forward search: a new approach
Artificial Intelligence
Complexities of homomorphism and isomorphism for definite logic programs
Journal of Computer Science and Technology
Fast illegal state identification for improving SAT-based induction
Proceedings of the 43rd annual Design Automation Conference
Type-safe modular hash-consing
Proceedings of the 2006 workshop on ML
Symbolic Techniques in Satisfiability Solving
Journal of Automated Reasoning
Backdoor Sets for DLL Subsolvers
Journal of Automated Reasoning
Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas
Journal of Automated Reasoning
Heuristic-Based Backtracking Relaxation for Propositional Satisfiability
Journal of Automated Reasoning
B-Cubing: New Possibilities for Efficient SAT-Solving
IEEE Transactions on Computers
IEEE Transactions on Computers
Propositional Satisfiability and Constraint Programming: A comparative survey
ACM Computing Surveys (CSUR)
Embedded software verification using symbolic execution and uninterpreted functions
International Journal of Parallel Programming
Counting models for 2SAT and 3SAT formulae
Theoretical Computer Science
Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms
ACM Transactions on Algorithms (TALG)
Tools for modeling and solving search problems
AI Communications
Substitutions into propositional tautologies
Information Processing Letters
Density condensation of boolean formulas
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Learning action models from plan examples using weighted MAX-SAT
Artificial Intelligence
A New Partial Semantics for Disjunctive Deductive Databases
Fundamenta Informaticae
Evolving combinatorial problem instances that are difficult to solve
Evolutionary Computation
Fast congruence closure and extensions
Information and Computation
Protocols for RFID tag/reader authentication
Decision Support Systems
Paraconsistent reasoning and preferential entailments by signed quantified Boolean formulae
ACM Transactions on Computational Logic (TOCL)
Bounded Model Checking with Parametric Data Structures
Electronic Notes in Theoretical Computer Science (ENTCS)
Interpolant Learning and Reuse in SAT-Based Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Artificial Intelligence
Discrete Applied Mathematics
Random backtracking in backtrack search algorithms for satisfiability
Discrete Applied Mathematics
Generalizing DPLL and satisfiability for equalities
Information and Computation
Alembic: an efficient algorithm for CNF preprocessing
Proceedings of the 44th annual Design Automation Conference
On resolution proofs for combinational equivalence
Proceedings of the 44th annual Design Automation Conference
Exploiting multivalued knowledge in variable selection heuristics for SAT solvers
Annals of Mathematics and Artificial Intelligence
Visualizing SAT Instances and Runs of the DPLL Algorithm
Journal of Automated Reasoning
Optimizing Terminological Reasoning for Expressive Description Logics
Journal of Automated Reasoning
New upper bound for the #3-SAT problem
Information Processing Letters
A Resolution-Based Proof Procedure Using Deletion-Directed Search
IEEE Transactions on Computers
A Semantically Guided Deductive System for Automatic Theorem Proving
IEEE Transactions on Computers
Stimulus generation for constrained random simulation
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
A logical approach to efficient Max-SAT solving
Artificial Intelligence
The model evolution calculus as a first-order DPLL method
Artificial Intelligence
Solving quantified constraint satisfaction problems
Artificial Intelligence
Formula dissection: A parallel algorithm for constraint satisfaction
Computers & Mathematics with Applications
A Methodology for Handling Complex Functional Constraints for Large Industrial Designs
Journal of Electronic Testing: Theory and Applications
Solving 3-SAT using constraint programming and fail detection
AIKED'05 Proceedings of the 4th WSEAS International Conference on Artificial Intelligence, Knowledge Engineering Data Bases
Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs
Journal of Discrete Algorithms
A Resolution Calculus with Shared Literals
Fundamenta Informaticae
Davis-Putnam Style Rules for Deciding Property S
Fundamenta Informaticae
A Propositional Programming Environment for Linear Algebra
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
Towards an optimal separation of space and length in resolution
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Preprocessing for controlled query evaluation with availability policy
Journal of Computer Security - 20th Annual IFIP WG 11.3 Working Conference on Data and Applications Security (DBSec'06)
Model checking with Boolean Satisfiability
Journal of Algorithms
Exact Max 2-Sat: Easier and Faster
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Algorithms for Counting 2-Sat Solutions and Colorings with Applications
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Logical Engineering with Instance-Based Methods
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Computational Discovery in Pure Mathematics
Computational Discovery of Scientific Knowledge
Early History and Perspectives of Automated Deduction
KI '07 Proceedings of the 30th annual German conference on Advances in Artificial Intelligence
From KSAT to Delayed Theory Combination: Exploiting DPLL Outside the SAT Domain
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Theorem Proving for Verification (Invited Tutorial)
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
A New Empirical Study of Weak Backdoors
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Incorporating Learning in Grid-Based Randomized SAT Solving
AIMSA '08 Proceedings of the 13th international conference on Artificial Intelligence: Methodology, Systems, and Applications
Conditioning probabilistic databases
Proceedings of the VLDB Endowment
Planning as model checking: the performance of ProB vs NuSMV
Proceedings of the 2008 annual research conference of the South African Institute of Computer Scientists and Information Technologists on IT research in developing countries: riding the wave of technology
Logical Compilation of Bayesian Networks with Discrete Variables
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
The unit preference strategy in theorem proving
AFIPS '64 (Fall, part I) Proceedings of the October 27-29, 1964, fall joint computer conference, part I
Experiments with a theorem-utilizing program
AFIPS '64 (Spring) Proceedings of the April 21-23, 1964, spring joint computer conference
A comparative runtime analysis of heuristic algorithms for satisfiability problems
Artificial Intelligence
QuBIS: An (In)complete Solver for Quantified Boolean Formulas
MICAI '08 Proceedings of the 7th Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
Strength Two Covering Arrays Construction Using a SAT Representation
MICAI '08 Proceedings of the 7th Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
Efficient Generation of Unsatisfiability Proofs and Cores in SAT
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Proceedings of the 18th International Workshop on Network and Operating Systems Support for Digital Audio and Video
A generative power-law search tree model
Computers and Operations Research
Journal of Automated Reasoning
Here's the Beef: Answer Set Programming !
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Present and Future of Practical SAT Solving
Complexity of Constraints
Checking the quality of clinical guidelines using automated reasoning tools
Theory and Practice of Logic Programming
Extended asp tableaux and rule redundancy in normal logic programs1
Theory and Practice of Logic Programming
Message-passing and local heuristics as decimation strategies for satisfiability
Proceedings of the 2009 ACM symposium on Applied Computing
Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Boolean satisfiability from theoretical hardness to practical success
Communications of the ACM - A Blind Person's Interaction with Technology
Formalization and Implementation of Modern SAT Solvers
Journal of Automated Reasoning
A measure & conquer approach for the analysis of exact algorithms
Journal of the ACM (JACM)
Journal of Experimental & Theoretical Artificial Intelligence
Verification Techniques for System-Level Design
Verification Techniques for System-Level Design
Solution Enumeration for Projected Boolean Search Problems
CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Reconfigurable Computing: The Theory and Practice of FPGA-Based Computation
Reconfigurable Computing: The Theory and Practice of FPGA-Based Computation
On the Multimodal Logic of Elementary Normative Systems
Proceedings of the 2007 conference on Artificial Intelligence Research and Development
Boolean Propagation Based on Literals for Quantified Boolean Formulae
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Vivifying Propositional Clausal Formulae
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Generalizing DPLL to Richer Logics
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Cardinality Networks and Their Applications
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Dynamic Symmetry Breaking by Simulating Zykov Contraction
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Extending SAT Solvers to Cryptographic Problems
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
A Novel Approach to Combine a SLS- and a DPLL-Solver for the Satisfiability Problem
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Instance-Based Selection of Policies for SAT Solvers
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Beyond CNF: A Circuit-Based QBF Solver
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Combined Decision Techniques for the Existential Theory of the Reals
Calculemus '09/MKM '09 Proceedings of the 16th Symposium, 8th International Conference. Held as Part of CICM '09 on Intelligent Computer Mathematics
Automated deduction for verification
ACM Computing Surveys (CSUR)
Issues in using model checkers for test case generation
Journal of Systems and Software
A two-step hierarchical algorithm for model-based diagnosis
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
An Improved SAT Algorithm in Terms of Formula Length
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Foundations of r-contiguous matching in negative selection for anomaly detection
Natural Computing: an international journal
Applying GSAT to non-clausal formulas
Journal of Artificial Intelligence Research
Old resolution meets modern SLS
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Refutation by randomised general resolution
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
On the power of top-down branching heuristics
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Mini-buckets: a general scheme for generating approximations in automated reasoning
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
From approximate to optimal solutions: constructing pruning and propagation rules
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
On reachability, relevance, and resolution in the planning as satisfiability approach
Journal of Artificial Intelligence Research
Propositional independence: formula-variable independence and forgetting
Journal of Artificial Intelligence Research
Generalizing Boolean satisfiability I: background and survey of existing work
Journal of Artificial Intelligence Research
Towards understanding and harnessing the potential of clause learning
Journal of Artificial Intelligence Research
New inference rules for Max-SAT
Journal of Artificial Intelligence Research
SATzilla: portfolio-based algorithm selection for SAT
Journal of Artificial Intelligence Research
A unifying framework for structural properties of CSPs: definitions, complexity, tractabilit
Journal of Artificial Intelligence Research
Learning partially observable deterministic action models
Journal of Artificial Intelligence Research
Solving #SAT and Bayesian inference with backtracking search
Journal of Artificial Intelligence Research
The good old Davis-Putnam procedure helps counting models
Journal of Artificial Intelligence Research
Fuzzy logic and the resolution principle
IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
Path resolution with link deletion
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
Domain-independent extensions to GSAT: solving large structured satisfiability problems
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Ten challenges in propositional reasoning and search
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Completeness theorems for semantic resolution in consequence-finding
IJCAI'69 Proceedings of the 1st international joint conference on Artificial intelligence
A semantically guided deductive system for automatic theorem-proving
IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
Deletion-directed search in resolution-based proof procedures
IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
GUNSAT: a greedy local search algorithm for unsatisfiability
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Theoretical analysis of Davis-Putnam procedure and propositional satisfiability
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Stochastic search and phase transitions: AI meets physics
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Computing bounds for fault tolerance using formal techniques
Proceedings of the 46th Annual Design Automation Conference
On the equivalence between answer sets and models of completion for nested logic programs
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A structure-based variable ordering heuristic for SAT
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Understanding the power of clause learning
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A Term Rewriting Technique for Decision Graphs
Electronic Notes in Theoretical Computer Science (ENTCS)
Journal of Artificial Intelligence Research
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Annals of Mathematics and Artificial Intelligence
SAT-Solving in Practice, with a Tutorial Example from Supervisory Control
Discrete Event Dynamic Systems
Compiling problem specifications into SAT
Artificial Intelligence - Special volume on reformulation
MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
Artificial Intelligence
Conformant planning via heuristic forward search: A new approach
Artificial Intelligence
Theory decision by decomposition
Journal of Symbolic Computation
Exact multiple-control toffoli network synthesis with SAT techniques
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Integrating systematic and local search paradigms: a new strategy for MaxSAT
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
An extension of the Davis-Putnam procedure and its application to preprocessing in SMT
Proceedings of the 7th International Workshop on Satisfiability Modulo Theories
ISICA '09 Proceedings of the 4th International Symposium on Advances in Computation and Intelligence
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Combining SAT Methods with Non-Clausal Decision Heuristics
Electronic Notes in Theoretical Computer Science (ENTCS)
An Incremental Algorithm to Check Satisfiability for Bounded Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
An Efficient Nelson-Oppen Decision Procedure for Difference Constraints over Rationals
Electronic Notes in Theoretical Computer Science (ENTCS)
A multi-agent framework for distributed theorem proving
Expert Systems with Applications: An International Journal
Theorem proving with variable-constrained resolution
Information Sciences: an International Journal
3-coloring in time O (1.3289n)
Journal of Algorithms
Improving GASAT by replacing tabu search by DLM and enhancing the best members
Artificial Intelligence Review
ACM Transactions on Computation Theory (TOCT)
Relaxed survey propagation for the weighted maximum satisfiability problem
Journal of Artificial Intelligence Research
Friends or foes? on planning as satisfiability and abstract CNF encodings
Journal of Artificial Intelligence Research
Practical algorithms for unsatisfiability proof and core generation in SAT solvers
AI Communications - Practical Aspects of Automated Reasoning
"Don't care" modeling: a logical framework for developing predictive system models
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
A Gröbner basis approach to CNF-formulae preprocessing
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
An online proof-producing decision procedure for mixed-integer linear arithmetic
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
The effect of Nogood recording in DPLL-CBJ SAT algorithms
ERCIM'02/CologNet'02 Proceedings of the 2002 Joint ERCIM/CologNet international conference on Constraint solving and constraint logic programming
A short survey of automated reasoning
AB'07 Proceedings of the 2nd international conference on Algebraic biology
Ant colony optimization with adaptive fitness function for satisfiability testing
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
A tutorial on satisfiability modulo theories
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Limitations of restricted branching in clause learning
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Towards robust CNF encodings of cardinality constraints
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Constraint-based agents: an architecture for constraint-based modeling and local-search-based reasoning for planning and scheduling in open and dynamic worlds
Implication-based approximating bounded model checking
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Phase transition and the computational complexity of generating r-contiguous detectors
ICARIS'07 Proceedings of the 6th international conference on Artificial immune systems
3-valued circuit SAT for STE with automatic refinement
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Challenges in satisfiability modulo theories
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Compressing propositional proofs by common subproof extraction
EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory
Leveraging belief propagation, backtrack search, and statistics for model counting
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Stochastic satisfiability modulo theories for non-linear arithmetic
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Computation of renameable Horn backdoors
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Improvements to hybrid incremental SAT algorithms
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Searching for autarkies to trim unsatisfiable clause sets
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Nenofex: expanding NNF for QBF solving
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Solving graph coloring problems using learning automata
EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization
Guided search and a faster deterministic algorithm for 3-SAT
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Solving NP-complete problems with quantum search
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Semantic matching: algorithms and implementation
Journal on data semantics IX
Formal Correctness Proof for DPLL Procedure
Informatica
A taxonomy of theorem-proving strategies
Artificial intelligence today
A survey of automated deduction
Artificial intelligence today
Putting abox updates into action
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Improving Coq propositional reasoning using a lazy CNF conversion scheme
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Combining instance generation and resolution
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Agent-oriented programming: from prolog to guarded definite clauses
Agent-oriented programming: from prolog to guarded definite clauses
On theorem proving for program checking: historical perspective and recent developments
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
An AIG-Based QBF-solver using SAT for preprocessing
Proceedings of the 47th Design Automation Conference
Functional verification of the IBM system z10 processor chipset
IBM Journal of Research and Development
Formal Methods in System Design
Making deduction more effective in SAT solvers
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
A new method for solving hard satisfiability problems
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Hard and easy distributions of SAT problems
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
An empirical study of greedy local search for satisfiability testing
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Variable-selection heuristics in local search for SAT
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Ordered semantic hyper linking
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Proceedings of the Conference on Design, Automation and Test in Europe
Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL
Theoretical Computer Science
Exploiting structure in an AIG based QBF solver
Proceedings of the Conference on Design, Automation and Test in Europe
An analytical approach to model adaptive video streaming and delivery
Proceedings of the 2010 ACM workshop on Advanced video streaming techniques for peer-to-peer networks and social networking
Theory-specific automated reasoning
A 25-year perspective on logic programming
SAT as a Programming Environment for Linear Algebra
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
An Empirical Study of QBF Encodings: from Treewidth Estimation to Useful Preprocessing
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Integration, the VLSI Journal
Grounding FO and FO(ID) with bounds
Journal of Artificial Intelligence Research
Approximate resolution of hard numbering problems
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
A second order parameter for 3SAT
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Combining local search and backtracking techniques for constraint satisfaction
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Compilation for critically constrained knowledge bases
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Artificial Intelligence
FCUBE: an efficient prover for intuitionistic propositional logic
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Resolution for stochastic Boolean satisfiability
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Journal of Automated Reasoning
Semiring-induced propositional logic: definition and basic algorithms
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Artificial Intelligence Review
The Mechanical Verification of a DPLL-Based Satisfiability Solver
Electronic Notes in Theoretical Computer Science (ENTCS)
Learning and using domain-specific heuristics in ASP solvers
AI Communications - Answer Set Programming
Graph k-colorability through threshold accepting and Davis-Putnam
CIMMACS'05 Proceedings of the 4th WSEAS international conference on Computational intelligence, man-machine systems and cybernetics
Sat-solving based on boundary point elimination
HVC'10 Proceedings of the 6th international conference on Hardware and software: verification and testing
Generalized craig interpolation for stochastic boolean satisfiability problems
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
QuickCheck: a lightweight tool for random testing of Haskell programs
ACM SIGPLAN Notices
Cause clue clauses: error localization using maximum satisfiability
Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
Beyond unit propagation in SAT solving
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Optimization methods for the partner units problem
CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Computing small unsatisfiable cores in satisfiability modulo theories
Journal of Artificial Intelligence Research
Exploiting structure in weighted model counting approaches to probabilistic inference
Journal of Artificial Intelligence Research
Parameterized complexity of DPLL search procedures
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Satisfiability of acyclic and almost acyclic CNF formulas (II)
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Generalized conflict-clause strengthening for satisfiability solvers
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Empirical study of the anatomy of modern sat solvers
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Exact algorithms for dominating set
Discrete Applied Mathematics
Cutting to the Chase solving linear integer arithmetic
CADE'11 Proceedings of the 23rd international conference on Automated deduction
On Deciding Satisfiability by Theorem Proving with Speculative Inferences
Journal of Automated Reasoning
On the relative efficiency of DPLL and OBDDs with axiom and join
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
A more efficient BDD-based QBF solver
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Monte-carlo style UCT search for boolean satisfiability
AI*IA'11 Proceedings of the 12th international conference on Artificial intelligence around man and beyond
Autonomous resolution based on DNA strand displacement
DNA'11 Proceedings of the 17th international conference on DNA computing and molecular programming
Craig interpolation in the presence of non-linear constraints
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Superposition modulo non-linear arithmetic
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
International Journal of Artificial Intelligence and Soft Computing
Incremental preprocessing methods for use in BMC
Formal Methods in System Design
Flexible and approximate computation through state-space reduction
UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
Bucket elimination: a unifying framework for probabilistic inference
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
Penalty logic and its link with Dempster-Shafer theory
UAI'94 Proceedings of the Tenth international conference on Uncertainty in artificial intelligence
Improving SAT modulo ODE for hybrid systems analysis by combining different enclosure methods
SEFM'11 Proceedings of the 9th international conference on Software engineering and formal methods
On finding an inference-proof complete database for controlled query evaluation
DBSEC'06 Proceedings of the 20th IFIP WG 11.3 working conference on Data and Applications Security
Adaptive clause weight redistribution
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Boolean rings for intersection-based satisfiability
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Splitting on demand in SAT modulo theories
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Extended resolution proofs for conjoining BDDs
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Improved propositional extension rule
RSKT'06 Proceedings of the First international conference on Rough Sets and Knowledge Technology
Value elimination: bayesian inference via backtracking search
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
Efficient query processing with compiled knowledge bases
TABLEAUX'05 Proceedings of the 14th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Structure-based algorithms for computing preferred arguments of defeasible knowledge bases
AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence
Decision procedures for SAT, SAT modulo theories and beyond. the barcelogictools
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Pool resolution and its relation to regular resolution and DPLL with clause learning
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Another complete local search method for SAT
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Derandomization of schuler’s algorithm for SAT
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Algorithms for satisfiability using independent sets of variables
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
CirCUs: a hybrid satisfiability solver
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Search vs. symbolic techniques in satisfiability solving
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
NiVER: non-increasing variable elimination resolution for preprocessing SAT instances
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Zchaff2004: an efficient SAT solver
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
The second QBF solvers comparative evaluation
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
An algorithm for the SAT problem for formulae of linear length
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Finding kernels or solving SAT
Journal of Discrete Algorithms
A boolean encoding including SAT and n-ary CSPs
AIMSA'06 Proceedings of the 12th international conference on Artificial Intelligence: methodology, Systems, and Applications
Tableau calculi for answer set programming
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
MDG-SAT: an automated methodology for efficient safety checking
International Journal of Critical Computer-Based Systems
A SAT-based decision procedure for mixed logical/integer linear problems
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
An improved Õ(1.234m)-time deterministic algorithm for SAT
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Effective preprocessing in SAT through variable and clause elimination
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Faster exact solving of SAT formulae with a low number of occurrences per variable
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Speedup techniques utilized in modern SAT solvers
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
On subsumption removal and on-the-fly CNF simplification
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Boolean matching of function vectors with strengthened learning
Proceedings of the International Conference on Computer-Aided Design
Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT
Theoretical Computer Science
Solving SAT problems with TA algorithms using constant and dynamic markov chains length
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications
Web explanations for semantic heterogeneity discovery
ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications
Inference systems for logical algorithms
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Introduction to inconsistency tolerance
Inconsistency Tolerance
Representing paraconsistent reasoning via quantified propositional logic
Inconsistency Tolerance
Efficient conflict analysis for finding all satisfying assignments of a boolean circuit
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Duality in knowledge compilation techniques
ISMIS'05 Proceedings of the 15th international conference on Foundations of Intelligent Systems
Abstraction refinement for bounded model checking
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
DPLL(T) with exhaustive theory propagation and its application to difference logic
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Proof-producing congruence closure
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Using a SAT-solver to schedule sports leagues
Journal of Scheduling
An Instantiation Scheme for Satisfiability Modulo Theories
Journal of Automated Reasoning
Dealing with Satisfiability and n-ary CSPs in a Logical Framework
Journal of Automated Reasoning
Simplification Rules for Intuitionistic Propositional Tableaux
ACM Transactions on Computational Logic (TOCL)
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
sQueezeBF: an effective preprocessor for QBFs based on equivalence reasoning
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
SAT solving with reference points
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Reconstructing solutions after blocked clause elimination
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
An evolutionary local search algorithm for the satisfiability problem
TAINN'05 Proceedings of the 14th Turkish conference on Artificial Intelligence and Neural Networks
Extended resolution proofs for symbolic SAT solving with quantification
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
A complete random jump strategy with guiding paths
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Lemma learning in SMT on linear constraints
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
On SAT modulo theories and optimization problems
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Fast and flexible difference constraint propagation for DPLL(T)
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Local search for unsatisfiability
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Approximate boolean reasoning: foundations and applications in data mining
Transactions on Rough Sets V
Automatic test pattern generation
SFM'06 Proceedings of the 6th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems
Building efficient decision procedures on top of SAT solvers
SFM'06 Proceedings of the 6th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Simultaneous SAT-Based model checking of safety properties
HVC'05 Proceedings of the First Haifa international conference on Hardware and Software Verification and Testing
A note on SAT algorithms and proof complexity
Information Processing Letters
ACM Transactions on Database Systems (TODS)
Recognizing polar planar graphs using new results for monopolarity
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Conflict-driven answer set solving: From theory to practice
Artificial Intelligence
iSat: structure visualization for SAT problems
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
NP-SPEC: an executable specification language for solving all problems in NP
Computer Languages
Efficient arbitrary and resolution proofs of unsatisfiability for restricted tree-width
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
A weight-balanced branching rule for SAT
Mathematical and Computer Modelling: An International Journal
Backtracking tactics in the backtrack method for SAT
Mathematical and Computer Modelling: An International Journal
On progression and query evaluation in first-order knowledge bases with function symbols
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Conflict analysis in mixed integer programming
Discrete Optimization
An efficient algorithm for the 3-satisfiability problem
Operations Research Letters
Resolution vs. cutting plane solution of inference problems: Some computational experience
Operations Research Letters
An overview of parallel SAT solving
Constraints
The Multivariate Algorithmic Revolution and Beyond
Solving disjunctive temporal problems with preferences using maximum satisfiability
AI Communications - 18th RCRA International Workshop on “Experimental evaluation of algorithms for solving problems with combinatorial explosion”
Towards parallel direct SAT-based cryptanalysis
PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part I
CDCL-based abstract state transition system for coherent logic
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
Proof complexity of non-classical logics
ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
Specification and verification of multi-agent systems
ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
A method for symbolic computation of abstract operations
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Gearing up for effective ASP planning
Correct Reasoning
A Resolution Calculus with Shared Literals
Fundamenta Informaticae
Davis-Putnam Style Rules for Deciding Property S
Fundamenta Informaticae
A Propositional Programming Environment for Linear Algebra
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
A New Partial Semantics for Disjunctive Deductive Databases
Fundamenta Informaticae
Using Possibilistic Logic for Modeling Qualitative Decision: ATMS-based Algorithms
Fundamenta Informaticae
A Hybrid Method for Finite Model Search in Equational Theories
Fundamenta Informaticae
Formal Verification and Diagnosis of Combinational Circuit Designs with Propositional Logic
Fundamenta Informaticae
Approximate Inference In Default Logic And Circumscription
Fundamenta Informaticae
Model Finding In Semantically Guided Instance-Based Theorem Proving
Fundamenta Informaticae
Complete SAT solver based on set theory
ICICA'12 Proceedings of the Third international conference on Information Computing and Applications
Relating proof complexity measures and practical hardness of SAT
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Knowledge acquisition: Past, present and future
International Journal of Human-Computer Studies
Security margin evaluation of SHA-3 contest finalists through SAT-Based attacks
CISIM'12 Proceedings of the 11th IFIP TC 8 international conference on Computer Information Systems and Industrial Management
Satisfiability solvers are static analysers
SAS'12 Proceedings of the 19th international conference on Static Analysis
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Resolution procedures for multiple-valued optimization
Information Sciences: an International Journal
Multi-threaded asp solving with clasp
Theory and Practice of Logic Programming
Boundary properties of the satisfiability problems
Information Processing Letters
Satisfiability of acyclic and almost acyclic CNF formulas
Theoretical Computer Science
Using cross-entropy for satisfiability
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Tableau Calculi for Logic Programs under Answer Set Semantics
ACM Transactions on Computational Logic (TOCL)
Solving RCPSP/max by lazy clause generation
Journal of Scheduling
Optimization techniques for craig interpolant compaction in unbounded model checking
Proceedings of the Conference on Design, Automation and Test in Europe
Strong ETH holds for regular resolution
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Some trade-off results for polynomial calculus: extended abstract
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Provable configuration planning for wireless sensor networks
Proceedings of the 8th International Conference on Network and Service Management
Parameterized Complexity of DPLL Search Procedures
ACM Transactions on Computational Logic (TOCL)
A bisimulation between DPLL(T) and a proof-search strategy for the focused sequent calculus
Proceedings of the Eighth ACM SIGPLAN international workshop on Logical frameworks & meta-languages: theory & practice
Decentralized constraint satisfaction
IEEE/ACM Transactions on Networking (TON)
Exponential separations in a hierarchy of clause learning proof systems
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Efficient generation of small interpolants in CNF
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Automated reencoding of boolean formulas
HVC'12 Proceedings of the 8th international conference on Hardware and Software: verification and testing
Mechanical verification of SAT refutations with extended resolution
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
A survey of the satisfiability-problems solving algorithms
International Journal of Advanced Intelligence Paradigms
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Just-in-time compilation of knowledge bases
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Implicit learning of common sense for reasoning
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
The strategy challenge in SMT solving
Automated Reasoning and Mathematics
SMELS: Satisfiability Modulo Equality with Lazy Superposition
Journal of Automated Reasoning
Anytime approximation in probabilistic databases
The VLDB Journal — The International Journal on Very Large Data Bases
Theory of Computing Systems
Dynamic policy adaptation for inference control of queries to a propositional information system
Journal of Computer Security - DBSec 2011
Hi-index | 0.07 |
The hope that mathematical methods employed in the investigation of formal logic would lead to purely computational methods for obtaining mathematical theorems goes back to Leibniz and has been revived by Peano around the turn of the century and by Hilbert's school in the 1920's. Hilbert, noting that all of classical mathematics could be formalized within quantification theory, declared that the problem of finding an algorithm for determining whether or not a given formula of quantification theory is valid was the central problem of mathematical logic. And indeed, at one time it seemed as if investigations of this “decision” problem were on the verge of success. However, it was shown by Church and by Turing that such an algorithm can not exist. This result led to considerable pessimism regarding the possibility of using modern digital computers in deciding significant mathematical questions. However, recently there has been a revival of interest in the whole question. Specifically, it has been realized that while no decision procedure exists for quantification theory there are many proof procedures available—that is, uniform procedures which will ultimately locate a proof for any formula of quantification theory which is valid but which will usually involve seeking “forever” in the case of a formula which is not valid—and that some of these proof procedures could well turn out to be feasible for use with modern computing machinery. Hao Wang [9] and P. C. Gilmore [3] have each produced working programs which employ proof procedures in quantification theory. Gilmore's program employs a form of a basic theorem of mathematical logic due to Herbrand, and Wang's makes use of a formulation of quantification theory related to those studied by Gentzen. However, both programs encounter decisive difficulties with any but the simplest formulas of quantification theory, in connection with methods of doing propositional calculus. Wang's program, because of its use of Gentzen-like methods, involves exponentiation on the total number of truth-functional connectives, whereas Gilmore's program, using normal forms, involves exponentiation on the number of clauses present. Both methods are superior in many cases to truth table methods which involve exponentiation on the total number of variables present, and represent important initial contributions, but both run into difficulty with some fairly simple examples.In the present paper, a uniform proof procedure for quantification theory is given which is feasible for use with some rather complicated formulas and which does not ordinarily lead to exponentiation. The superiority of the present procedure over those previously available is indicated in part by the fact that a formula on which Gilmore's routine for the IBM 704 causes the machine to computer for 21 minutes without obtaining a result was worked successfully by hand computation using the present method in 30 minutes. Cf. §6, below.It should be mentioned that, before it can be hoped to employ proof procedures for quantification theory in obtaining proofs of theorems belonging to “genuine” mathematics, finite axiomatizations, which are “short,” must be obtained for various branches of mathematics. This last question will not be pursued further here; cf., however, Davis and Putnam [2], where one solution to this problem is given for ele