A Comparison of Sceptical NAF-Free Logic Programming Approaches

A Comparison of Sceptical NAF-Free Logic Programming Approaches

Recently there has been increased interest in logic programming- based default reasoning approaches which are not using negation-as failure in their object language. Instead, default reasoning is modelled by rules and a priority relation among them. Historically the first logic in this class was Def...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Antoniou, G., Maher, M. J., Billington, Billington, Governatori, G.
Format: Buchkapitel
Sprache:eng
Schlagworte:
Applied sciences
Artificial intelligence
Computer science
control theory
systems
Exact sciences and technology
Learning and adaptive systems
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 356
container_issue
container_start_page 347
container_title
container_volume
creator Antoniou, G.
Maher, M. J.
Billington, Billington
Governatori, G.
description Recently there has been increased interest in logic programming- based default reasoning approaches which are not using negation-as failure in their object language. Instead, default reasoning is modelled by rules and a priority relation among them. Historically the first logic in this class was Defeasible Logic. In this paper we will study its relationship to other approaches which also rely on the idea of using logic rules and priorities. In particular we will study sceptical LPwNF, courteous logic programs, and priority logic.
doi_str_mv 10.1007/3-540-46767-X_25
format Book Chapter
fullrecord <record><control><sourceid>proquest_pasca</sourceid><recordid>TN_cdi_pascalfrancis_primary_1172530</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>EBC3072669_31_357</sourcerecordid><originalsourceid>FETCH-LOGICAL-p309t-b1e75eef51406b1f218e3cedba06f75aad6d6c602677686195fabc0785ac4ad53</originalsourceid><addsrcrecordid>eNo9UD1PwzAQNZ-igu6MGVgNd77YTiZUVRSQKkACJDbLcZ020MbBDgP_npQibjnpfenpMXaOcIkA-oq4zIHnSivN34yQe2xc6oIG8BeDfTZChciJ8vLgn1NK5yUcshEQCF7qnI7ZqJSFFIiAJ2yc0jsMRyKXgkbsepJNw6azsUmhzUKdPTvf9Y2z6-xhMuOz6H02D8vGZU8xLKPdbJp2mU26LgbrVj6dsaParpMf__1T9jq7eZne8fnj7f10MucdQdnzCr2W3tcSh4oV1gILT84vKguq1tLahVoop0AorVWhsJS1rRzoQlqX24WkU3axy-1sGsrV0bauSaaLzcbGb4OohSQYZJc7WRqYdumjqUL4SAbBbEc1ZIaNzO-AZjvqYKC_3Bg-v3zqjd86nG_7aNduZbvex2QItFCqNISGpKYfkjxzQw</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype><pqid>EBC3072669_31_357</pqid></control><display><type>book_chapter</type><title>A Comparison of Sceptical NAF-Free Logic Programming Approaches</title><source>Springer Books</source><creator>Antoniou, G. ; Maher, M. J. ; Billington, Billington ; Governatori, G.</creator><contributor>Goos, G ; Hartmanis, J ; van Leeuwen, J ; Pfeifer, Gerald ; Leone, Nicola ; Gelfond, Michael</contributor><creatorcontrib>Antoniou, G. ; Maher, M. J. ; Billington, Billington ; Governatori, G. ; Goos, G ; Hartmanis, J ; van Leeuwen, J ; Pfeifer, Gerald ; Leone, Nicola ; Gelfond, Michael</creatorcontrib><description>Recently there has been increased interest in logic programming- based default reasoning approaches which are not using negation-as failure in their object language. Instead, default reasoning is modelled by rules and a priority relation among them. Historically the first logic in this class was Defeasible Logic. In this paper we will study its relationship to other approaches which also rely on the idea of using logic rules and priorities. In particular we will study sceptical LPwNF, courteous logic programs, and priority logic.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540667490</identifier><identifier>ISBN: 3540667490</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540467670</identifier><identifier>EISBN: 354046767X</identifier><identifier>DOI: 10.1007/3-540-46767-X_25</identifier><identifier>OCLC: 958521101</identifier><identifier>LCCallNum: QA76.63.L645 1999</identifier><language>eng</language><publisher>Germany: Springer Berlin / Heidelberg</publisher><subject>Applied sciences ; Artificial intelligence ; Computer science; control theory; systems ; Exact sciences and technology ; Learning and adaptive systems</subject><ispartof>Lecture notes in computer science, 1999, p.347-356</ispartof><rights>Springer-Verlag Berlin Heidelberg 1999</rights><rights>2000 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><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/3072669-l.jpg</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/3-540-46767-X_25$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/3-540-46767-X_25$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>310,311,780,781,785,790,791,794,4051,4052,27930,38260,41447,42516</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=1172530$$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>Pfeifer, Gerald</contributor><contributor>Leone, Nicola</contributor><contributor>Gelfond, Michael</contributor><creatorcontrib>Antoniou, G.</creatorcontrib><creatorcontrib>Maher, M. J.</creatorcontrib><creatorcontrib>Billington, Billington</creatorcontrib><creatorcontrib>Governatori, G.</creatorcontrib><title>A Comparison of Sceptical NAF-Free Logic Programming Approaches</title><title>Lecture notes in computer science</title><description>Recently there has been increased interest in logic programming- based default reasoning approaches which are not using negation-as failure in their object language. Instead, default reasoning is modelled by rules and a priority relation among them. Historically the first logic in this class was Defeasible Logic. In this paper we will study its relationship to other approaches which also rely on the idea of using logic rules and priorities. In particular we will study sceptical LPwNF, courteous logic programs, and priority logic.</description><subject>Applied sciences</subject><subject>Artificial intelligence</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Learning and adaptive systems</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540667490</isbn><isbn>3540667490</isbn><isbn>9783540467670</isbn><isbn>354046767X</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>1999</creationdate><recordtype>book_chapter</recordtype><recordid>eNo9UD1PwzAQNZ-igu6MGVgNd77YTiZUVRSQKkACJDbLcZ020MbBDgP_npQibjnpfenpMXaOcIkA-oq4zIHnSivN34yQe2xc6oIG8BeDfTZChciJ8vLgn1NK5yUcshEQCF7qnI7ZqJSFFIiAJ2yc0jsMRyKXgkbsepJNw6azsUmhzUKdPTvf9Y2z6-xhMuOz6H02D8vGZU8xLKPdbJp2mU26LgbrVj6dsaParpMf__1T9jq7eZne8fnj7f10MucdQdnzCr2W3tcSh4oV1gILT84vKguq1tLahVoop0AorVWhsJS1rRzoQlqX24WkU3axy-1sGsrV0bauSaaLzcbGb4OohSQYZJc7WRqYdumjqUL4SAbBbEc1ZIaNzO-AZjvqYKC_3Bg-v3zqjd86nG_7aNduZbvex2QItFCqNISGpKYfkjxzQw</recordid><startdate>1999</startdate><enddate>1999</enddate><creator>Antoniou, G.</creator><creator>Maher, M. J.</creator><creator>Billington, Billington</creator><creator>Governatori, G.</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 Comparison of Sceptical NAF-Free Logic Programming Approaches</title><author>Antoniou, G. ; Maher, M. J. ; Billington, Billington ; Governatori, G.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p309t-b1e75eef51406b1f218e3cedba06f75aad6d6c602677686195fabc0785ac4ad53</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>Learning and adaptive systems</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Antoniou, G.</creatorcontrib><creatorcontrib>Maher, M. J.</creatorcontrib><creatorcontrib>Billington, Billington</creatorcontrib><creatorcontrib>Governatori, G.</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>Antoniou, G.</au><au>Maher, M. J.</au><au>Billington, Billington</au><au>Governatori, G.</au><au>Goos, G</au><au>Hartmanis, J</au><au>van Leeuwen, J</au><au>Pfeifer, Gerald</au><au>Leone, Nicola</au><au>Gelfond, Michael</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>A Comparison of Sceptical NAF-Free Logic Programming Approaches</atitle><btitle>Lecture notes in computer science</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>1999</date><risdate>1999</risdate><spage>347</spage><epage>356</epage><pages>347-356</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540667490</isbn><isbn>3540667490</isbn><eisbn>9783540467670</eisbn><eisbn>354046767X</eisbn><abstract>Recently there has been increased interest in logic programming- based default reasoning approaches which are not using negation-as failure in their object language. Instead, default reasoning is modelled by rules and a priority relation among them. Historically the first logic in this class was Defeasible Logic. In this paper we will study its relationship to other approaches which also rely on the idea of using logic rules and priorities. In particular we will study sceptical LPwNF, courteous logic programs, and priority logic.</abstract><cop>Germany</cop><pub>Springer Berlin / Heidelberg</pub><doi>10.1007/3-540-46767-X_25</doi><oclcid>958521101</oclcid><tpages>10</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0302-9743
ispartof Lecture notes in computer science, 1999, p.347-356
issn 0302-9743
1611-3349
language eng
recordid cdi_pascalfrancis_primary_1172530
source Springer Books
subjects Applied sciences
Artificial intelligence
Computer science
control theory
systems
Exact sciences and technology
Learning and adaptive systems
title A Comparison of Sceptical NAF-Free Logic Programming Approaches
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-15T10%3A58%3A23IST&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%20Comparison%20of%20Sceptical%20NAF-Free%20Logic%20Programming%20Approaches&rft.btitle=Lecture%20notes%20in%20computer%20science&rft.au=Antoniou,%20G.&rft.date=1999&rft.spage=347&rft.epage=356&rft.pages=347-356&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540667490&rft.isbn_list=3540667490&rft_id=info:doi/10.1007/3-540-46767-X_25&rft_dat=%3Cproquest_pasca%3EEBC3072669_31_357%3C/proquest_pasca%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540467670&rft.eisbn_list=354046767X&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=EBC3072669_31_357&rft_id=info:pmid/&rfr_iscdi=true