Una introducción a la programación con conjuntos de respuesta. Aplicaciones
| Autor: | Jiménez Núñez, Marina |
|---|---|
| Přispěvatelé: | Cordón Franco, Andrés, Hidalgo Doblado, María José, Universidad de Sevilla. Departamento de Ciencias de la computación e Ineligencia artificial |
| Jazyk: | Spanish; Castilian |
| Rok vydání: | 2022 |
| Zdroj: | idUS. Depósito de Investigación de la Universidad de Sevilla instname |
| Popis: | The main objective of this paper is to present the answer set programming paradigm as a tool to model and solve combinatorial problems, in general, and especially NP-complete or NP-hard problems. First, in chapters 1 and 2, we are going to focus on carrying out a theorical development to help us learning how to program in ASP and, in particular, in CLINGO, and some properties that ASP programs have. In the following chapters, 3 and 4, we are going to study representations of real situations and problems to apply these results then to relevant mathematical problems in chapter 5. Finally, in chapter 6, we study puzzles in which deciding whether there is a solution to them is a NP- complete problem. Universidad de Sevilla. Grado en Matemáticas |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|