Forgetting in Answer Set Programming with Anonymous Cycles

Bibliographic Details
Main Author: Berthold, Matti
Publication Date: 2019
Other Authors: Gonçalves, Ricardo, Knorr, Matthias, Leite, João
Language: eng
Source: Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
Download full: http://hdl.handle.net/10362/93657
Summary: FORGET (PTDC/CCI-INF/32219/2017). NOVA LINCS (UID/CEC/04516/2019).
id RCAP_54b45aaca11d6b1fec81bc74475cf85d
oai_identifier_str oai:run.unl.pt:10362/93657
network_acronym_str RCAP
network_name_str Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
repository_id_str https://opendoar.ac.uk/repository/7160
spelling Forgetting in Answer Set Programming with Anonymous CyclesTheoretical Computer ScienceComputer Science(all)FORGET (PTDC/CCI-INF/32219/2017). NOVA LINCS (UID/CEC/04516/2019).It is now widely accepted that the operation of forgetting in the context of Answer Set Programming [10, 18] is best characterized by the so-called strong persistence, a property that requires that all existing relations between the atoms not to be forgotten be preserved. However, it has been shown that strong persistence cannot always be satisfied. What happens if we must nevertheless forget? One possibility that has been explored before is to consider weaker versions of strong persistence, although not without a cost: some relations between the atoms not to be forgotten are broken in the process. A different alternative is to enhance the logical language so that all such relations can be maintained after the forgetting operation. In this paper, we borrow from the recently introduced notion of fork [1] – a conservative extension of Equilibrium Logic and its monotonic basis, the logic of Here-and-There – which has been shown to be sufficient to overcome the problems related to satisfying strong persistence. We map this notion into the language of logic programs, enhancing it with so-called anonymous cycles, and we introduce a concrete syntactical forgetting operator over this enhanced language that we show to always obey strong persistence.SpringerNOVALincsRUNBerthold, MattiGonçalves, RicardoKnorr, MatthiasLeite, João2020-03-02T23:16:39Z20192019-01-01T00:00:00Zconference objectinfo:eu-repo/semantics/publishedVersion14application/pdfhttp://hdl.handle.net/10362/93657eng978-3-030-30243-60302-9743PURE: 15534150https://doi.org/10.1007/978-3-030-30244-3_46info:eu-repo/semantics/openAccessreponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiainstacron:RCAAP2024-05-22T17:43:49Zoai:run.unl.pt:10362/93657Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireinfo@rcaap.ptopendoar:https://opendoar.ac.uk/repository/71602025-05-28T17:15:03.892158Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiafalse
dc.title.none.fl_str_mv Forgetting in Answer Set Programming with Anonymous Cycles
title Forgetting in Answer Set Programming with Anonymous Cycles
spellingShingle Forgetting in Answer Set Programming with Anonymous Cycles
Berthold, Matti
Theoretical Computer Science
Computer Science(all)
title_short Forgetting in Answer Set Programming with Anonymous Cycles
title_full Forgetting in Answer Set Programming with Anonymous Cycles
title_fullStr Forgetting in Answer Set Programming with Anonymous Cycles
title_full_unstemmed Forgetting in Answer Set Programming with Anonymous Cycles
title_sort Forgetting in Answer Set Programming with Anonymous Cycles
author Berthold, Matti
author_facet Berthold, Matti
Gonçalves, Ricardo
Knorr, Matthias
Leite, João
author_role author
author2 Gonçalves, Ricardo
Knorr, Matthias
Leite, João
author2_role author
author
author
dc.contributor.none.fl_str_mv NOVALincs
RUN
dc.contributor.author.fl_str_mv Berthold, Matti
Gonçalves, Ricardo
Knorr, Matthias
Leite, João
dc.subject.por.fl_str_mv Theoretical Computer Science
Computer Science(all)
topic Theoretical Computer Science
Computer Science(all)
description FORGET (PTDC/CCI-INF/32219/2017). NOVA LINCS (UID/CEC/04516/2019).
publishDate 2019
dc.date.none.fl_str_mv 2019
2019-01-01T00:00:00Z
2020-03-02T23:16:39Z
dc.type.driver.fl_str_mv conference object
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/10362/93657
url http://hdl.handle.net/10362/93657
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 978-3-030-30243-6
0302-9743
PURE: 15534150
https://doi.org/10.1007/978-3-030-30244-3_46
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv 14
application/pdf
dc.publisher.none.fl_str_mv Springer
publisher.none.fl_str_mv Springer
dc.source.none.fl_str_mv reponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
instacron:RCAAP
instname_str FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
instacron_str RCAAP
institution RCAAP
reponame_str Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
collection Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
repository.name.fl_str_mv Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
repository.mail.fl_str_mv info@rcaap.pt
_version_ 1833596553064873984

Similar Items