Not so Scary Backbones

  • Nils Froleyks (Speaker)

Activity: Talk or presentation › Other talk or presentation › science-to-science

Description

Sadly only the title of this talk fits the date. The backbone of a satisfiable formula is the set of literals that hold true in all satisfiable assignments. I will present the algorithmic details that allowed the impressive results of the recently developed backbone extractor CadiBack. We will focus especially on a new algorithm that allows to extract all backbones present in the Binary Implication Graph, allowing for improved performance when CadiBack is run in an anytime context.
Period31 Oct 2023
Event titleLogiCS - Seminar
Event typeOther
LocationAustriaShow on map

Fields of science

  • 202006 Computer hardware
  • 603109 Logic
  • 102 Computer Sciences
  • 102031 Theoretical computer science
  • 102011 Formal languages
  • 102022 Software development
  • 102001 Artificial intelligence