On computing backbones of propositional theories

DOI10.3233/978-1-60750-606-5-15MaRDI QIDQ2999099zbMATH OpenOpenAlexFDO

Authors Mikoláš Janota, Inês Lynce, Joao 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)

Recommendations

• Algorithms for computing backbones of propositional formulae
• Local backbones
• Towards backbone computing: a greedy-whitening based approach
• Backbone analysis and applications in heuristic algorithm design
• A note on backbones in optimization and approximation

Cited in

(12)

• Computational complexity of terminological reasoning in BACK
• Minimal sets on propositional formulae. Problems and reductions
• The opacity of backbones
• On preprocessing for weighted MaxSAT
• The complete parsimony haplotype inference problem and algorithms based on integer programming, branch-and-bound and Boolean satisfiability
• Backbone analysis and applications in heuristic algorithm design
• Propositional SAT solving
• Advances in WASP
• A note on backbones in optimization and approximation
• Algorithms for computing backbones of propositional formulae
• Towards backbone computing: a greedy-whitening based approach
• Local backbones

Describes a project that uses

Uses Software

• PicoSAT
• BG-WalkSAT

This page was built for publication: On computing backbones of propositional theories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999099)