scientific article; zbMATH DE number 6930338

zbMath1394.68359MaRDI QIDQ4583686

João P. Marques-Silva

Publication date: 3 September 2018

Full work available at URL: http://www.oldcitypublishing.com/journals/mvlsc-home/mvlsc-issue-contents/mvlsc-volume-19-number-1-3-2012/mvlsc-19-1-3-p-163-183/

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Boolean satisfiabilityminimally unsatisfiable subformulasextensions of Boolean satisfiabilityunsatisfiability proofs

Mathematics Subject Classification ID

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

Related Items (6)

On computing minimal independent support and its applications to sampling and counting ⋮ Extracting unsatisfiable cores for LTL via temporal resolution ⋮ Minimal sets on propositional formulae. Problems and reductions ⋮ On Davis-Putnam reductions for minimally unsatisfiable clause-sets ⋮ Enhancing unsatisfiable cores for LTL with information on temporal relevance ⋮ On the complexity of inconsistency measurement

This page was built for publication: