scientific article; zbMATH DE number 7305751

zbMath1456.68001MaRDI QIDQ5148371

No author found.

Publication date: 4 February 2021

Full work available at URL: https://ebooks.iospress.nl/volume/handbook-of-satisfiability-second-edition

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

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Collections of articles of miscellaneous specific interest (00B15) Specification and verification (program logics, model checking, etc.) (68Q60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to computer science (68-00) Computational aspects of satisfiability (68R07)

Related Items (22)

Characterizing Tseitin-Formulas with Short Regular Resolution Refutations ⋮ On Tackling Explanation Redundancy in Decision Trees ⋮ Proof complexity of modal resolution ⋮ On CDCL-Based Proof Systems with the Ordered Decision Strategy ⋮ An Impossible Asylum ⋮ Mining definitions in Kissat with Kittens ⋮ MaxSAT resolution for regular propositional logic ⋮ Boosting branch-and-bound MaxSAT solvers with clause learning ⋮ Computing generating sets of minimal size in finite algebras ⋮ On computing probabilistic abductive explanations ⋮ Never trust your solver: certification for SAT and QBF ⋮ Optimizing quantum space using spooky pebble games ⋮ Tackling universal properties of minimal trap spaces of Boolean networks ⋮ SAF: SAT-based attractor finder in asynchronous automata networks ⋮ Unnamed Item ⋮ SAT competition 2020 ⋮ Clause redundancy and preprocessing in maximum satisfiability ⋮ Effective semantics for the modal logics K and KT via non-deterministic matrices ⋮ Proofs and Certificates for Max-SAT ⋮ SAT-based rigorous explanations for decision lists ⋮ Assessing progress in SAT solvers through the Lens of incremental SAT ⋮ On the hierarchical community structure of practical Boolean formulas

This page was built for publication: