The following pages link to (Q5503674):
Displaying 50 items.
- Projection heuristics for binary branchings between sum and product (Q2118310) (← links)
- On dedicated CDCL strategies for PB solvers (Q2118312) (← links)
- A fast algorithm for SAT in terms of formula length (Q2118334) (← links)
- A refined branching algorithm for the maximum satisfiability problem (Q2118385) (← links)
- Automated generation of exam sheets for automated deduction (Q2128822) (← links)
- Towards an answer set programming methodology for constructing programs following a semi-automatic approach -- extended and revised version (Q2133436) (← links)
- CEGAR-tableaux: improved modal satisfiability via modal clause-learning and SAT (Q2142066) (← links)
- Eliminating models during model elimination (Q2142079) (← links)
- Reducing Boolean networks with backward Boolean equivalence (Q2142096) (← links)
- The sample analysis machine scheduling problem: definition and comparison of exact solving approaches (Q2146991) (← links)
- A novel algorithm for Max Sat calling MOCE to order (Q2149880) (← links)
- A parameterized view on the complexity of dependence logic (Q2151403) (← links)
- Related-tweakey impossible differential attack on reduced-round \texttt{SKINNY-AEAD} M1/M3 (Q2152164) (← links)
- Careful synchronization of partial deterministic finite automata (Q2170286) (← links)
- The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference (Q2206456) (← links)
- First-order automated reasoning with theories: when deduction modulo theory meets practice (Q2209546) (← links)
- Efficient strategies for CEGAR-based model checking (Q2209549) (← links)
- Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results (Q2216123) (← links)
- New ways to multiply \(3 \times 3\)-matrices (Q2229749) (← links)
- Faradžev Read-type enumeration of non-isomorphic CC systems (Q2230397) (← links)
- Local search with a SAT oracle for combinatorial optimization (Q2233496) (← links)
- New width parameters for SAT and \#SAT (Q2238644) (← links)
- Acceptance in incomplete argumentation frameworks (Q2238645) (← links)
- Propositional proof systems based on maximum satisfiability (Q2238728) (← links)
- Minimal self-similar Peano curve of genus \(5 \times 5\) (Q2243724) (← links)
- On the complexity of reconstructing chemical reaction networks (Q2254073) (← links)
- Zeon and idem-Clifford formulations of Boolean satisfiability (Q2274729) (← links)
- Synthesis of a DNF formula from a sample of strings using Ehrenfeucht-Fraïssé games (Q2285664) (← links)
- New models for generating hard random Boolean formulas and disjunctive logic programs (Q2287195) (← links)
- How we designed winning algorithms for abstract argumentation and which insight we attained (Q2289004) (← links)
- The SAT+CAS method for combinatorial search with applications to best matrices (Q2294574) (← links)
- Continuous relaxations for the traveling salesman problem (Q2296989) (← links)
- Discovering causal graphs with cycles and latent confounders: an exact branch-and-bound approach (Q2302940) (← links)
- \textsc{OptiMathSAT}: a tool for optimization modulo theories (Q2303246) (← links)
- Conflict-driven satisfiability for theory combination: transition system and completeness (Q2303254) (← links)
- Definability for model counting (Q2303508) (← links)
- Reactive synthesis with maximum realizability of linear temporal logic specifications (Q2303876) (← links)
- Using decomposition-parameters for QBF: mind the prefix! (Q2304627) (← links)
- Editorial: Symbolic computation and satisfiability checking (Q2307620) (← links)
- Cylindrical algebraic decomposition with equational constraints (Q2307622) (← links)
- A complete and terminating approach to linear integer solving (Q2307624) (← links)
- Applying computer algebra systems with SAT solvers to the Williamson conjecture (Q2307627) (← links)
- On the complexity of inconsistency measurement (Q2321337) (← links)
- Reinterpreting dependency schemes: soundness meets incompleteness in DQBF (Q2323446) (← links)
- Hyperresolution for Gödel logic with truth constants (Q2328910) (← links)
- Improved WPM encoding for coalition structure generation under MC-nets (Q2331103) (← links)
- Expansion-based QBF solving versus Q-resolution (Q2339467) (← links)
- Methods for solving reasoning problems in abstract argumentation -- a survey (Q2341832) (← links)
- meSAT: multiple encodings of CSP to SAT (Q2342599) (← links)
- Generalising unit-refutation completeness and SLUR via nested input resolution (Q2352484) (← links)
