dc.contributor.author | Martín Prieto, Rodrigo | |
dc.contributor.author | Cabalar, Pedro | |
dc.date.accessioned | 2019-09-13T13:52:51Z | |
dc.date.available | 2019-09-13T13:52:51Z | |
dc.date.issued | 2019-07-31 | |
dc.identifier.citation | 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. | es_ES |
dc.identifier.issn | 2504-3900 | |
dc.identifier.uri | http://hdl.handle.net/2183/23935 | |
dc.description.abstract | [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. | es_ES |
dc.language.iso | eng | es_ES |
dc.publisher | M D P I AG | es_ES |
dc.relation.uri | https://doi.org/10.3390/proceedings2019021022 | es_ES |
dc.rights | Atribución 3.0 España | es_ES |
dc.rights.uri | http://creativecommons.org/licenses/by/3.0/es/ | * |
dc.subject | Logic minimization | es_ES |
dc.subject | Knowledge representation | es_ES |
dc.subject | Answer set programming | es_ES |
dc.subject | Here-and-there logic | es_ES |
dc.title | Minish HAT: A Tool for the Minimization of Here-and-There Logic Programs and Theories in Answer Set Programming | es_ES |
dc.type | conference output | es_ES |
dc.rights.accessRights | open access | es_ES |
UDC.journalTitle | Proceedings | es_ES |
UDC.volume | 21 | es_ES |
UDC.issue | 1 | es_ES |
UDC.startPage | 22 | es_ES |
dc.identifier.doi | 10.3390/proceedings2019021022 | |
UDC.conferenceTitle | 2nd XoveTIC Conference, A Coruña, Spain, 5–6 September 2019. | es_ES |
UDC.coleccion | Investigación | es_ES |
UDC.departamento | Ciencias da Computación e Tecnoloxías da Información | es_ES |
UDC.grupoInv | Information Retrieval Lab (IRlab) | es_ES |