Computing Strong and Weak Permissions in Defeasible Logic
Identifieur interne :
000052 ( PascalFrancis/Corpus );
précédent :
000051;
suivant :
000053
Computing Strong and Weak Permissions in Defeasible Logic
Auteurs : Guido Governatori ;
Francesco Olivieri ;
Antonino Rotolo ;
Simone ScannapiecoSource :
-
Journal of philosophical logic [ 0022-3611 ] ; 2013.
RBID : Francis:14-0003337
Descripteurs français
English descriptors
Abstract
In this paper we propose an extension of Defeasible Logic to represent and compute different concepts of defeasible permission. In particular, we discuss some types of explicit permissive norms that work as exceptions to opposite obligations or encode permissive rights. Moreover, we show how strong permissions can be represented both with, and without introducing a new consequence relation for inferring conclusions from explicit permissive norms. Finally, we illustrate how a preference operator applicable to contrary-to-duty obligations can be combined with a new operator representing ordered sequences of strong permissions. The logical system is studied from a computational standpoint and is shown to have linear computational complexity.
Notice en format standard (ISO 2709)
Pour connaître la documentation sur le format Inist Standard.
| pA |
| A01 | 01 | 1 | | @0 0022-3611 |
|---|
| A03 | | 1 | | @0 J. philos. logic |
|---|
| A05 | | | | @2 42 |
|---|
| A06 | | | | @2 6 |
|---|
| A08 | 01 | 1 | ENG | @1 Computing Strong and Weak Permissions in Defeasible Logic |
|---|
| A09 | 01 | 1 | ENG | @1 Conference on Logic and the foundations of Game and Decision Theory (LOFT10), Sevilla |
|---|
| A11 | 01 | 1 | | @1 GOVERNATORI (Guido) |
|---|
| A11 | 02 | 1 | | @1 OLIVIERI (Francesco) |
|---|
| A11 | 03 | 1 | | @1 ROTOLO (Antonino) |
|---|
| A11 | 04 | 1 | | @1 SCANNAPIECO (Simone) |
|---|
| A12 | 01 | 1 | | @1 BONANNO (Giacomo) @9 ed. |
|---|
| A12 | 02 | 1 | | @1 VAN DITMARSCH (Hans) @9 ed. |
|---|
| A12 | 03 | 1 | | @1 VAN DER HOEK (Wiebe) @9 ed. |
|---|
| A14 | 01 | | | @1 NICTA, Queensland Research Laboratory @2 Brisbane @3 AUS @Z 1 aut. @Z 2 aut. @Z 4 aut. |
|---|
| A14 | 02 | | | @1 Department of Computer Science, University of Verona @2 Verona @3 ITA @Z 2 aut. @Z 4 aut. |
|---|
| A14 | 03 | | | @1 Institute for Integrated and Intelligent Systems, Griffith University @2 Nathan, Queensland @3 AUS @Z 2 aut. @Z 4 aut. |
|---|
| A14 | 04 | | | @1 CIRSFID, University of Bologna @2 Bologna @3 ITA @Z 3 aut. |
|---|
| A15 | 01 | | | @1 Department of Economics, University of California, @2 Davis @3 USA @Z 1 aut. |
|---|
| A15 | 02 | | | @1 LORIA, CNRS ? Université de Lorraine @2 Nancy @3 FRA @Z 2 aut. |
|---|
| A15 | 03 | | | @1 Department of Computer Science, University of Liverpool @2 Liverpool @3 GBR @Z 3 aut. |
|---|
| A20 | | | | @1 799-829 |
|---|
| A21 | | | | @1 2013 |
|---|
| A23 | 01 | | | @0 ENG |
|---|
| A43 | 01 | | | @1 INIST @2 25573 @5 354000507415120010 |
|---|
| A44 | | | | @0 0000 @1 © 2014 INIST-CNRS. All rights reserved. |
|---|
| A45 | | | | @0 28 ref. |
|---|
| A47 | 01 | 1 | | @0 14-0003337 |
|---|
| A60 | | | | @1 P @2 C |
|---|
| A61 | | | | @0 A |
|---|
| A64 | 01 | 1 | | @0 Journal of philosophical logic |
|---|
| A66 | 01 | | | @0 NLD |
|---|
| C01 | 01 | | ENG | @0 In this paper we propose an extension of Defeasible Logic to represent and compute different concepts of defeasible permission. In particular, we discuss some types of explicit permissive norms that work as exceptions to opposite obligations or encode permissive rights. Moreover, we show how strong permissions can be represented both with, and without introducing a new consequence relation for inferring conclusions from explicit permissive norms. Finally, we illustrate how a preference operator applicable to contrary-to-duty obligations can be combined with a new operator representing ordered sequences of strong permissions. The logical system is studied from a computational standpoint and is shown to have linear computational complexity. |
|---|
| C02 | 01 | P | | @0 51910 @1 X |
|---|
| C02 | 02 | P | | @0 519 |
|---|
| C03 | 01 | P | FRE | @0 Logique philosophique @5 01 |
|---|
| C03 | 01 | P | ENG | @0 Philosophical Logic @5 01 |
|---|
| N21 | | | | @1 006 |
|---|
| N44 | 01 | | | @1 OTO |
|---|
| N82 | | | | @1 OTO |
|---|
|
|---|
| pR |
| A30 | 01 | 1 | ENG | @1 LOFT10 Conference on Logic and the foundations of Game and Decision Theory @2 10 @3 Sevilla ESP @4 2012-07-18 |
|---|
|
|---|
Format Inist (serveur)
| NO : | FRANCIS 14-0003337 INIST |
|---|
| ET : | Computing Strong and Weak Permissions in Defeasible Logic |
|---|
| AU : | GOVERNATORI (Guido); OLIVIERI (Francesco); ROTOLO (Antonino); SCANNAPIECO (Simone); BONANNO (Giacomo); VAN DITMARSCH (Hans); VAN DER HOEK (Wiebe) |
|---|
| AF : | NICTA, Queensland Research Laboratory/Brisbane/Australie (1 aut., 2 aut., 4 aut.); Department of Computer Science, University of Verona/Verona/Italie (2 aut., 4 aut.); Institute for Integrated and Intelligent Systems, Griffith University/Nathan, Queensland/Australie (2 aut., 4 aut.); CIRSFID, University of Bologna/Bologna/Italie (3 aut.); Department of Economics, University of California,/Davis/Etats-Unis (1 aut.); LORIA, CNRS ? Université de Lorraine/Nancy/France (2 aut.); Department of Computer Science, University of Liverpool/Liverpool/Royaume-Uni (3 aut.) |
|---|
| DT : | Publication en série; Congrès; Niveau analytique |
|---|
| SO : | Journal of philosophical logic; ISSN 0022-3611; Pays-Bas; Da. 2013; Vol. 42; No. 6; Pp. 799-829; Bibl. 28 ref. |
|---|
| LA : | Anglais |
|---|
| EA : | In this paper we propose an extension of Defeasible Logic to represent and compute different concepts of defeasible permission. In particular, we discuss some types of explicit permissive norms that work as exceptions to opposite obligations or encode permissive rights. Moreover, we show how strong permissions can be represented both with, and without introducing a new consequence relation for inferring conclusions from explicit permissive norms. Finally, we illustrate how a preference operator applicable to contrary-to-duty obligations can be combined with a new operator representing ordered sequences of strong permissions. The logical system is studied from a computational standpoint and is shown to have linear computational complexity. |
|---|
| CC : | 51910; 519 |
|---|
| FD : | Logique philosophique |
|---|
| ED : | Philosophical Logic |
|---|
| LO : | INIST-25573.354000507415120010 |
|---|
| ID : | 14-0003337 |
|---|
Links to Exploration step
Francis:14-0003337
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Computing Strong and Weak Permissions in Defeasible Logic</title>
<author><name sortKey="Governatori, Guido" sort="Governatori, Guido" uniqKey="Governatori G" first="Guido" last="Governatori">Guido Governatori</name>
<affiliation><inist:fA14 i1="01"><s1>NICTA, Queensland Research Laboratory</s1>
<s2>Brisbane</s2>
<s3>AUS</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><author><name sortKey="Olivieri, Francesco" sort="Olivieri, Francesco" uniqKey="Olivieri F" first="Francesco" last="Olivieri">Francesco Olivieri</name>
<affiliation><inist:fA14 i1="01"><s1>NICTA, Queensland Research Laboratory</s1>
<s2>Brisbane</s2>
<s3>AUS</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><affiliation><inist:fA14 i1="02"><s1>Department of Computer Science, University of Verona</s1>
<s2>Verona</s2>
<s3>ITA</s3>
<sZ>2 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><affiliation><inist:fA14 i1="03"><s1>Institute for Integrated and Intelligent Systems, Griffith University</s1>
<s2>Nathan, Queensland</s2>
<s3>AUS</s3>
<sZ>2 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><author><name sortKey="Rotolo, Antonino" sort="Rotolo, Antonino" uniqKey="Rotolo A" first="Antonino" last="Rotolo">Antonino Rotolo</name>
<affiliation><inist:fA14 i1="04"><s1>CIRSFID, University of Bologna</s1>
<s2>Bologna</s2>
<s3>ITA</s3>
<sZ>3 aut.</sZ>
</inist:fA14><author><name sortKey="Scannapieco, Simone" sort="Scannapieco, Simone" uniqKey="Scannapieco S" first="Simone" last="Scannapieco">Simone Scannapieco</name>
<affiliation><inist:fA14 i1="01"><s1>NICTA, Queensland Research Laboratory</s1>
<s2>Brisbane</s2>
<s3>AUS</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><affiliation><inist:fA14 i1="02"><s1>Department of Computer Science, University of Verona</s1>
<s2>Verona</s2>
<s3>ITA</s3>
<sZ>2 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><affiliation><inist:fA14 i1="03"><s1>Institute for Integrated and Intelligent Systems, Griffith University</s1>
<s2>Nathan, Queensland</s2>
<s3>AUS</s3>
<sZ>2 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">14-0003337</idno>
<date when="2013">2013</date>
<idno type="stanalyst">FRANCIS 14-0003337 INIST</idno>
<idno type="RBID">Francis:14-0003337</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000052</idno>
</publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Computing Strong and Weak Permissions in Defeasible Logic</title>
<author><name sortKey="Governatori, Guido" sort="Governatori, Guido" uniqKey="Governatori G" first="Guido" last="Governatori">Guido Governatori</name>
<affiliation><inist:fA14 i1="01"><s1>NICTA, Queensland Research Laboratory</s1>
<s2>Brisbane</s2>
<s3>AUS</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><author><name sortKey="Olivieri, Francesco" sort="Olivieri, Francesco" uniqKey="Olivieri F" first="Francesco" last="Olivieri">Francesco Olivieri</name>
<affiliation><inist:fA14 i1="01"><s1>NICTA, Queensland Research Laboratory</s1>
<s2>Brisbane</s2>
<s3>AUS</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><affiliation><inist:fA14 i1="02"><s1>Department of Computer Science, University of Verona</s1>
<s2>Verona</s2>
<s3>ITA</s3>
<sZ>2 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><affiliation><inist:fA14 i1="03"><s1>Institute for Integrated and Intelligent Systems, Griffith University</s1>
<s2>Nathan, Queensland</s2>
<s3>AUS</s3>
<sZ>2 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><author><name sortKey="Rotolo, Antonino" sort="Rotolo, Antonino" uniqKey="Rotolo A" first="Antonino" last="Rotolo">Antonino Rotolo</name>
<affiliation><inist:fA14 i1="04"><s1>CIRSFID, University of Bologna</s1>
<s2>Bologna</s2>
<s3>ITA</s3>
<sZ>3 aut.</sZ>
</inist:fA14><author><name sortKey="Scannapieco, Simone" sort="Scannapieco, Simone" uniqKey="Scannapieco S" first="Simone" last="Scannapieco">Simone Scannapieco</name>
<affiliation><inist:fA14 i1="01"><s1>NICTA, Queensland Research Laboratory</s1>
<s2>Brisbane</s2>
<s3>AUS</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><affiliation><inist:fA14 i1="02"><s1>Department of Computer Science, University of Verona</s1>
<s2>Verona</s2>
<s3>ITA</s3>
<sZ>2 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><affiliation><inist:fA14 i1="03"><s1>Institute for Integrated and Intelligent Systems, Griffith University</s1>
<s2>Nathan, Queensland</s2>
<s3>AUS</s3>
<sZ>2 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><series><title level="j" type="main">Journal of philosophical logic</title>
<title level="j" type="abbreviated">J. philos. logic</title>
<idno type="ISSN">0022-3611</idno>
<imprint><date when="2013">2013</date>
</imprint><seriesStmt><title level="j" type="main">Journal of philosophical logic</title>
<title level="j" type="abbreviated">J. philos. logic</title>
<idno type="ISSN">0022-3611</idno>
</seriesStmt><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Philosophical Logic</term>
</keywords><keywords scheme="Pascal" xml:lang="fr"><term>Logique philosophique</term>
</keywords><front><div type="abstract" xml:lang="en">In this paper we propose an extension of Defeasible Logic to represent and compute different concepts of defeasible permission. In particular, we discuss some types of explicit permissive norms that work as exceptions to opposite obligations or encode permissive rights. Moreover, we show how strong permissions can be represented both with, and without introducing a new consequence relation for inferring conclusions from explicit permissive norms. Finally, we illustrate how a preference operator applicable to contrary-to-duty obligations can be combined with a new operator representing ordered sequences of strong permissions. The logical system is studied from a computational standpoint and is shown to have linear computational complexity.</div>
</front><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0022-3611</s0>
</fA01><fA03 i2="1"><s0>J. philos. logic</s0>
</fA03><fA08 i1="01" i2="1" l="ENG"><s1>Computing Strong and Weak Permissions in Defeasible Logic</s1>
</fA08><fA09 i1="01" i2="1" l="ENG"><s1>Conference on Logic and the foundations of Game and Decision Theory (LOFT10), Sevilla</s1>
</fA09><fA11 i1="01" i2="1"><s1>GOVERNATORI (Guido)</s1>
</fA11><fA11 i1="02" i2="1"><s1>OLIVIERI (Francesco)</s1>
</fA11><fA11 i1="03" i2="1"><s1>ROTOLO (Antonino)</s1>
</fA11><fA11 i1="04" i2="1"><s1>SCANNAPIECO (Simone)</s1>
</fA11><fA12 i1="01" i2="1"><s1>BONANNO (Giacomo)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="02" i2="1"><s1>VAN DITMARSCH (Hans)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="03" i2="1"><s1>VAN DER HOEK (Wiebe)</s1>
<s9>ed.</s9>
</fA12><fA14 i1="01"><s1>NICTA, Queensland Research Laboratory</s1>
<s2>Brisbane</s2>
<s3>AUS</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>4 aut.</sZ>
</fA14><fA14 i1="02"><s1>Department of Computer Science, University of Verona</s1>
<s2>Verona</s2>
<s3>ITA</s3>
<sZ>2 aut.</sZ>
<sZ>4 aut.</sZ>
</fA14><fA14 i1="03"><s1>Institute for Integrated and Intelligent Systems, Griffith University</s1>
<s2>Nathan, Queensland</s2>
<s3>AUS</s3>
<sZ>2 aut.</sZ>
<sZ>4 aut.</sZ>
</fA14><fA14 i1="04"><s1>CIRSFID, University of Bologna</s1>
<s2>Bologna</s2>
<s3>ITA</s3>
<sZ>3 aut.</sZ>
</fA14><fA15 i1="01"><s1>Department of Economics, University of California,</s1>
<s2>Davis</s2>
<s3>USA</s3>
<sZ>1 aut.</sZ>
</fA15><fA15 i1="02"><s1>LORIA, CNRS ? Université de Lorraine</s1>
<s2>Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</fA15><fA15 i1="03"><s1>Department of Computer Science, University of Liverpool</s1>
<s2>Liverpool</s2>
<s3>GBR</s3>
<sZ>3 aut.</sZ>
</fA15><fA20><s1>799-829</s1>
</fA20><fA21><s1>2013</s1>
</fA21><fA23 i1="01"><s0>ENG</s0>
</fA23><fA43 i1="01"><s1>INIST</s1>
<s2>25573</s2>
<s5>354000507415120010</s5>
</fA43><fA44><s0>0000</s0>
<s1>© 2014 INIST-CNRS. All rights reserved.</s1>
</fA44><fA45><s0>28 ref.</s0>
</fA45><fA47 i1="01" i2="1"><s0>14-0003337</s0>
</fA47><fA60><s1>P</s1>
<s2>C</s2>
</fA60><fA64 i1="01" i2="1"><s0>Journal of philosophical logic</s0>
</fA64><fA66 i1="01"><s0>NLD</s0>
</fA66><fC01 i1="01" l="ENG"><s0>In this paper we propose an extension of Defeasible Logic to represent and compute different concepts of defeasible permission. In particular, we discuss some types of explicit permissive norms that work as exceptions to opposite obligations or encode permissive rights. Moreover, we show how strong permissions can be represented both with, and without introducing a new consequence relation for inferring conclusions from explicit permissive norms. Finally, we illustrate how a preference operator applicable to contrary-to-duty obligations can be combined with a new operator representing ordered sequences of strong permissions. The logical system is studied from a computational standpoint and is shown to have linear computational complexity.</s0>
</fC01><fC02 i1="01" i2="P"><s0>51910</s0>
<s1>X</s1>
</fC02><fC02 i1="02" i2="P"><s0>519</s0>
</fC02><fC03 i1="01" i2="P" l="FRE"><s0>Logique philosophique</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="P" l="ENG"><s0>Philosophical Logic</s0>
<s5>01</s5>
</fC03><fN21><s1>006</s1>
</fN21><fN44 i1="01"><s1>OTO</s1>
</fN44><fN82><s1>OTO</s1>
</fN82><pR><fA30 i1="01" i2="1" l="ENG"><s1>LOFT10 Conference on Logic and the foundations of Game and Decision Theory</s1>
<s2>10</s2>
<s3>Sevilla ESP</s3>
<s4>2012-07-18</s4>
</fA30><server><NO>FRANCIS 14-0003337 INIST</NO>
<ET>Computing Strong and Weak Permissions in Defeasible Logic</ET>
<AU>GOVERNATORI (Guido); OLIVIERI (Francesco); ROTOLO (Antonino); SCANNAPIECO (Simone); BONANNO (Giacomo); VAN DITMARSCH (Hans); VAN DER HOEK (Wiebe)</AU>
<AF>NICTA, Queensland Research Laboratory/Brisbane/Australie (1 aut., 2 aut., 4 aut.); Department of Computer Science, University of Verona/Verona/Italie (2 aut., 4 aut.); Institute for Integrated and Intelligent Systems, Griffith University/Nathan, Queensland/Australie (2 aut., 4 aut.); CIRSFID, University of Bologna/Bologna/Italie (3 aut.); Department of Economics, University of California,/Davis/Etats-Unis (1 aut.); LORIA, CNRS ? Université de Lorraine/Nancy/France (2 aut.); Department of Computer Science, University of Liverpool/Liverpool/Royaume-Uni (3 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Journal of philosophical logic; ISSN 0022-3611; Pays-Bas; Da. 2013; Vol. 42; No. 6; Pp. 799-829; Bibl. 28 ref.</SO>
<LA>Anglais</LA>
<EA>In this paper we propose an extension of Defeasible Logic to represent and compute different concepts of defeasible permission. In particular, we discuss some types of explicit permissive norms that work as exceptions to opposite obligations or encode permissive rights. Moreover, we show how strong permissions can be represented both with, and without introducing a new consequence relation for inferring conclusions from explicit permissive norms. Finally, we illustrate how a preference operator applicable to contrary-to-duty obligations can be combined with a new operator representing ordered sequences of strong permissions. The logical system is studied from a computational standpoint and is shown to have linear computational complexity.</EA>
<CC>51910; 519</CC>
<FD>Logique philosophique</FD>
<ED>Philosophical Logic</ED>
<LO>INIST-25573.354000507415120010</LO>
<ID>14-0003337</ID>
</server>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000052 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000052 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= PascalFrancis
|étape= Corpus
|type= RBID
|clé= Francis:14-0003337
|texte= Computing Strong and Weak Permissions in Defeasible Logic
}}
| This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022 |  |
