The finiteness of logic programming derivations

The finiteness of logic programming derivations

The question of the termination of logic programming computations is studied from a semantical point of view. To every program are associated two first order formulas. Their valid consequences are respectively the finiteness and the infiniteness SLDNF sets of the logic programs considered. The non-e...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Balbiani, Philippe
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Computer Science
Logic in Computer Science
Logic Program
Logic Programming
Modal Logic
Predicate Symbol
Variable Assignment
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 419
container_issue
container_start_page 403
container_title
container_volume 632
creator Balbiani, Philippe
description The question of the termination of logic programming computations is studied from a semantical point of view. To every program are associated two first order formulas. Their valid consequences are respectively the finiteness and the infiniteness SLDNF sets of the logic programs considered. The non-existence of a recursive safe computation rule leading into an infinite SLDNF computation is proved.
doi_str_mv 10.1007/BFb0013840
format Conference Proceeding
fullrecord <record><control><sourceid>hal_sprin</sourceid><recordid>TN_cdi_hal_primary_oai_HAL_hal_03252315v1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>oai_HAL_hal_03252315v1</sourcerecordid><originalsourceid>FETCH-LOGICAL-h220t-103383e91ceae4413e7479fc32fb9f99d216befb81e58bcf949ccda03db2175a3</originalsourceid><addsrcrecordid>eNpFkE1LAzEQhuMXWGsv_oI96mHtTCbbJMdarBUKXip4C9ndZBttN2VTCv77bqngXF6Y92FgHsYeEJ4RQI5f5iUAkhJwwUZaKioECEnA-SUb4AQxJxL6it2diqJQkr6u2QB6INdS0C0bpfQN_RBHUJMBG6_WLvOhDXvXupSy6LNNbEKV7brYdHa7DW2T1a4LB7sPsU337MbbTXKjvxyyz_nrarbIlx9v77PpMl9zDvscgUiR01g564RAclJI7SvivtRe65rjpHS-VOgKVVZeC11VtQWqS46ysDRkT-e7a7sxuy5sbfdrog1mMV2a067_oOCExQF79vHMph5sG9eZMsafZBDMSZr5l0ZH0LVYgQ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>The finiteness of logic programming derivations</title><source>Springer Books</source><creator>Balbiani, Philippe</creator><contributor>Kirchner, Hélène ; Levi, Giorgio</contributor><creatorcontrib>Balbiani, Philippe ; Kirchner, Hélène ; Levi, Giorgio</creatorcontrib><description>The question of the termination of logic programming computations is studied from a semantical point of view. To every program are associated two first order formulas. Their valid consequences are respectively the finiteness and the infiniteness SLDNF sets of the logic programs considered. The non-existence of a recursive safe computation rule leading into an infinite SLDNF computation is proved.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 354055873X</identifier><identifier>ISBN: 9783540558736</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540473022</identifier><identifier>EISBN: 3540473025</identifier><identifier>DOI: 10.1007/BFb0013840</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Computer Science ; Logic in Computer Science ; Logic Program ; Logic Programming ; Modal Logic ; Predicate Symbol ; Variable Assignment</subject><ispartof>Algebraic and Logic Programming, 2005, Vol.632, p.403-419</ispartof><rights>Springer-Verlag Berlin Heidelberg 1992</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><orcidid>0000-0002-3569-9160</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/BFb0013840$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/BFb0013840$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>230,309,310,775,776,780,785,786,789,881,27904,38234,41421,42490</link.rule.ids><backlink>$$Uhttps://hal.science/hal-03252315$$DView record in HAL$$Hfree_for_read</backlink></links><search><contributor>Kirchner, Hélène</contributor><contributor>Levi, Giorgio</contributor><creatorcontrib>Balbiani, Philippe</creatorcontrib><title>The finiteness of logic programming derivations</title><title>Algebraic and Logic Programming</title><description>The question of the termination of logic programming computations is studied from a semantical point of view. To every program are associated two first order formulas. Their valid consequences are respectively the finiteness and the infiniteness SLDNF sets of the logic programs considered. The non-existence of a recursive safe computation rule leading into an infinite SLDNF computation is proved.</description><subject>Computer Science</subject><subject>Logic in Computer Science</subject><subject>Logic Program</subject><subject>Logic Programming</subject><subject>Modal Logic</subject><subject>Predicate Symbol</subject><subject>Variable Assignment</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>354055873X</isbn><isbn>9783540558736</isbn><isbn>9783540473022</isbn><isbn>3540473025</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpFkE1LAzEQhuMXWGsv_oI96mHtTCbbJMdarBUKXip4C9ndZBttN2VTCv77bqngXF6Y92FgHsYeEJ4RQI5f5iUAkhJwwUZaKioECEnA-SUb4AQxJxL6it2diqJQkr6u2QB6INdS0C0bpfQN_RBHUJMBG6_WLvOhDXvXupSy6LNNbEKV7brYdHa7DW2T1a4LB7sPsU337MbbTXKjvxyyz_nrarbIlx9v77PpMl9zDvscgUiR01g564RAclJI7SvivtRe65rjpHS-VOgKVVZeC11VtQWqS46ysDRkT-e7a7sxuy5sbfdrog1mMV2a067_oOCExQF79vHMph5sG9eZMsafZBDMSZr5l0ZH0LVYgQ</recordid><startdate>20050609</startdate><enddate>20050609</enddate><creator>Balbiani, Philippe</creator><general>Springer Berlin Heidelberg</general><scope>1XC</scope><scope>VOOES</scope><orcidid>https://orcid.org/0000-0002-3569-9160</orcidid></search><sort><creationdate>20050609</creationdate><title>The finiteness of logic programming derivations</title><author>Balbiani, Philippe</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-h220t-103383e91ceae4413e7479fc32fb9f99d216befb81e58bcf949ccda03db2175a3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Computer Science</topic><topic>Logic in Computer Science</topic><topic>Logic Program</topic><topic>Logic Programming</topic><topic>Modal Logic</topic><topic>Predicate Symbol</topic><topic>Variable Assignment</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Balbiani, Philippe</creatorcontrib><collection>Hyper Article en Ligne (HAL)</collection><collection>Hyper Article en Ligne (HAL) (Open Access)</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Balbiani, Philippe</au><au>Kirchner, Hélène</au><au>Levi, Giorgio</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>The finiteness of logic programming derivations</atitle><btitle>Algebraic and Logic Programming</btitle><date>2005-06-09</date><risdate>2005</risdate><volume>632</volume><spage>403</spage><epage>419</epage><pages>403-419</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>354055873X</isbn><isbn>9783540558736</isbn><eisbn>9783540473022</eisbn><eisbn>3540473025</eisbn><abstract>The question of the termination of logic programming computations is studied from a semantical point of view. To every program are associated two first order formulas. Their valid consequences are respectively the finiteness and the infiniteness SLDNF sets of the logic programs considered. The non-existence of a recursive safe computation rule leading into an infinite SLDNF computation is proved.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/BFb0013840</doi><tpages>17</tpages><orcidid>https://orcid.org/0000-0002-3569-9160</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0302-9743
ispartof Algebraic and Logic Programming, 2005, Vol.632, p.403-419
issn 0302-9743
1611-3349
language eng
recordid cdi_hal_primary_oai_HAL_hal_03252315v1
source Springer Books
subjects Computer Science
Logic in Computer Science
Logic Program
Logic Programming
Modal Logic
Predicate Symbol
Variable Assignment
title The finiteness of logic programming derivations
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-22T14%3A13%3A50IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-hal_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=The%20finiteness%20of%20logic%20programming%20derivations&rft.btitle=Algebraic%20and%20Logic%20Programming&rft.au=Balbiani,%20Philippe&rft.date=2005-06-09&rft.volume=632&rft.spage=403&rft.epage=419&rft.pages=403-419&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=354055873X&rft.isbn_list=9783540558736&rft_id=info:doi/10.1007/BFb0013840&rft_dat=%3Chal_sprin%3Eoai_HAL_hal_03252315v1%3C/hal_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540473022&rft.eisbn_list=3540473025&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true