Symmetric explanation learning: effective dynamic symmetry handling for SAT

DOI10.1007/978-3-319-66263-3_6MaRDI QIDQ1680245zbMATH OpenOpenAlexFDO

Authors Jo Devriendt, Bart Bogaerts, Maurice Bruynooghe

Publication date 15 November 2017

Full work available at URL https://doi.org/10.1007/978-3-319-66263-3_6

zbMATH Keywords

symmetryproof theoryBoolean satisfiabilitydynamic symmetry breakingsymmetric learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Recommendations

• \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver
• CDCLSym: introducing effective symmetry breaking in SAT solving
• Improved static symmetry breaking for SAT
• Symmetry and Satisfiability: An Update
• On certifying the UNSAT result of dynamic symmetry-handling-based SAT solvers

Cited in

(8)

• On certifying the UNSAT result of dynamic symmetry-handling-based SAT solvers
• Dynamic symmetry-breaking for Boolean satisfiability
• A SAT-based approach to learn explainable decision sets
• SAT modulo symmetries for graph generation and enumeration
• scientific article; zbMATH DE number 7455719 (Why is no real title available?)
• \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver
• An adaptive prefix-assignment technique for symmetry reduction
• Certified dominance and symmetry breaking for combinatorial optimisation

Describes a project that uses

Uses Software

• Glucose
• Chaff
• SymChaff
• MiniSat

This page was built for publication: Symmetric explanation learning: effective dynamic symmetry handling for SAT

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