Maximal falsifiability. Definitions, algorithms and applications

DOI10.3233/AIC-150685MaRDI QIDQ4592701zbMATH OpenOpenAlexFDO

Authors A. A. Ignatiev, Antonio Morgado, Jordi Planes, Joao Marques-Silva

Publication date 8 November 2017

Published in AI Communications (Search for Journal in Brave)

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

zbMATH Keywords

Boolean optimizationmaximum falsifiabilityminimal hitting set dualityminimum satisfiability

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Boolean programming (90C09) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Maximal falsifiability. Definitions, algorithms, and applications
• Minimal sets on propositional formulae. Problems and reductions
• Resolution for Max-SAT
• Optimizing with minimum satisfiability
• Minimaxsat: an efficient weighted Max-SAT solver

Cited in

(3)

• Minimal sets on propositional formulae. Problems and reductions
• Maximal falsifiability. Definitions, algorithms, and applications
• Partial minimum satisfiability: fine-grained analysis

This page was built for publication: Maximal falsifiability. Definitions, algorithms and applications

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