Reasoning About NP-complete Constraints - LAAS - Laboratoire d'Analyse et d'Architecture des Systèmes Access content directly
Conference Papers Year : 2018

Reasoning About NP-complete Constraints

Abstract

The concept of local consistency-making global deductions from local infeasibility-is central to constraint programming. When reasoning about NP-complete constraints, however, since achieving a "complete" form of local consistency is often considered too hard, we need other tools to design and analyze propagation algorithms. In this paper, we argue that NP-complete constraints are an essential part of constraint programming , that designing dedicated methods has lead to, and will bring, significant breakthroughs, and that we need to carefully investigate methods to deal about a necessarily incomplete inference. In particular, we advocate the use of fixed-parameter tractability and kernelization to this purpose.
Fichier principal
Vignette du fichier
paper.pdf (180.79 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01873503 , version 1 (13-09-2018)

Identifiers

  • HAL Id : hal-01873503 , version 1

Cite

Emmanuel Hébrard. Reasoning About NP-complete Constraints. 27th International Joint Conference on Artificial Intelligence (IJCAI 2018), Jul 2018, Stockholm, Sweden. 5p. ⟨hal-01873503⟩
32 View
5 Download

Share

Gmail Facebook X LinkedIn More