Treewidth-aware reductions of normal ASP to SAT – Is normal ASP harder than SAT after all?

Artificial Intelligence 304 (C):103651 (2022)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2021.103651

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,247

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

The multi-engine asp solver me-asp.Marco Maratea, Luca Pulina & Francesco Ricca - 2012 - In Luis Farinas del Cerro, Andreas Herzig & Jerome Mengin (eds.), Logics in Artificial Intelligence. Springer. pp. 484--487.
New width parameters for SAT and #SAT.Robert Ganian & Stefan Szeider - 2021 - Artificial Intelligence 295 (C):103460.
Syntactic ASP forgetting with forks.Felicidad Aguado, Pedro Cabalar, Jorge Fandinno, David Pearce, Gilberto Pérez & Concepción Vidal - 2024 - Artificial Intelligence 326 (C):104033.
Domain expansion for ASP-programs with external sources.Thomas Eiter, Michael Fink, Thomas Krennwallner & Christoph Redl - 2016 - Artificial Intelligence 233 (C):84-121.
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.

Analytics

Added to PP
2022-04-08

Downloads
21 (#1,005,339)

6 months
6 (#858,075)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Parameterized Complexity Theory.J. Flum - 2007 - Bulletin of Symbolic Logic 13 (2):246-248.

Add more references