Algorithms for computing backbones of propositional formulae

DOI10.3233/AIC-140640MaRDI QIDQ4589090zbMATH OpenOpenAlexFDO

Authors Mikoláš Janota, Inês Lynce, Joao Marques-Silva

Publication date 7 November 2017

Published in AI Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/aic-140640

zbMATH Keywords

backbonesmandatory assignmentsnecessary assignmentsSAT

Mathematics Subject Classification ID

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

Recommendations

• On computing backbones of propositional theories
• Local backbones
• Towards backbone computing: a greedy-whitening based approach
• An overview of backtrack search satisfiability algorithms
• Minimal sets on propositional formulae. Problems and reductions

Cited in

(21)

• Computational complexity of terminological reasoning in BACK
• Minimal sets on propositional formulae. Problems and reductions
• SAT competition 2020
• On preprocessing for weighted MaxSAT
• Paracoherent answer set computation
• On the query complexity of selecting minimal sets for monotone predicates
• The complete parsimony haplotype inference problem and algorithms based on integer programming, branch-and-bound and Boolean satisfiability
• On computing backbones of propositional theories
• Backbone analysis and applications in heuristic algorithm design
• Mining backbone literals in incremental SAT. A new kind of incremental data
• Preprocessing for DQBF
• SAT-Based Horn Least Upper Bounds
• Cautious reasoning in ASP via minimal models and unsatisfiable cores
• Algorithms for computing minimal equivalent subformulas
• The (D)QBF preprocessor HQSpre -- underlying theory and its implementation
• Abstract Solvers for Computing Cautious Consequences of ASP programs
• Towards backbone computing: a greedy-whitening based approach
• Local backbones
• On the benefits of knowledge compilation for feature-model analyses
• Breaking symmetries from a set-covering perspective
• Backjumping for quantified Boolean logic satisfiability

This page was built for publication: Algorithms for computing backbones of propositional formulae

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