The following pages link to (Q5503674):
Displaying 50 items.
- Combining SAT solvers with computer algebra systems to verify combinatorial conjectures (Q2360872) (← links)
- On preprocessing techniques and their impact on propositional model counting (Q2362107) (← links)
- Parameterized complexity classes beyond para-NP (Q2396719) (← links)
- Improved exact algorithms for mildly sparse instances of MAX SAT (Q2405896) (← links)
- Formal verification of synchronous data-flow program transformations toward certified compilers (Q2418653) (← links)
- Pattern-based and composition-driven automatic generation of logical specifications for workflow-oriented software models (Q2423750) (← links)
- Generalized probabilistic satisfiability and applications to modelling attackers with side-channel capabilities (Q2424888) (← links)
- A taxonomy of exact methods for partial Max-SAT (Q2434567) (← links)
- Henkin quantifiers and Boolean formulae: a certification perspective of DQBF (Q2435315) (← links)
- XSAT and NAE-SAT of linear CNF classes (Q2440094) (← links)
- Semidefinite resolution and exactness of semidefinite relaxations for satisfiability (Q2446872) (← links)
- Capturing equilibrium models in modal logic (Q2447178) (← links)
- The complexity of computing the behaviour of lattice automata on infinite trees (Q2447756) (← links)
- Precise quantitative information flow analysis -- a symbolic approach (Q2453114) (← links)
- What we can learn from conflicts in propositional satisfiability (Q2630816) (← links)
- SATenstein: automatically building local search SAT solvers from components (Q2634473) (← links)
- Exact stochastic constraint optimisation with applications in network analysis (Q2667834) (← links)
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all? (Q2667835) (← links)
- Constructing 5-chromatic unit distance graphs embedded in the Euclidean plane and two-dimensional spheres (Q2675865) (← links)
- Constraint-based electoral districting using a new compactness measure: an application to Portugal (Q2676289) (← links)
- Solving projected model counting by utilizing treewidth and its limits (Q2680775) (← links)
- CHAMP: a multipass algorithm for Max Sat based on saver variables (Q2688471) (← links)
- Go-MOCE: greedy order method of conditional expectations for Max Sat (Q2691199) (← links)
- Minimizing binary decision diagrams for systems of incompletely defined Boolean functions using algebraic cofactor expansions (Q2695132) (← links)
- General lower bounds and improved algorithms for infinite-domain CSPs (Q2700386) (← links)
- Delegatable Functional Signatures (Q2798783) (← links)
- $$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation (Q2817292) (← links)
- A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality (Q2817909) (← links)
- The Normalized Autocorrelation Length of Random Max $$r$$ -Sat Converges in Probability to $$(1-1/2^r)/r$$ (Q2818001) (← links)
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer (Q2818017) (← links)
- On Q-Resolution and CDCL QBF Solving (Q2818030) (← links)
- BEACON: An Efficient SAT-Based Tool for Debugging $${\mathcal {EL}}{^+}$$ Ontologies (Q2818038) (← links)
- MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures (Q2829996) (← links)
- A Generalised Branch-and-Bound Approach and Its Application in SAT Modulo Nonlinear Integer Arithmetic (Q2830009) (← links)
- Efficient Reasoning for Inconsistent Horn Formulae (Q2835881) (← links)
- Gearing Up for Effective ASP Planning (Q2900527) (← links)
- Generalising and Unifying SLUR and Unit-Refutation Completeness (Q2927648) (← links)
- Improving the Normalization of Weight Rules in Answer Set Programs (Q2938492) (← links)
- System aspmt2smt: Computing ASPMT Theories by SMT Solvers (Q2938519) (← links)
- Space Complexity in Polynomial Calculus (Q2944568) (← links)
- Two Decades of Maude (Q2945709) (← links)
- A SAT Approach to Clique-Width (Q2946763) (← links)
- Optimization Modulo Theories with Linear Rational Costs (Q2946768) (← links)
- NRCL - A Model Building Approach to the Bernays-Schönfinkel Fragment (Q2964454) (← links)
- Abstraction-Based Algorithm for 2QBF (Q3007686) (← links)
- Failed Literal Detection for QBF (Q3007688) (← links)
- Generating Diverse Solutions in SAT (Q3007690) (← links)
- I-RiSC: An SMT-Compliant Solver for the Existential Fragment of Real Algebra (Q3014943) (← links)
- Propositional SAT Solving (Q3176367) (← links)
- SAT-Based Model Checking (Q3176368) (← links)
