SAT graph-based representation: A new perspective

DOI10.1016/J.JALGOR.2008.02.001MaRDI QIDQ3527692zbMATH OpenOpenAlexFDO

Authors Gilles Audemard, Said Jabbour, Lakhdar Sais

Publication date 29 September 2008

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jalgor.2008.02.001

zbMATH Keywords

backdoorsbenchmarksgraph representationpreprocessingsatisfiability

Mathematics Subject Classification ID

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

Recommendations

• Circuit Based Encoding of CNF Formula
• scientific article; zbMATH DE number 5575002
• A new 3-CNF transformation by parallel-serial graphs
• A Gröbner Basis Approach to CNF-Formulae Preprocessing
• Better test results for the graph coloring and the pigeonhole problems using DPLL with k-literal representation

Cited in

(5)

• Circuit Based Encoding of CNF Formula
• scientific article; zbMATH DE number 1769207 (Why is no real title available?)
• Better test results for the graph coloring and the pigeonhole problems using DPLL with k-literal representation
• Using extended resolution to represent strongly connected components of directed graphs
• A new 3-CNF transformation by parallel-serial graphs

Describes a project that uses

Uses Software

• DPvis
• MiniSat

This page was built for publication: SAT graph-based representation: A new perspective

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