Skip navigation
  •  Inicio
  • UDC 
    • Cómo depositar
    • Políticas del RUC
    • FAQ
    • Derechos de autor
    • Más información en INFOguías UDC
  • Listar 
    • Comunidades
    • Buscar por:
    • Fecha de publicación
    • Autor
    • Título
    • Materia
  • Ayuda
    • español
    • Gallegan
    • English
  • Acceder
  •  Español 
    • Español
    • Galego
    • English
  
Ver ítem 
  •   RUC
  • Facultade de Informática
  • Investigación (FIC)
  • Ver ítem
  •   RUC
  • Facultade de Informática
  • Investigación (FIC)
  • Ver ítem
JavaScript is disabled for your browser. Some features of this site may not work without it.

Minish HAT: A Tool for the Minimization of Here-and-There Logic Programs and Theories in Answer Set Programming

Thumbnail
Ver/Abrir
R.Martin_2019_Minish_HAT_A_Tool_for_the_Minimization_of_Here-and-There_Logic_Programs_and_Theories.pdf (180.9Kb)
Use este enlace para citar
http://hdl.handle.net/2183/23935
Atribución 3.0 España
Excepto si se señala otra cosa, la licencia del ítem se describe como Atribución 3.0 España
Colecciones
  • Investigación (FIC) [1685]
Metadatos
Mostrar el registro completo del ítem
Título
Minish HAT: A Tool for the Minimization of Here-and-There Logic Programs and Theories in Answer Set Programming
Autor(es)
Martín Prieto, Rodrigo
Cabalar, Pedro
Fecha
2019-07-31
Cita bibliográfica
Martin, R.; Cabalar, P. Minish HAT: A Tool for the Minimization of Here-and-There Logic Programs and Theories in Answer Set Programming. Proceedings 2019, 21, 22.
Resumen
[Abstract] When it comes to the writing of a new logic program or theory, it is of great importance to obtain a concise and minimal representation, for simplicity and ease of interpretation reasons. There are already a few methods and many tools, such as Karnaugh Maps or the Quine-McCluskey method, as well as their numerous software implementations, that solve this minimization problem in Boolean logic. This is not the case for Here-and-There logic, also called three-valued logic. Even though there are theoretical minimization methods for logic theories and programs, there aren’t any published tools that are able to obtain a minimal equivalent logic program. In this paper we present the first version of a tool called that is able to efficiently obtain minimal and equivalent representations for any logic program in Here-and-There. The described tool uses an hybrid method both leveraging a modified version of the Quine-McCluskey algorithm and Answer Set Programming techniques to minimize fairly complex logic programs in a reduced time.
Palabras clave
Logic minimization
Knowledge representation
Answer set programming
Here-and-there logic
 
Versión del editor
https://doi.org/10.3390/proceedings2019021022
Derechos
Atribución 3.0 España
ISSN
2504-3900

Listar

Todo RUCComunidades & ColeccionesPor fecha de publicaciónAutoresTítulosMateriasGrupo de InvestigaciónTitulaciónEsta colecciónPor fecha de publicaciónAutoresTítulosMateriasGrupo de InvestigaciónTitulación

Mi cuenta

AccederRegistro

Estadísticas

Ver Estadísticas de uso
Sherpa
OpenArchives
OAIster
Scholar Google
UNIVERSIDADE DA CORUÑA. Servizo de Biblioteca.    DSpace Software Copyright © 2002-2013 Duraspace - Sugerencias