The following pages link to (Q4809068):
Displaying 39 items.
- Semantically-guided goal-sensitive reasoning: model representation (Q287333) (← links)
- Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models (Q415616) (← links)
- Finding rough and fuzzy-rough set reducts with SAT (Q497893) (← links)
- Unrestricted vs restricted cut in a tableau method for Boolean circuits (Q812394) (← links)
- Backjumping for quantified Boolean logic satisfiability (Q814445) (← links)
- New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability (Q937398) (← links)
- A self-adaptive multi-engine solver for quantified Boolean formulas (Q1020496) (← links)
- Theory decision by decomposition (Q1041591) (← links)
- A simple and efficient Boolean solver for constraint logic programming (Q1357667) (← links)
- Some interesting research directions in satisfiability (Q1601833) (← links)
- Computing with SAT oracles: past, present and future (Q1670750) (← links)
- Efficient data structures for backtrack search SAT solvers (Q1777399) (← links)
- Accelerating numerical simulation of continuous-time Boolean satisfiability solver using discrete gradient (Q2045943) (← links)
- Zeon and idem-Clifford formulations of Boolean satisfiability (Q2274729) (← links)
- A novel SAT solver for the van der Waerden numbers (Q2338161) (← links)
- Computing the least common subsumer w.r.t. a background terminology (Q2372193) (← links)
- A game characterisation of tree-like Q-resolution size (Q2424676) (← links)
- Complete Boolean satisfiability solving algorithms based on local search (Q2434568) (← links)
- SMT proof checking using a logical framework (Q2441776) (← links)
- Search techniques for SAT-based Boolean optimization (Q2455454) (← links)
- Selection of search strategies for solving 3-SAT problems (Q2511762) (← links)
- Understanding one another: making out meanings with Boolean equations (Q2642625) (← links)
- Towards an efficient library for SAT: A manifesto (Q2741533) (← links)
- (Q2767086) (← links)
- On First-Order Model-Based Reasoning (Q2945706) (← links)
- (Q3429158) (← links)
- (Q3429161) (← links)
- Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic (Q3608775) (← links)
- (Q4475671) (← links)
- (Q4804883) (← links)
- Improving Unsatisfiability-Based Algorithms for Boolean Optimization (Q4930588) (← links)
- Automata-Theoretic Model Checking Revisited (Q5452603) (← links)
- (Q5457277) (← links)
- Theory and Applications of Satisfiability Testing (Q5714769) (← links)
- (Q5743451) (← links)
- Characterizing Propagation Methods for Boolean Satisfiability (Q5756574) (← links)
- Recent Findings in Boolean Techniques (Q5856082) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900325) (← links)
- Accelerating a continuous-time analog SAT solver using GPUs (Q6040130) (← links)
