Towards backbone computing: a greedy-whitening based approach

DOI10.3233/AIC-180763MaRDI QIDQ5145436zbMATH OpenWikidataFDO

Authors Yueling Zhang, Min Zhang, Geguang Pu, Fu Song, Jianwen Li

Publication date 20 January 2021

Published in AI Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/AIC-180763

zbMATH Keywords

approximationbackbonegreedysatisfiabilitywhitening

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• On computing backbones of propositional theories
• Algorithms for computing backbones of propositional formulae
• Local backbones
• scientific article; zbMATH DE number 1467488
• Decomposing SAT Instances with Pseudo Backbones

Cites work

• Algorithms for computing backbones of propositional formulae
• Determining computational complexity from characteristic ``phase transitions
• Exact solution of large-scale, asymmetric traveling salesman problems
• Frozen development in graph coloring
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 956863 (Why is no real title available?)
• On computing backbones of propositional theories
• On improving MUS extraction algorithms

Cited in

(3)

• On computing backbones of propositional theories
• Algorithms for computing backbones of propositional formulae
• Local backbones

Describes a project that uses

Uses Software

• MiniSat
• Walksat
• BG-WalkSAT
• DIMACS

This page was built for publication: Towards backbone computing: a greedy-whitening based approach

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