Super logic programs
The Autoepistemic Logic of Knowledge and Belief (AELB) is a powerful nonmonotonic formalism introduced by Teodor Przymusinski in 1994. In this paper, we specialize it to a class of theories called "super logic programs". We argue that these programs form a natural generalization of standar...
Gespeichert in:
Veröffentlicht in: | ACM transactions on computational logic 2004-01, Vol.5 (1), p.129-176 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 176 |
---|---|
container_issue | 1 |
container_start_page | 129 |
container_title | ACM transactions on computational logic |
container_volume | 5 |
creator | Brass, Stefan Dix, Jürgen Przymusinski, Teodor C. |
description | The Autoepistemic Logic of Knowledge and Belief (AELB) is a powerful nonmonotonic formalism introduced by Teodor Przymusinski in 1994. In this paper, we specialize it to a class of theories called "super logic programs". We argue that these programs form a natural generalization of standard logic programs. In particular, they allow disjunctions and default negation of arbitrary positive objective formulas.Our main results are two new and important characterizations of the static semantics of these programs, one syntactic, and one model-theoretic. The syntactic fixed point characterization is much simpler than the fixed point construction of the static semantics for arbitrary AELB theories. The model-theoretic characterization via Kripke models allows one to construct finite representations of the inherently infinite static expansions.Both characterizations can be used as the basis of algorithms for query answering under the static semantics. We describe a
query-answering interpreter
for super programs that we developed based on the model-theoretic characterization and which is available on the web. |
doi_str_mv | 10.1145/963927.963931 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_29053004</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>28424429</sourcerecordid><originalsourceid>FETCH-LOGICAL-c239t-3141fd87b30e260dbefd9786e593f79396aa49841f984405eccc254b279eecf33</originalsourceid><addsrcrecordid>eNqFkD1PwzAQhi0EEqWwwV4xsKXYd_7IjaiigFSJAZDYLMdxqlRJU-xm4N-TKEwsLPfe8Og93cPYjeBLIaS6J40EZjkGihM2E0qZjKT6PB13oAxNrs7ZRUo7zgUYhBm7fusPIS6ablv7xSF22-jadMnOKtekcPWbc_axfnxfPWeb16eX1cMm84B0zFBIUZW5KZAH0LwsQlWSyXVQhJUhJO2cpHyAhiG5Ct57ULIAQyH4CnHO7qbe4fBXH9LRtnXyoWncPnR9skBcIefyfzCXICXQAN7-AXddH_fDExaM1KA1H6FsgnzsUoqhsodYty5-W8HtaNJOJu1kEn8ApcFikg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>274626609</pqid></control><display><type>article</type><title>Super logic programs</title><source>ACM Digital Library Complete</source><creator>Brass, Stefan ; Dix, Jürgen ; Przymusinski, Teodor C.</creator><creatorcontrib>Brass, Stefan ; Dix, Jürgen ; Przymusinski, Teodor C.</creatorcontrib><description>The Autoepistemic Logic of Knowledge and Belief (AELB) is a powerful nonmonotonic formalism introduced by Teodor Przymusinski in 1994. In this paper, we specialize it to a class of theories called "super logic programs". We argue that these programs form a natural generalization of standard logic programs. In particular, they allow disjunctions and default negation of arbitrary positive objective formulas.Our main results are two new and important characterizations of the static semantics of these programs, one syntactic, and one model-theoretic. The syntactic fixed point characterization is much simpler than the fixed point construction of the static semantics for arbitrary AELB theories. The model-theoretic characterization via Kripke models allows one to construct finite representations of the inherently infinite static expansions.Both characterizations can be used as the basis of algorithms for query answering under the static semantics. We describe a
query-answering interpreter
for super programs that we developed based on the model-theoretic characterization and which is available on the web.</description><identifier>ISSN: 1529-3785</identifier><identifier>EISSN: 1557-945X</identifier><identifier>DOI: 10.1145/963927.963931</identifier><language>eng</language><publisher>New York: Association for Computing Machinery</publisher><subject>Algorithms ; Logic programming ; Semantics ; Studies</subject><ispartof>ACM transactions on computational logic, 2004-01, Vol.5 (1), p.129-176</ispartof><rights>Copyright Association for Computing Machinery Jan 2004</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c239t-3141fd87b30e260dbefd9786e593f79396aa49841f984405eccc254b279eecf33</citedby><cites>FETCH-LOGICAL-c239t-3141fd87b30e260dbefd9786e593f79396aa49841f984405eccc254b279eecf33</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27923,27924</link.rule.ids></links><search><creatorcontrib>Brass, Stefan</creatorcontrib><creatorcontrib>Dix, Jürgen</creatorcontrib><creatorcontrib>Przymusinski, Teodor C.</creatorcontrib><title>Super logic programs</title><title>ACM transactions on computational logic</title><description>The Autoepistemic Logic of Knowledge and Belief (AELB) is a powerful nonmonotonic formalism introduced by Teodor Przymusinski in 1994. In this paper, we specialize it to a class of theories called "super logic programs". We argue that these programs form a natural generalization of standard logic programs. In particular, they allow disjunctions and default negation of arbitrary positive objective formulas.Our main results are two new and important characterizations of the static semantics of these programs, one syntactic, and one model-theoretic. The syntactic fixed point characterization is much simpler than the fixed point construction of the static semantics for arbitrary AELB theories. The model-theoretic characterization via Kripke models allows one to construct finite representations of the inherently infinite static expansions.Both characterizations can be used as the basis of algorithms for query answering under the static semantics. We describe a
query-answering interpreter
for super programs that we developed based on the model-theoretic characterization and which is available on the web.</description><subject>Algorithms</subject><subject>Logic programming</subject><subject>Semantics</subject><subject>Studies</subject><issn>1529-3785</issn><issn>1557-945X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2004</creationdate><recordtype>article</recordtype><recordid>eNqFkD1PwzAQhi0EEqWwwV4xsKXYd_7IjaiigFSJAZDYLMdxqlRJU-xm4N-TKEwsLPfe8Og93cPYjeBLIaS6J40EZjkGihM2E0qZjKT6PB13oAxNrs7ZRUo7zgUYhBm7fusPIS6ablv7xSF22-jadMnOKtekcPWbc_axfnxfPWeb16eX1cMm84B0zFBIUZW5KZAH0LwsQlWSyXVQhJUhJO2cpHyAhiG5Ct57ULIAQyH4CnHO7qbe4fBXH9LRtnXyoWncPnR9skBcIefyfzCXICXQAN7-AXddH_fDExaM1KA1H6FsgnzsUoqhsodYty5-W8HtaNJOJu1kEn8ApcFikg</recordid><startdate>20040101</startdate><enddate>20040101</enddate><creator>Brass, Stefan</creator><creator>Dix, Jürgen</creator><creator>Przymusinski, Teodor C.</creator><general>Association for Computing Machinery</general><scope>AAYXX</scope><scope>CITATION</scope><scope>JQ2</scope><scope>7SC</scope><scope>8FD</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20040101</creationdate><title>Super logic programs</title><author>Brass, Stefan ; Dix, Jürgen ; Przymusinski, Teodor C.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c239t-3141fd87b30e260dbefd9786e593f79396aa49841f984405eccc254b279eecf33</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Algorithms</topic><topic>Logic programming</topic><topic>Semantics</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Brass, Stefan</creatorcontrib><creatorcontrib>Dix, Jürgen</creatorcontrib><creatorcontrib>Przymusinski, Teodor C.</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>ACM transactions on computational logic</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Brass, Stefan</au><au>Dix, Jürgen</au><au>Przymusinski, Teodor C.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Super logic programs</atitle><jtitle>ACM transactions on computational logic</jtitle><date>2004-01-01</date><risdate>2004</risdate><volume>5</volume><issue>1</issue><spage>129</spage><epage>176</epage><pages>129-176</pages><issn>1529-3785</issn><eissn>1557-945X</eissn><abstract>The Autoepistemic Logic of Knowledge and Belief (AELB) is a powerful nonmonotonic formalism introduced by Teodor Przymusinski in 1994. In this paper, we specialize it to a class of theories called "super logic programs". We argue that these programs form a natural generalization of standard logic programs. In particular, they allow disjunctions and default negation of arbitrary positive objective formulas.Our main results are two new and important characterizations of the static semantics of these programs, one syntactic, and one model-theoretic. The syntactic fixed point characterization is much simpler than the fixed point construction of the static semantics for arbitrary AELB theories. The model-theoretic characterization via Kripke models allows one to construct finite representations of the inherently infinite static expansions.Both characterizations can be used as the basis of algorithms for query answering under the static semantics. We describe a
query-answering interpreter
for super programs that we developed based on the model-theoretic characterization and which is available on the web.</abstract><cop>New York</cop><pub>Association for Computing Machinery</pub><doi>10.1145/963927.963931</doi><tpages>48</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1529-3785 |
ispartof | ACM transactions on computational logic, 2004-01, Vol.5 (1), p.129-176 |
issn | 1529-3785 1557-945X |
language | eng |
recordid | cdi_proquest_miscellaneous_29053004 |
source | ACM Digital Library Complete |
subjects | Algorithms Logic programming Semantics Studies |
title | Super logic programs |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-13T10%3A11%3A29IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Super%20logic%20programs&rft.jtitle=ACM%20transactions%20on%20computational%20logic&rft.au=Brass,%20Stefan&rft.date=2004-01-01&rft.volume=5&rft.issue=1&rft.spage=129&rft.epage=176&rft.pages=129-176&rft.issn=1529-3785&rft.eissn=1557-945X&rft_id=info:doi/10.1145/963927.963931&rft_dat=%3Cproquest_cross%3E28424429%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=274626609&rft_id=info:pmid/&rfr_iscdi=true |