Unhiding Redundancy in SAT

  • Armin Biere (Speaker)

Activity: Talk or presentation › Contributed talk › unknown

Description

– unhiding redundancy in large formulas – almost linear randomized algorithm – using the binary implication graph – fast enough to be applied to learned clauses
Period07 Mar 2011
Event titleDeduction at Scale 2011
Event typeConference
LocationGermanyShow on map

Fields of science

  • 102 Computer Sciences
  • 101 Mathematics
  • 102011 Formal languages

JKU Focus areas

  • Computation in Informatics and Mathematics

Documents & Links