Embedding Default Logic in Propositional Argumentation Systems

In this paper we present a transformation of finite propositional default theories into so-called propositional argumentation systems. This transformation allows to characterize all notions of Reiter's default logic in the framework of argumentation systems. As a consequence, computing extensio...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2002-07
Hauptverfasser: Berzati, Dritan, Anrig, Bernhard, Kohlas, Juerg
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Berzati, Dritan
Anrig, Bernhard
Kohlas, Juerg
description In this paper we present a transformation of finite propositional default theories into so-called propositional argumentation systems. This transformation allows to characterize all notions of Reiter's default logic in the framework of argumentation systems. As a consequence, computing extensions, or determining wether a given formula belongs to one extension or all extensions can be answered without leaving the field of classical propositional logic. The transformation proposed is linear in the number of defaults.
format Article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2091246569</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2091246569</sourcerecordid><originalsourceid>FETCH-proquest_journals_20912465693</originalsourceid><addsrcrecordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mSwc81NSk1JycxLV3BJTUsszSlR8MlPz0xWyMxTCCjKL8gvzizJzM9LzFFwLEovzU3NK0kE8RWCK4tLUnOLeRhY0xJzilN5oTQ3g7Kba4izh25BUX5haWpxSXxWfmkRUHtxvJGBpaGRiZmpmaUxcaoA1DI4rQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2091246569</pqid></control><display><type>article</type><title>Embedding Default Logic in Propositional Argumentation Systems</title><source>Free E- Journals</source><creator>Berzati, Dritan ; Anrig, Bernhard ; Kohlas, Juerg</creator><creatorcontrib>Berzati, Dritan ; Anrig, Bernhard ; Kohlas, Juerg</creatorcontrib><description>In this paper we present a transformation of finite propositional default theories into so-called propositional argumentation systems. This transformation allows to characterize all notions of Reiter's default logic in the framework of argumentation systems. As a consequence, computing extensions, or determining wether a given formula belongs to one extension or all extensions can be answered without leaving the field of classical propositional logic. The transformation proposed is linear in the number of defaults.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Embedded systems ; Logic ; Transformations</subject><ispartof>arXiv.org, 2002-07</ispartof><rights>2002. This work is published under https://arxiv.org/licenses/assumed-1991-2003/license.html (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>776,780</link.rule.ids></links><search><creatorcontrib>Berzati, Dritan</creatorcontrib><creatorcontrib>Anrig, Bernhard</creatorcontrib><creatorcontrib>Kohlas, Juerg</creatorcontrib><title>Embedding Default Logic in Propositional Argumentation Systems</title><title>arXiv.org</title><description>In this paper we present a transformation of finite propositional default theories into so-called propositional argumentation systems. This transformation allows to characterize all notions of Reiter's default logic in the framework of argumentation systems. As a consequence, computing extensions, or determining wether a given formula belongs to one extension or all extensions can be answered without leaving the field of classical propositional logic. The transformation proposed is linear in the number of defaults.</description><subject>Embedded systems</subject><subject>Logic</subject><subject>Transformations</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2002</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mSwc81NSk1JycxLV3BJTUsszSlR8MlPz0xWyMxTCCjKL8gvzizJzM9LzFFwLEovzU3NK0kE8RWCK4tLUnOLeRhY0xJzilN5oTQ3g7Kba4izh25BUX5haWpxSXxWfmkRUHtxvJGBpaGRiZmpmaUxcaoA1DI4rQ</recordid><startdate>20020716</startdate><enddate>20020716</enddate><creator>Berzati, Dritan</creator><creator>Anrig, Bernhard</creator><creator>Kohlas, Juerg</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20020716</creationdate><title>Embedding Default Logic in Propositional Argumentation Systems</title><author>Berzati, Dritan ; Anrig, Bernhard ; Kohlas, Juerg</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_20912465693</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2002</creationdate><topic>Embedded systems</topic><topic>Logic</topic><topic>Transformations</topic><toplevel>online_resources</toplevel><creatorcontrib>Berzati, Dritan</creatorcontrib><creatorcontrib>Anrig, Bernhard</creatorcontrib><creatorcontrib>Kohlas, Juerg</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Berzati, Dritan</au><au>Anrig, Bernhard</au><au>Kohlas, Juerg</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Embedding Default Logic in Propositional Argumentation Systems</atitle><jtitle>arXiv.org</jtitle><date>2002-07-16</date><risdate>2002</risdate><eissn>2331-8422</eissn><abstract>In this paper we present a transformation of finite propositional default theories into so-called propositional argumentation systems. This transformation allows to characterize all notions of Reiter's default logic in the framework of argumentation systems. As a consequence, computing extensions, or determining wether a given formula belongs to one extension or all extensions can be answered without leaving the field of classical propositional logic. The transformation proposed is linear in the number of defaults.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2002-07
issn 2331-8422
language eng
recordid cdi_proquest_journals_2091246569
source Free E- Journals
subjects Embedded systems
Logic
Transformations
title Embedding Default Logic in Propositional Argumentation Systems
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-06T13%3A17%3A10IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Embedding%20Default%20Logic%20in%20Propositional%20Argumentation%20Systems&rft.jtitle=arXiv.org&rft.au=Berzati,%20Dritan&rft.date=2002-07-16&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2091246569%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2091246569&rft_id=info:pmid/&rfr_iscdi=true