Year: 2025
Type: article
Abstract: The SAT problem is important in the theory of computational complexity. It has been deeply studied because solutions for fragments of SAT can be transformed into solutions for several CSPs, including problems in areas such as Artificial Intelligence and Operations Research. Although SAT is an NP-complete problem, it is known that SAT is fixed-parameter tractable if we take any hypertree width as a parameter. In this work, we present several hypergraphs and countable classes of hypergraphs. For these classes of hypergraphs, we analyze their generalized hypertree width to prove that all the CSPs modeled with those hypergraphs are tractable.
Institution: Benemérita Universidad Autónoma de Puebla
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4415089358
FWCI:
Cites:
Cited by:
Related to: