New width parameters for SAT and #SAT

&
Artificial Intelligence 295 (C):103460 (2021)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2021.103460

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,667

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Treewidth-aware reductions of normal ASP to SAT – Is normal ASP harder than SAT after all?Markus Hecher - 2022 - Artificial Intelligence 304 (C):103651.
Resolution for Max-SAT.María Luisa Bonet, Jordi Levy & Felip Manyà - 2007 - Artificial Intelligence 171 (8-9):606-618.
SAT Competition 2020.Nils Froleyks, Marijn Heule, Markus Iser, Matti Järvisalo & Martin Suda - 2021 - Artificial Intelligence 301 (C):103572.
SAT Race 2015.Tomáš Balyo, Armin Biere, Markus Iser & Carsten Sinz - 2016 - Artificial Intelligence 241 (C):45-65.
Compiling problem specifications into SAT.Marco Cadoli & Andrea Schaerf - 2005 - Artificial Intelligence 162 (1-2):89-120.
The Configurable SAT Solver Challenge.Frank Hutter, Marius Lindauer, Adrian Balint, Sam Bayless, Holger Hoos & Kevin Leyton-Brown - 2017 - Artificial Intelligence 243 (C):1-25.
SAT-based MaxSAT algorithms.Carlos Ansótegui, Maria Luisa Bonet & Jordi Levy - 2013 - Artificial Intelligence 196 (C):77-105.
Generating SAT instances with community structure.Jesús Giráldez-Cru & Jordi Levy - 2016 - Artificial Intelligence 238:119-134.
Implicates and prime implicates in Random 3-SAT.Robert Schrag & James M. Crawford - 1996 - Artificial Intelligence 81 (1-2):199-222.
Processes and continuous change in a SAT-based planner.Ji-Ae Shin & Ernest Davis - 2005 - Artificial Intelligence 166 (1-2):194-253.

Analytics

Added to PP
2021-01-29

Downloads
19 (#1,149,754)

6 months
1 (#1,597,890)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

On the hardness of approximate reasoning.Dan Roth - 1996 - Artificial Intelligence 82 (1-2):273-302.
Bucket elimination: A unifying framework for reasoning.Rina Dechter - 1999 - Artificial Intelligence 113 (1-2):41-85.

View all 7 references / Add more references