TreeWidzard: An Engine for Width-Based Dynamic Programming and Automated Theorem Proving

Documenti analoghi

• Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes
  di: Golovach, Petr A., et al.
  Pubblicazione: (2022)
• State Canonization and Early Pruning in Width-Based Automated Theorem Proving
  di: Oliveira, Mateus de Oliveira, et al.
  Pubblicazione: (2026)
• DAG Scheduling in the BSP Model
  di: Papp, Pál András, et al.
  Pubblicazione: (2023)
• Achieving Tight $O(4^k)$ Runtime Bounds on Jump$_k$ by Proving that Genetic Algorithms Evolve Near-Maximal Population Diversity
  di: Opris, Andre, et al.
  Pubblicazione: (2024)
• A Complexity Dichotomy for Temporal Valued Constraint Satisfaction Problems
  di: Bodirsky, Manuel, et al.
  Pubblicazione: (2024)