PURL: a new polynomial-time solvable class of satisfiability

zbMATH Open1159.68568MaRDI QIDQ3606145FDOQ3606145

Authors: J. R. Portillo, J. I. Rodrigues 

Publication date: 26 February 2009

Recommendations

• Polynomially solvable satisfiability problems
• A perspective on certain polynomial-time solvable classes of satisfiability
• Two tractable subclasses of minimal unsatisfiable formulas
• The complexity of satisfiability problems
• Hierarchies of polynomially solvable satisfiability problems

zbMATH Keywords

SATsatisfiabilityCNF-formula

Mathematics Subject Classification ID

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

Cited In (2)

• A perspective on certain polynomial-time solvable classes of satisfiability
• Title not available (Why is that?)

This page was built for publication: PURL: a new polynomial-time solvable class of satisfiability

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