Generating models of a matched formula with a polynomial delay

DOI10.1613/JAIR.4989MaRDI QIDQ5739835zbMATH OpenOpenAlexFDO

Authors Petr Savický, Petr Kučera

Publication date 5 July 2016

Published in Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1613/jair.4989

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• A perspective on certain polynomial-time solvable classes of satisfiability
• Counting models for 2SAT and 3SAT formulae
• Generalizations of matched CNF formulas
• Matched Formulas and Backdoor Sets
• On minimum representations of matched formulas

Cited in

(3)

• Generalizations of matched CNF formulas
• Phase transition in matched formulas and a heuristic for biclique satisfiability
• Generating clause sequences of a CNF formula

This page was built for publication: Generating models of a matched formula with a polynomial delay

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