Reasoning About Strong Inconsistency in ASP

The last decade has witnessed remarkable improvements in the analysis of inconsistent formulas, namely in the case of Boolean Satisfiability (SAT) formulas. However, these successes have been restricted to monotonic logics. Recent work proposed the notion of strong inconsistency for a number of non-...

Descripción completa

Detalles Bibliográficos
Autores principales: Mencía, Carlos, Marques-Silva, Joao
Formato: Online Artículo Texto
Lenguaje:English
Publicado: 2020
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7326556/
http://dx.doi.org/10.1007/978-3-030-51825-7_24
_version_ 1783552370072879104
author Mencía, Carlos
Marques-Silva, Joao
author_facet Mencía, Carlos
Marques-Silva, Joao
author_sort Mencía, Carlos
collection PubMed
description The last decade has witnessed remarkable improvements in the analysis of inconsistent formulas, namely in the case of Boolean Satisfiability (SAT) formulas. However, these successes have been restricted to monotonic logics. Recent work proposed the notion of strong inconsistency for a number of non-monotonic logics, including Answer Set Programming (ASP). This paper shows how algorithms for reasoning about inconsistency in monotonic logics can be extended to the case of ASP programs, in the concrete case of strong inconsistency. Initial experimental results illustrate the potential of the proposed approach.
format Online
Article
Text
id pubmed-7326556
institution National Center for Biotechnology Information
language English
publishDate 2020
record_format MEDLINE/PubMed
spelling pubmed-73265562020-07-01 Reasoning About Strong Inconsistency in ASP Mencía, Carlos Marques-Silva, Joao Theory and Applications of Satisfiability Testing – SAT 2020 Article The last decade has witnessed remarkable improvements in the analysis of inconsistent formulas, namely in the case of Boolean Satisfiability (SAT) formulas. However, these successes have been restricted to monotonic logics. Recent work proposed the notion of strong inconsistency for a number of non-monotonic logics, including Answer Set Programming (ASP). This paper shows how algorithms for reasoning about inconsistency in monotonic logics can be extended to the case of ASP programs, in the concrete case of strong inconsistency. Initial experimental results illustrate the potential of the proposed approach. 2020-06-26 /pmc/articles/PMC7326556/ http://dx.doi.org/10.1007/978-3-030-51825-7_24 Text en © Springer Nature Switzerland AG 2020 This article is made available via the PMC Open Access Subset for unrestricted research re-use and secondary analysis in any form or by any means with acknowledgement of the original source. These permissions are granted for the duration of the World Health Organization (WHO) declaration of COVID-19 as a global pandemic.
spellingShingle Article
Mencía, Carlos
Marques-Silva, Joao
Reasoning About Strong Inconsistency in ASP
title Reasoning About Strong Inconsistency in ASP
title_full Reasoning About Strong Inconsistency in ASP
title_fullStr Reasoning About Strong Inconsistency in ASP
title_full_unstemmed Reasoning About Strong Inconsistency in ASP
title_short Reasoning About Strong Inconsistency in ASP
title_sort reasoning about strong inconsistency in asp
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7326556/
http://dx.doi.org/10.1007/978-3-030-51825-7_24
work_keys_str_mv AT menciacarlos reasoningaboutstronginconsistencyinasp
AT marquessilvajoao reasoningaboutstronginconsistencyinasp

Ejemplares similares