Algorithms for computing backbones of propositional formulae
From MaRDI portal
Publication:4589090
DOI10.3233/AIC-140640zbMath1373.68379OpenAlexW1568917966MaRDI QIDQ4589090
Inês Lynce, Mikoláš Janota, João P. 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
Related Items
The complete parsimony haplotype inference problem and algorithms based on integer programming, branch-and-bound and Boolean satisfiability, Mining Backbone Literals in Incremental SAT, Preprocessing for DQBF, SAT-Based Horn Least Upper Bounds, Cautious reasoning in ASP via minimal models and unsatisfiable cores, Minimal sets on propositional formulae. Problems and reductions, Abstract Solvers for Computing Cautious Consequences of ASP programs, Towards backbone computing: A Greedy-Whitening based approach, On preprocessing for weighted MaxSAT, Paracoherent answer set computation, SAT competition 2020, The (D)QBF Preprocessor HQSpre – Underlying Theory and Its Implementation1, On the query complexity of selecting minimal sets for monotone predicates
