A New Formulation of Tabled Resolution with Delay
Tabling has become important to logic programming in part because it opens new application areas, such as model checking, to logic programming techniques. However, the development of new extensions of tabled logic programming is becoming restricted by the formalisms that underly it. Formalisms for t...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buchkapitel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 177 |
---|---|
container_issue | |
container_start_page | 163 |
container_title | |
container_volume | |
creator | Swift, Terrance |
description | Tabling has become important to logic programming in part because it opens new application areas, such as model checking, to logic programming techniques. However, the development of new extensions of tabled logic programming is becoming restricted by the formalisms that underly it. Formalisms for tabled evaluations, such as SLG [3], are generally developed with a view to a specific set of allowable operations that can be performed in an evaluation. In the case of SLG, tabling operations are based on a variance relation between atoms. While the set of SLG tabling operations has proven useful for a number of applications, other types of operations, such as those based on a subsumption relation between atoms, can have practical uses. In this paper, SLG is reformulated in two ways: so that it can be parameterized using different sets of operations; and so that a forest of trees paradigm is used. Equivalence to SLG of the new formulation, Extended SLG or SLGX, is shown when the new formalism is parameterized by variant-based operations. In addition, SLGX is also parameterized by subsumption-based operations and shown correct for queries to the well-founded model. Finally, the usefulness of the forest of trees paradigm for motivating tabling optimizations is shown by formalizing the concept of relevance within a tabled evaluation. |
doi_str_mv | 10.1007/3-540-48159-1_12 |
format | Book Chapter |
fullrecord | <record><control><sourceid>proquest_pasca</sourceid><recordid>TN_cdi_pascalfrancis_primary_1828783</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>EBC3073055_17_173</sourcerecordid><originalsourceid>FETCH-LOGICAL-p1822-dcc31fffbc505ab13af0b503e57e476a327ab7c083b702ba8b2486b9175e8273</originalsourceid><addsrcrecordid>eNotUDtPwzAQNk8RSnfGDKwuPp8dO2NVKCBVIKEObJadOjSQNiFOVfXf4z5OJ530vU76CLkHNgLG1CNSKRgVGmROwQA_I7cYkQMA5ySBDIAiivziSGSZFPrrkiQMGae5EnhNklxqyYFhfkOGIfywOMhlLnhCYJy--206bbrVprZ91azTpkzn1tV-kX760NSbA7it-mX65Gu7uyNXpa2DH57ugMynz_PJK519vLxNxjPaguacLooCoSxLV0gmrQO0JXOSoZfKC5VZ5Mo6VTCNTjHurHZc6MzloKTXXOGAPBxjWxsKW5edXRdVMG1XrWy3M_GHVhqjbHSUhcisv31nXNP8BgPM7PszaGIp5lCX2fcXDXjK7Zq_jQ-98XtH4dd9Z-tiadved8EgU8ikNKDiIv4D5plsDQ</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype><pqid>EBC3073055_17_173</pqid></control><display><type>book_chapter</type><title>A New Formulation of Tabled Resolution with Delay</title><source>Springer Books</source><creator>Swift, Terrance</creator><contributor>Goos, G ; Hartmanis, J ; van Leeuwen, J ; Alferes, José J. ; Barahona, Pedro</contributor><creatorcontrib>Swift, Terrance ; Goos, G ; Hartmanis, J ; van Leeuwen, J ; Alferes, José J. ; Barahona, Pedro</creatorcontrib><description>Tabling has become important to logic programming in part because it opens new application areas, such as model checking, to logic programming techniques. However, the development of new extensions of tabled logic programming is becoming restricted by the formalisms that underly it. Formalisms for tabled evaluations, such as SLG [3], are generally developed with a view to a specific set of allowable operations that can be performed in an evaluation. In the case of SLG, tabling operations are based on a variance relation between atoms. While the set of SLG tabling operations has proven useful for a number of applications, other types of operations, such as those based on a subsumption relation between atoms, can have practical uses. In this paper, SLG is reformulated in two ways: so that it can be parameterized using different sets of operations; and so that a forest of trees paradigm is used. Equivalence to SLG of the new formulation, Extended SLG or SLGX, is shown when the new formalism is parameterized by variant-based operations. In addition, SLGX is also parameterized by subsumption-based operations and shown correct for queries to the well-founded model. Finally, the usefulness of the forest of trees paradigm for motivating tabling optimizations is shown by formalizing the concept of relevance within a tabled evaluation.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 354066548X</identifier><identifier>ISBN: 9783540665489</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540481591</identifier><identifier>EISBN: 9783540481591</identifier><identifier>DOI: 10.1007/3-540-48159-1_12</identifier><identifier>OCLC: 958521039</identifier><identifier>LCCallNum: Q334-342TJ210.2-211</identifier><language>eng</language><publisher>Germany: Springer Berlin / Heidelberg</publisher><subject>Applied sciences ; Artificial intelligence ; Computer science; control theory; systems ; Exact sciences and technology ; Logic Programming ; Non-Monotonic Reasoning ; Problem solving, game playing ; Programming theory ; Theoretical computing</subject><ispartof>Lecture notes in computer science, 1999, p.163-177</ispartof><rights>Springer-Verlag Berlin Heidelberg 1999</rights><rights>1999 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttps://ebookcentral.proquest.com/covers/3073055-l.jpg</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/3-540-48159-1_12$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/3-540-48159-1_12$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,4050,4051,27925,38255,41442,42511</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=1828783$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Goos, G</contributor><contributor>Hartmanis, J</contributor><contributor>van Leeuwen, J</contributor><contributor>Alferes, José J.</contributor><contributor>Barahona, Pedro</contributor><creatorcontrib>Swift, Terrance</creatorcontrib><title>A New Formulation of Tabled Resolution with Delay</title><title>Lecture notes in computer science</title><description>Tabling has become important to logic programming in part because it opens new application areas, such as model checking, to logic programming techniques. However, the development of new extensions of tabled logic programming is becoming restricted by the formalisms that underly it. Formalisms for tabled evaluations, such as SLG [3], are generally developed with a view to a specific set of allowable operations that can be performed in an evaluation. In the case of SLG, tabling operations are based on a variance relation between atoms. While the set of SLG tabling operations has proven useful for a number of applications, other types of operations, such as those based on a subsumption relation between atoms, can have practical uses. In this paper, SLG is reformulated in two ways: so that it can be parameterized using different sets of operations; and so that a forest of trees paradigm is used. Equivalence to SLG of the new formulation, Extended SLG or SLGX, is shown when the new formalism is parameterized by variant-based operations. In addition, SLGX is also parameterized by subsumption-based operations and shown correct for queries to the well-founded model. Finally, the usefulness of the forest of trees paradigm for motivating tabling optimizations is shown by formalizing the concept of relevance within a tabled evaluation.</description><subject>Applied sciences</subject><subject>Artificial intelligence</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Logic Programming</subject><subject>Non-Monotonic Reasoning</subject><subject>Problem solving, game playing</subject><subject>Programming theory</subject><subject>Theoretical computing</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>354066548X</isbn><isbn>9783540665489</isbn><isbn>3540481591</isbn><isbn>9783540481591</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>1999</creationdate><recordtype>book_chapter</recordtype><recordid>eNotUDtPwzAQNk8RSnfGDKwuPp8dO2NVKCBVIKEObJadOjSQNiFOVfXf4z5OJ530vU76CLkHNgLG1CNSKRgVGmROwQA_I7cYkQMA5ySBDIAiivziSGSZFPrrkiQMGae5EnhNklxqyYFhfkOGIfywOMhlLnhCYJy--206bbrVprZ91azTpkzn1tV-kX760NSbA7it-mX65Gu7uyNXpa2DH57ugMynz_PJK519vLxNxjPaguacLooCoSxLV0gmrQO0JXOSoZfKC5VZ5Mo6VTCNTjHurHZc6MzloKTXXOGAPBxjWxsKW5edXRdVMG1XrWy3M_GHVhqjbHSUhcisv31nXNP8BgPM7PszaGIp5lCX2fcXDXjK7Zq_jQ-98XtH4dd9Z-tiadved8EgU8ikNKDiIv4D5plsDQ</recordid><startdate>1999</startdate><enddate>1999</enddate><creator>Swift, Terrance</creator><general>Springer Berlin / Heidelberg</general><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>FFUUA</scope><scope>IQODW</scope></search><sort><creationdate>1999</creationdate><title>A New Formulation of Tabled Resolution with Delay</title><author>Swift, Terrance</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p1822-dcc31fffbc505ab13af0b503e57e476a327ab7c083b702ba8b2486b9175e8273</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>1999</creationdate><topic>Applied sciences</topic><topic>Artificial intelligence</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Logic Programming</topic><topic>Non-Monotonic Reasoning</topic><topic>Problem solving, game playing</topic><topic>Programming theory</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Swift, Terrance</creatorcontrib><collection>ProQuest Ebook Central - Book Chapters - Demo use only</collection><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Swift, Terrance</au><au>Goos, G</au><au>Hartmanis, J</au><au>van Leeuwen, J</au><au>Alferes, José J.</au><au>Barahona, Pedro</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>A New Formulation of Tabled Resolution with Delay</atitle><btitle>Lecture notes in computer science</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>1999</date><risdate>1999</risdate><spage>163</spage><epage>177</epage><pages>163-177</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>354066548X</isbn><isbn>9783540665489</isbn><eisbn>3540481591</eisbn><eisbn>9783540481591</eisbn><abstract>Tabling has become important to logic programming in part because it opens new application areas, such as model checking, to logic programming techniques. However, the development of new extensions of tabled logic programming is becoming restricted by the formalisms that underly it. Formalisms for tabled evaluations, such as SLG [3], are generally developed with a view to a specific set of allowable operations that can be performed in an evaluation. In the case of SLG, tabling operations are based on a variance relation between atoms. While the set of SLG tabling operations has proven useful for a number of applications, other types of operations, such as those based on a subsumption relation between atoms, can have practical uses. In this paper, SLG is reformulated in two ways: so that it can be parameterized using different sets of operations; and so that a forest of trees paradigm is used. Equivalence to SLG of the new formulation, Extended SLG or SLGX, is shown when the new formalism is parameterized by variant-based operations. In addition, SLGX is also parameterized by subsumption-based operations and shown correct for queries to the well-founded model. Finally, the usefulness of the forest of trees paradigm for motivating tabling optimizations is shown by formalizing the concept of relevance within a tabled evaluation.</abstract><cop>Germany</cop><pub>Springer Berlin / Heidelberg</pub><doi>10.1007/3-540-48159-1_12</doi><oclcid>958521039</oclcid><tpages>15</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0302-9743 |
ispartof | Lecture notes in computer science, 1999, p.163-177 |
issn | 0302-9743 1611-3349 |
language | eng |
recordid | cdi_pascalfrancis_primary_1828783 |
source | Springer Books |
subjects | Applied sciences Artificial intelligence Computer science control theory systems Exact sciences and technology Logic Programming Non-Monotonic Reasoning Problem solving, game playing Programming theory Theoretical computing |
title | A New Formulation of Tabled Resolution with Delay |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-25T09%3A34%3A51IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=A%20New%20Formulation%20of%20Tabled%20Resolution%20with%20Delay&rft.btitle=Lecture%20notes%20in%20computer%20science&rft.au=Swift,%20Terrance&rft.date=1999&rft.spage=163&rft.epage=177&rft.pages=163-177&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=354066548X&rft.isbn_list=9783540665489&rft_id=info:doi/10.1007/3-540-48159-1_12&rft_dat=%3Cproquest_pasca%3EEBC3073055_17_173%3C/proquest_pasca%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540481591&rft.eisbn_list=9783540481591&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=EBC3073055_17_173&rft_id=info:pmid/&rfr_iscdi=true |