Conflict-driven clause learning SAT solvers
One of the most important paradigm shifts in the use of SAT solvers for solving industrial
problems has been the introduction of clause learning. Clause learning entails adding a …
problems has been the introduction of clause learning. Clause learning entails adding a …
[图书][B] Knowledge-based configuration: From research to business cases
Knowledge-based Configuration incorporates knowledge representation formalisms to
capture complex product models and reasoning methods to provide intelligent interactive …
capture complex product models and reasoning methods to provide intelligent interactive …
Quantum optimization: Potential, challenges, and the path forward
Recent advances in quantum computers are demonstrating the ability to solve problems at a
scale beyond brute force classical simulation. As such, a widespread interest in quantum …
scale beyond brute force classical simulation. As such, a widespread interest in quantum …
Practical applications of boolean satisfiability
J Marques-Silva - 2008 9th International Workshop on Discrete …, 2008 - ieeexplore.ieee.org
Boolean satisfiability (SAT) solvers have been the subject of remarkable improvements
since the mid 90s. One of the main reasons for these improvements has been the wide …
since the mid 90s. One of the main reasons for these improvements has been the wide …
[图书][B] Formal verification: an essential toolkit for modern VLSI design
E Seligman, T Schubert, MVAK Kumar - 2023 - books.google.com
Formal Verification: An Essential Toolkit for Modern VLSI Design, Second Edition presents
practical approaches for design and validation, with hands-on advice to help working …
practical approaches for design and validation, with hands-on advice to help working …
Clause elimination for SAT and QSAT
The famous archetypical NP-complete problem of Boolean satisfiability (SAT) and its
PSPACE-complete generalization of quantified Boolean satisfiability (QSAT) have become …
PSPACE-complete generalization of quantified Boolean satisfiability (QSAT) have become …
SAT-solving in practice, with a tutorial example from supervisory control
Satisfiability solving, the problem of deciding whether the variables of a propositional
formula can be assigned in such a way that the formula evaluates to true, is one of the …
formula can be assigned in such a way that the formula evaluates to true, is one of the …
A liveness checking algorithm that counts
K Claessen, N Sörensson - 2012 Formal Methods in Computer …, 2012 - ieeexplore.ieee.org
We present a simple but novel algorithm for checking liveness properties of finite-state
systems, called k-Liveness, which is based on counting and bounding the number of times a …
systems, called k-Liveness, which is based on counting and bounding the number of times a …
Hybrid mining: exploiting blockchain's computational power for distributed problem solving
K Chatterjee, AK Goharshady… - Proceedings of the 34th …, 2019 - dl.acm.org
In today's cryptocurrencies, Hashcash proof of work is the most commonly-adopted
approach to mining. In Hashcash, when a miner decides to add a block to the chain, she has …
approach to mining. In Hashcash, when a miner decides to add a block to the chain, she has …
[PDF][PDF] Configuration knowledge representation and reasoning
L Hotz, A Felfernig, M Stumptner, A Ryabokon… - 2014 - researchgate.net
Configuration Knowledge Representation and Reasoning Page 1 1 Configuration Knowledge
Representation and Reasoning Configuration Knowledge Representation and Reasoning …
Representation and Reasoning Configuration Knowledge Representation and Reasoning …