Towards backbone computing: A Greedy-Whitening based approach

DOI10.3233/AIC-180763zbMath1462.68177WikidataQ129943914 ScholiaQ129943914MaRDI QIDQ5145436

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

Publication date: 20 January 2021

Published in: AI Communications (Search for Journal in Brave)

zbMATH Keywords

backbonewhiteningapproximationsatisfiabilitygreedy

Mathematics Subject Classification ID

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

Uses Software

• MiniSat
• Walksat
• BG-WalkSAT
• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• On Computing Backbones of Propositional Theories
• On Improving MUS Extraction Algorithms
• Exact solution of large-scale, asymmetric traveling salesman problems
• Algorithms for computing backbones of propositional formulae
• Determining computational complexity from characteristic ‘phase transitions’
• Frozen development in graph coloring

This page was built for publication: Towards backbone computing: A Greedy-Whitening based approach