Knowledge compilation and theory approximation
Journal of the ACM (JACM)
On the complexity of unsatisfiability proofs for random k-CNF formulas
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Backtracking algorithms for disjunctions of temporal constraints
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
An algorithm to evaluate quantified Boolean formulae
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
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
A sharp threshold in proof complexity
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
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
Some interesting research directions in satisfiability
Annals of Mathematics and Artificial Intelligence
Logical Cryptanalysis as a SAT Problem
Journal of Automated Reasoning
Stochastic Boolean Satisfiability
Journal of Automated Reasoning
Evaluating Optimized Decision Procedures for Propositional Modal K(m) Satisfiability
Journal of Automated Reasoning
An Algorithm to Evaluate Quantified Boolean Formulae and Its Experimental Evaluation
Journal of Automated Reasoning
Nagging: a scalable fault-tolerant paradigm for distributed search
Artificial Intelligence
DNA and membrane algorithms for SAT
Fundamenta Informaticae - Membrane computing
Compiling Problem Specifications into SAT
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
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
Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
A Logic for Anytime Deduction and Anytime Compilation
JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
Efficient Recognition of Random Unsatisfiable k-SAT Instances by Spectral Methods
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Design and Results of the Tableaux-99 Non-classical (Modal) Systems Comparison
TABLEAUX '99 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
PRICAI '02 Proceedings of the 7th Pacific Rim International Conference on Artificial Intelligence: Trends in Artificial Intelligence
Random 3-SAT: The Plot Thickens
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Random 3-SAT and BDDs: The Plot Thickens Further
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
In Search of a Phase Transition in the AC-Matching Problem
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Generalized satisfiability problems: minimal elements and phase transitions
Theoretical Computer Science
Experimental complexity analysis of continuous constraint satisfaction problems
Information Sciences: an International Journal
Random 3-SAT: The Plot Thickens
Constraints
How to fake an RSA signature by encoding modular root finding as a SAT problem
Discrete Applied Mathematics - The renesse issue on satisfiability
On sufficient conditions for unsatisfiability of random formulas
Journal of the ACM (JACM)
A sharp threshold in proof complexity yields lower bounds for satisfiability search
Journal of Computer and System Sciences - STOC 2001
On SAT Instance Classes and a Method for Reliable Performance Experiments with SAT Solvers
Annals of Mathematics and Artificial Intelligence
Partition-based logical reasoning for first-order and propositional theories
Artificial Intelligence - Special volume on reformulation
Compiling problem specification into SAT
Artificial Intelligence - Special volume on reformulation
On the complexity of unfrozen problems
Discrete Applied Mathematics - Special issue: Typical case complexity and phase transitions
Symbolic Techniques in Satisfiability Solving
Journal of Automated Reasoning
A survey on knowledge compilation
AI Communications
A competitive and cooperative approach to propositional satisfiability
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Evolving combinatorial problem instances that are difficult to solve
Evolutionary Computation
Phase transitions of PP-complete satisfiability problems
Discrete Applied Mathematics
A continuous–discontinuous second-order transition in the satisfiability of random Horn-SAT formulas
Random Structures & Algorithms
Aiding side-channel attacks on cryptographic software with satisfiability-based analysis
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Implementing semantic merging operators using binary decision diagrams
International Journal of Approximate Reasoning
Comparison of Boolean satisfiability encodings on FPGA detailed routing problems
Proceedings of the conference on Design, automation and test in Europe
Cross-disciplinary perspectives on meta-learning for algorithm selection
ACM Computing Surveys (CSUR)
Empirical hardness models: Methodology and a case study on combinatorial auctions
Journal of the ACM (JACM)
An algorithm to compute minimally grounded and admissible defence sets in argument systems
Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
Focused search for arguments from propositional knowledge
Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008
(1,2)-QSAT: A Good Candidate for Understanding Phase Transitions Mechanisms
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Local search starting from an LP solution: Fast and quite good
Journal of Experimental Algorithmics (JEA)
Foundations of r-contiguous matching in negative selection for anomaly detection
Natural Computing: an international journal
Phase transitions of bounded satisfiability problems
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Phase transitions of PP-complete satisfiability problems
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Partition-based logical reasoning for first-order and propositional theories
Artificial Intelligence - Special volume on reformulation
Compiling problem specifications into SAT
Artificial Intelligence - Special volume on reformulation
On the complexity of unfrozen problems
Discrete Applied Mathematics
Discrete Applied Mathematics
Scaling and probabilistic smoothing: dynamic local search for unweighted MAX-SAT
AI'03 Proceedings of the 16th Canadian society for computational studies of intelligence conference on Advances in artificial intelligence
Hierarchical hardness models for SAT
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Phase transition and the computational complexity of generating r-contiguous detectors
ICARIS'07 Proceedings of the 6th international conference on Artificial immune systems
Value, cost, and sharing: open issues in constrained clustering
KDID'06 Proceedings of the 5th international conference on Knowledge discovery in inductive databases
Algorithms for effective argumentation in classical propositional logic: a connection graph approach
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
Compilation for critically constrained knowledge bases
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
JustBench: a framework for OWL benchmarking
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
Review: Measuring instance difficulty for combinatorial optimization problems
Computers and Operations Research
A polymerase based algorithm for SAT
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Experimental evaluation of classical automata constructions
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Approximation algorithm for random MAX-kSAT
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
A continuous-discontinuous second-order transition in the satisfiability of random Horn-SAT formulas
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT
Theoretical Computer Science
NP-SPEC: an executable specification language for solving all problems in NP
Computer Languages
Large hinge width on sparse random hypergraphs
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Challenging heuristics: evolving binary constraint satisfaction problems
Proceedings of the 14th annual conference on Genetic and evolutionary computation
DNA and Membrane Algorithms for SAT
Fundamenta Informaticae - Membrane Computing (WMC-CdeA2001)
Learning vector quantization for variable ordering in constraint satisfaction problems
Pattern Recognition Letters
| Hi-index | 0.00 |