SATzilla

swMATH6281MaRDI QIDQ18412FDOQ18412

Author name not available (Why is that?)

Cited In (91)

• Impact of Community Structure on SAT Solver Performance
• meSAT: multiple encodings of CSP to SAT
• Machine learning for first-order theorem proving
• Algorithm portfolio selection as a bandit problem with unbounded losses
• Iterative-deepening search with on-line tree size prediction
• Title not available (Why is that?)
• SATenstein: automatically building local search SAT solvers from components
• MaxSAT by improved instance-specific algorithm configuration
• Algorithm portfolios for noisy optimization
• Portfolio approaches for constraint optimization problems
• A PAC Approach to Application-Specific Algorithm Selection
• Algorithm runtime prediction: methods \& evaluation
• ASlib: a benchmark library for algorithm selection
• SUNNY: a Lazy Portfolio Approach for Constraint Solving
• Comparing machine learning models to choose the variable ordering for cylindrical algebraic decomposition
• Towards objective measures of algorithm performance across instance space
• The complexity of probabilistic lobbying
• Portfolio theorem proving and prover runtime prediction for geometry
• Star-topology decoupled state space search
• Automated theorem proving in GeoGebra: current achievements
• MaLeS: a framework for automatic tuning of automated theorem provers
• Captain Jack: New Variable Selection Heuristics in Local Search for SAT
• Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings
• An automatic algorithm selection approach for the multi-mode resource-constrained project scheduling problem
• Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction
• Variable ordering for decision diagrams: a portfolio approach
• Benchmarking a model checker for algorithmic improvements and tuning for performance
• Autonomous operator management for evolutionary algorithms
• Optimal defense against election control by deleting voter groups
• A review of literature on parallel constraint solving
• A Constraint Satisfaction Framework for Executing Perceptions and Actions in Diagrammatic Reasoning
• Metaheuristics ``In the large
• aspeed: Solver scheduling via answer set programming
• Extreme Cases in SAT Problems
• Adaptive Constraint Satisfaction: The Quickest First Principle
• DASH: dynamic approach for switching heuristics
• Machine learning for mathematical software
• Title not available (Why is that?)
• E-MaLeS 1.1
• Practical performance models of algorithms in evolutionary program induction and other domains
• Automatic construction of optimal static sequential portfolios for AI planning and beyond
• Propositional SAT Solving
• Exploring the role of graph spectra in graph coloring algorithm performance
• Local search for Boolean satisfiability with configuration checking and subscore
• Pitfalls and Best Practices in Algorithm Configuration
• Algorithm Survival Analysis
• Improved Cross-Validation for Classifiers that Make Algorithmic Choices to Minimise Runtime Without Compromising Output Correctness
• On the impact of configuration on abstract argumentation automated reasoning
• Propagation based local search for bit-precise reasoning
• Efficiently Calculating Evolutionary Tree Measures Using SAT
• The configurable SAT solver challenge (CSSC)
• Theorem proving as constraint solving with coherent logic
• Multi-language evaluation of exact solvers in graphical model discrete optimization
• \textsc{Alors}: an algorithm recommender system
• Automatic construction of parallel portfolios via algorithm configuration
• Weighted heuristic anytime search: new schemes for optimization over graphical models
• Reconstruction of Z3’s Bit-Vector Proofs in HOL4 and Isabelle/HOL
• Synergies between operations research and data mining: the emerging use of multi-objective approaches
• Efficient benchmarking of algorithm configurators via model-based surrogates
• Scalable Gaussian process-based transfer surrogates for hyperparameter optimization
• Decision procedures. An algorithmic point of view
• MedleySolver: online SMT algorithm selection
• Complete Boolean satisfiability solving algorithms based on local search
• URSA: A System for Uniform Reduction to SAT
• Empirical software metrics for benchmarking of verification tools
• Item response theory in AI: analysing machine learning classifiers at the instance level
• Heterogeneous heuristic optimisation and scheduling for first-order theorem proving
• On the design of metaheuristics-based algorithm portfolios
• A taxonomy of exact methods for partial Max-SAT
• ProCount: weighted projected model counting with graded project-join trees
• Algorithm selection for dynamic symbolic execution: a preliminary study
• Efficiently Coupling the I-DLV Grounder with ASP Solvers
• Guiding high-performance SAT solvers with unsat-core predictions
• Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem
• Solving SAT in a distributed cloud: a portfolio approach
• Combining CP and ILP in a tree decomposition of bounded height for the sum colouring problem
• Why CP Portfolio Solvers Are (under)Utilized? Issues and Challenges
• The algorithm selection competitions 2015 and 2017
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Paracoherent answer set computation
• Algorithm selection for the team orienteering problem
• Boosting evolutionary algorithm configuration
• The voice of optimization
• Gorthaur-EXP3: bandit-based selection from a portfolio of recommendation algorithms balancing the accuracy-diversity dilemma
• An algorithm selection approach for the flexible job shop scheduling problem: choosing constraint programming solvers through machine learning
• Boosting Local Search Thanks to cdcl
• On the use of fitness landscape features in meta-learning based algorithm selection for the quadratic assignment problem
• CrystalBall: gazing in the black box of SAT solving
• Compiling CP subproblems to MDDs and d-DNNFs

This page was built for software: SATzilla