Algorithms for computing backbones of propositional formulae
From MaRDI portal
Publication:4589090
DOI10.3233/AIC-140640zbMATH Open1373.68379OpenAlexW1568917966MaRDI QIDQ4589090FDOQ4589090
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
Recommendations
Cited In (20)
- On the query complexity of selecting minimal sets for monotone predicates
- Backbone analysis and applications in heuristic algorithm design
- The (D)QBF preprocessor HQSpre -- underlying theory and its implementation
- Algorithms for computing minimal equivalent subformulas
- Paracoherent answer set computation
- On computing backbones of propositional theories
- Minimal sets on propositional formulae. Problems and reductions
- Abstract Solvers for Computing Cautious Consequences of ASP programs
- Local backbones
- Cautious reasoning in ASP via minimal models and unsatisfiable cores
- On the benefits of knowledge compilation for feature-model analyses
- Computational complexity of terminological reasoning in BACK
- On preprocessing for weighted MaxSAT
- Preprocessing for DQBF
- Mining backbone literals in incremental SAT. A new kind of incremental data
- The complete parsimony haplotype inference problem and algorithms based on integer programming, branch-and-bound and Boolean satisfiability
- Towards backbone computing: a greedy-whitening based approach
- SAT-Based Horn Least Upper Bounds
- Backjumping for quantified Boolean logic satisfiability
- SAT competition 2020
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)
