Magic sets with full sharing
Autor(a) principal: | |
---|---|
Data de Publicação: | 1997 |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Texto Completo: | http://hdl.handle.net/1822/2216 |
Resumo: | In this paper we study the relationship between tabulation and goal-oriented bottom-up evaluation of logic programs. Differences emerge when one tries to identify features of one evaluation method in the other. We show that to obtain the same effect as tabulation in top-down evaluation, one has to perform a careful {\em adornment} in programs to be evaluated bottom-up. Furthermore we propose an efficient algorithm to perform forward subsumption che cking over adorned {\em magic facts}. |
id |
RCAP_b7adbe03bf1083159d45a3749cd36555 |
---|---|
oai_identifier_str |
oai:repositorium.sdum.uminho.pt:1822/2216 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
Magic sets with full sharingMagic setsLogic programmingScience & TechnologyIn this paper we study the relationship between tabulation and goal-oriented bottom-up evaluation of logic programs. Differences emerge when one tries to identify features of one evaluation method in the other. We show that to obtain the same effect as tabulation in top-down evaluation, one has to perform a careful {\em adornment} in programs to be evaluated bottom-up. Furthermore we propose an efficient algorithm to perform forward subsumption che cking over adorned {\em magic facts}.ElsevierUniversidade do MinhoAzevedo, Paulo J.1997-031997-03-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/1822/2216eng"Journal of logic programming". ISSN 0743-1066. 30:3 (1997).0743-1066info:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2023-07-21T12:32:38Zoai:repositorium.sdum.uminho.pt:1822/2216Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T19:28:00.825071Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
Magic sets with full sharing |
title |
Magic sets with full sharing |
spellingShingle |
Magic sets with full sharing Azevedo, Paulo J. Magic sets Logic programming Science & Technology |
title_short |
Magic sets with full sharing |
title_full |
Magic sets with full sharing |
title_fullStr |
Magic sets with full sharing |
title_full_unstemmed |
Magic sets with full sharing |
title_sort |
Magic sets with full sharing |
author |
Azevedo, Paulo J. |
author_facet |
Azevedo, Paulo J. |
author_role |
author |
dc.contributor.none.fl_str_mv |
Universidade do Minho |
dc.contributor.author.fl_str_mv |
Azevedo, Paulo J. |
dc.subject.por.fl_str_mv |
Magic sets Logic programming Science & Technology |
topic |
Magic sets Logic programming Science & Technology |
description |
In this paper we study the relationship between tabulation and goal-oriented bottom-up evaluation of logic programs. Differences emerge when one tries to identify features of one evaluation method in the other. We show that to obtain the same effect as tabulation in top-down evaluation, one has to perform a careful {\em adornment} in programs to be evaluated bottom-up. Furthermore we propose an efficient algorithm to perform forward subsumption che cking over adorned {\em magic facts}. |
publishDate |
1997 |
dc.date.none.fl_str_mv |
1997-03 1997-03-01T00:00:00Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/1822/2216 |
url |
http://hdl.handle.net/1822/2216 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
"Journal of logic programming". ISSN 0743-1066. 30:3 (1997). 0743-1066 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Elsevier |
publisher.none.fl_str_mv |
Elsevier |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
|
_version_ |
1799132774243762176 |