Pages that link to "Item:Q5713748"
From MaRDI portal
The following pages link to Theory and Applications of Satisfiability Testing (Q5713748):
Displaying 50 items.
- Broken triangles: from value merging to a tractable class of general-arity constraint satisfaction problems (Q253988) (← links)
- Set constraint model and automated encoding into SAT: application to the social golfer problem (Q256655) (← links)
- Simulating circuit-level simplifications on CNF (Q352967) (← links)
- On Davis-Putnam reductions for minimally unsatisfiable clause-sets (Q391124) (← links)
- Symmetry in Gardens of Eden (Q396822) (← links)
- Learning from conflicts in propositional satisfiability (Q427560) (← links)
- A pearl on SAT and SMT solving in Prolog (Q428887) (← links)
- SAT-solving in CSP trace refinement (Q436423) (← links)
- Symbolic algorithmic verification of intransitive generalized noninterference (Q439858) (← links)
- Incremental preprocessing methods for use in BMC (Q453488) (← links)
- Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases (Q459042) (← links)
- Guarantees and limits of preprocessing in constraint satisfaction and reasoning (Q460604) (← links)
- On the completeness of pruning techniques for planning with conditional effects (Q473577) (← links)
- An overview of parallel SAT solving (Q487635) (← links)
- Local search for Boolean satisfiability with configuration checking and subscore (Q490437) (← links)
- Algorithm runtime prediction: methods \& evaluation (Q490455) (← links)
- Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability (Q511772) (← links)
- Automatic construction of parallel portfolios via algorithm configuration (Q511786) (← links)
- Cardinality networks: a theoretical and empirical study (Q538318) (← links)
- Solving satisfiability problems with preferences (Q606909) (← links)
- Extended clause learning (Q622116) (← links)
- Efficient generation of small interpolants in CNF (Q746773) (← links)
- Variable and clause elimination for LTL satisfiability checking (Q748758) (← links)
- Progress in certifying hardware model checking results (Q832275) (← links)
- Termination of \(\{aa\rightarrow bc,bb\rightarrow ac,cc\rightarrow ab\}\) (Q844184) (← links)
- Matrix interpretations for proving termination of term rewriting (Q928655) (← links)
- Efficiently checking propositional refutations in HOL theorem provers (Q1006729) (← links)
- Lower bound on average-case complexity of inversion of Goldreich's function by drunken backtracking algorithms (Q1678752) (← links)
- Automatically improving constraint models in Savile Row (Q1680696) (← links)
- What is answer set programming to propositional satisfiability (Q1699519) (← links)
- Auto-tabling for subproblem presolving in MiniZinc (Q1701238) (← links)
- Conflict-driven answer set solving: from theory to practice (Q1761291) (← links)
- The complexity of inverting explicit Goldreich's function by DPLL algorithms (Q1946844) (← links)
- Exploiting partial variable assignment in interpolation-based model checking (Q2009611) (← links)
- Flexible proof production in an industrial-strength SMT solver (Q2104495) (← links)
- Preprocessing of propagation redundant clauses (Q2104502) (← links)
- Hash-based preprocessing and inprocessing techniques in SAT solvers (Q2118288) (← links)
- On the hierarchical community structure of practical Boolean formulas (Q2118321) (← links)
- XOR local search for Boolean Brent equations (Q2118332) (← links)
- Leveraging GPUs for effective clause sharing in parallel SAT solving (Q2118339) (← links)
- Incremental column-wise verification of arithmetic circuits using computer algebra (Q2225473) (← links)
- Clause vivification by unit propagation in CDCL SAT solvers (Q2287199) (← links)
- How we designed winning algorithms for abstract argumentation and which insight we attained (Q2289004) (← links)
- Definability for model counting (Q2303508) (← links)
- Computing properties of stable configurations of thermodynamic binding networks (Q2315010) (← links)
- Compiling CP subproblems to MDDs and d-DNNFs (Q2331104) (← links)
- On the hardness of solving edge matching puzzles as SAT or CSP problems (Q2342584) (← links)
- On preprocessing techniques and their impact on propositional model counting (Q2362107) (← links)
- Visualizing SAT instances and runs of the DPLL algorithm (Q2462641) (← links)
- What we can learn from conflicts in propositional satisfiability (Q2630816) (← links)
