On Computing Backbones of Propositional Theories

DOI10.3233/978-1-60750-606-5-15zbMath1211.68389OpenAlexW1956710190MaRDI QIDQ2999099

Inês Lynce, Mikoláš Janota, João P. Marques-Silva

Publication date: 11 May 2011

Full work available at URL: http://sat.inesc-id.pt/~mikolas/ecai10_talk.pdf

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Advances in WASP ⋮ The complete parsimony haplotype inference problem and algorithms based on integer programming, branch-and-bound and Boolean satisfiability ⋮ Propositional SAT Solving ⋮ Minimal sets on propositional formulae. Problems and reductions ⋮ Towards backbone computing: A Greedy-Whitening based approach ⋮ On preprocessing for weighted MaxSAT

Uses Software

• BG-WalkSAT
• PicoSAT