ࡱ> 796)bjbjUU >0??! 40(99999"[o dH{99{{99{{{{99{{{{{9@;{{04{N{N{N{H{{{{{{{{{{{{4{{{{N{{{{{{{{{ :TTULO VERIFICAO DE CONFLITOS ENTRE MLTIPLAS NORMAS EM SISTEMAS MULTIAGENTES Resumo Em sistemas multiagentes abertos, normas so utilizadas para regular o comportamento dos agentes autnomos, heterogneos e concebidos de forma independente. Normas descrevem o comportamento que pode ser executado, deve ser executado e no pode ser executado no sistema. Um dos principais desafios no desenvolvimento de sistemas normativos que as normas podem entrar em conflito umas com as outras. Normas esto em conflito quando o cumprimento de uma norma viola a outra e vice-versa. Em trabalhos anteriores, os Conflict Checkers consideravam que conflitos podem ser detectados simplesmente analisando as normas em pares. Entretanto, existem conflitos que s podem ser detectados apenas quando vrias normas so analisadas em conjunto. Este trabalho apresenta um Conflict Checker, programa que detecta conflitos, capaz de verificar conflitos entre duas ou mais normas ao mesmo tempo. A estratgia do Conflict Checker dividida em trs passos: (1) aplicao de filtros para suavizar o custo computacional na maioria dos casos, pois, o problema intrinsicamente exponencial ADDIN CSL_CITATION { "citationItems" : [ { "id" : "ITEM-1", "itemData" : { "DOI" : "http://dx.doi.org/10.1016/0004-3702(94)00007-N", "ISSN" : "0004-3702", "abstract" : "We are concerned with the utility of social laws in a computational environment, laws which guarantee the successful coexistence of multiple programs and programmers. In this paper we are interested in the off-line design of social laws, where we as designers must decide ahead of time on useful social laws. In the first part of this paper we suggest the use of social laws in the domain of mobile robots, and prove analytic results about the usefulness of this approach in that setting. In the second part of this paper we present a general model of social law in a computational system, and investigate some of its properties. This includes a definition of the basic computational problem involved with the design of multi-agent systems, and an investigation of the automatic synthesis of useful social laws in the framework of a model which refers explicitly to social laws. ", "author" : [ { "dropping-particle" : "", "family" : "Shoham", "given" : "Yoav", "non-dropping-particle" : "", "parse-names" : false, "suffix" : "" }, { "dropping-particle" : "", "family" : "Tennenholtz", "given" : "Moshe", "non-dropping-particle" : "", "parse-names" : false, "suffix" : "" } ], "container-title" : "Artificial Intelligence", "id" : "ITEM-1", "issue" : "1\u20132", "issued" : { "date-parts" : [ [ "1995" ] ] }, "note" : "Computational Research on Interaction and Agency, Part 2", "page" : "231-252", "title" : "On social laws for artificial agent societies: off-line design", "type" : "article-journal", "volume" : "73" }, "uris" : [ "http://www.mendeley.com/documents/?uuid=d3a6c620-92be-4da9-b6dc-0d83f1dd2aea" ] } ], "mendeley" : { "formattedCitation" : "(SHOHAM; TENNENHOLTZ, 1995)", "plainTextFormattedCitation" : "(SHOHAM; TENNENHOLTZ, 1995)", "previouslyFormattedCitation" : "(SHOHAM; TENNENHOLTZ, 1995)" }, "properties" : { "noteIndex" : 0 }, "schema" : "https://github.com/citation-style-language/schema/raw/master/csl-citation.json" }(SHOHAM; TENNENHOLTZ, 1995), (2) transformao dentica utilizada para anlise de vrias normas ao mesmo tempo e (3) interseo entre as normas para verificao dos conflitos. Uma nova linguagem normativa mais expressiva, representada por uma gramtica BNF, foi desenvolvida para definio de normas e um Conflict Checker foi implementado em formato de ferramenta. Dois princpios de validao foram aplicados: teste de software e verificao formal. O teste de software props inmeros casos de teste para testar a capacidade de capturar conflitos e os benefcios da utilizao dos filtros para suavizar a complexidade do problema. A verificao formal utilizou a tcnica de DBC (Design-by-Contract - Design por Contrato) implementada pela JML (Java Modeling Language) na plataforma KeY para provar a corretude dos mtodos. A aplicao das tcnicas de validao confirmou que o Conflict Checker foi capaz de detectar conflitos no encontrados em outras abordagens. A estratgia desenvolvida nesta tese surge como uma nova sintaxe para definio e verificao de conflitos em sistemas multiagentes. Palavras-chave: sistemas multiagentes, sistemas multiagentes normativos, conflitos normativos, norma Abstract In open multi-agent systems, norms are being used to regulate the behavior of the autonomous, heterogeneous and independently designed agents. Norms describe the behavior that can be performed, must be performed, and cannot be performed in the system. One of the main challenges on developing normative systems is that norms may conflict with each other. Norms are in conflict when the fulfillment of one norm violates the other and vice-versa. In previous works, the Conflict Checkers consider that conflicts can be detected by simply analyzing pairs of norms. However, there may be conflicts that can only be detected when we analyze several norms together. This work presents a Conflict Checker, program that detect conflicts, able to detect conflicts between two or more norms at the same time. The Conflict Checker strategy is divided into three steps: (1) applying filters to smooth the computational cost in most cases, since the problem is intrinsically exponential ADDIN CSL_CITATION { "citationItems" : [ { "id" : "ITEM-1", "itemData" : { "DOI" : "http://dx.doi.org/10.1016/0004-3702(94)00007-N", "ISSN" : "0004-3702", "abstract" : "We are concerned with the utility of social laws in a computational environment, laws which guarantee the successful coexistence of multiple programs and programmers. In this paper we are interested in the off-line design of social laws, where we as designers must decide ahead of time on useful social laws. In the first part of this paper we suggest the use of social laws in the domain of mobile robots, and prove analytic results about the usefulness of this approach in that setting. In the second part of this paper we present a general model of social law in a computational system, and investigate some of its properties. This includes a definition of the basic computational problem involved with the design of multi-agent systems, and an investigation of the automatic synthesis of useful social laws in the framework of a model which refers explicitly to social laws. ", "author" : [ { "dropping-particle" : "", "family" : "Shoham", "given" : "Yoav", "non-dropping-particle" : "", "parse-names" : false, "suffix" : "" }, { "dropping-particle" : "", "family" : "Tennenholtz", "given" : "Moshe", "non-dropping-particle" : "", "parse-names" : false, "suffix" : "" } ], "container-title" : "Artificial Intelligence", "id" : "ITEM-1", "issue" : "1\u20132", "issued" : { "date-parts" : [ [ "1995" ] ] }, "note" : "Computational Research on Interaction and Agency, Part 2", "page" : "231-252", "title" : "On social laws for artificial agent societies: off-line design", "type" : "article-journal", "volume" : "73" }, "uris" : [ "http://www.mendeley.com/documents/?uuid=d3a6c620-92be-4da9-b6dc-0d83f1dd2aea" ] } ], "mendeley" : { "formattedCitation" : "(SHOHAM; TENNENHOLTZ, 1995)", "plainTextFormattedCitation" : "(SHOHAM; TENNENHOLTZ, 1995)", "previouslyFormattedCitation" : "(SHOHAM; TENNENHOLTZ, 1995)" }, "properties" : { "noteIndex" : 0 }, "schema" : "https://github.com/citation-style-language/schema/raw/master/csl-citation.json" }(SHOHAM; TENNENHOLTZ, 1995), (2) deontic transformation is used to analyze various norms at the same time and (3) intersection among the norms for verification of conflicts. A new normative language more expressive, represented by a BNF grammar, was developed to define norms and a Conflict Checker was implemented in tool format. Two validation principles were applied: software testing and formal verification. Software testing proposed numerous test cases to test the ability to capture conflicts and the benefits of using filters to soften the complexity of the problem. The formal verification used the DBC (Design-by-Contract) technique implemented by JML (Java Modeling Language) in KeY platform to prove the correctness of the methods. The application of the validation techniques confirmed that Conflict Checker was able to detect conflicts not found in other approaches. The strategy developed in this thesis emerges as a new syntax for definition and verification of conflicts in multi-agent systems. Keywords: multi-agent systems, normative multi-agent system, normative conflict, norm. OPRY\ m W g {AQk|@Ppe˽˽˽˽ˮˮ˽˽˽˽ːzpzplzpzhhh6] hhhh5;CJ\aJh\Nh5\^JmHsHh\NhmHnHsHujh\NhUmHsHh\Nh6]mHsHh\NhmHsH%h\Nh5;CJ\aJmHsHh^JmHsH h^J h\Nh'PY))))gd\Nhgd\Nef%%%%&&&&''(((())))h\Nh^Jh|h6] h|hhh6] hhhhmHnHuhjhU<P1h:pb/ =!n"n#n$n% Dpj 666666666vvvvvvvvv666666>6666666666666666666666666666666666666666666666666hH6666666666666666666666666666666666666666666666666666666666666666662 0@P`p2( 0@P`p 0@P`p 0@P`p 0@P`p 0@P`p 0@P`p8XV~ OJPJQJ_HmHnHsHtHR`R Normal d CJPJ^J_HaJmH sH tH DA D 0Default Paragraph FontRiR 0 Table Normal4 l4a (k ( 0No List PK![Content_Types].xmlj0Eжr(΢Iw},-j4 wP-t#bΙ{UTU^hd}㨫)*1P' ^W0)T9<l#$yi};~@(Hu* Dנz/0ǰ $ X3aZ,D0j~3߶b~i>3\`?/[G\!-Rk.sԻ..a濭?PK!֧6 _rels/.relsj0 }Q%v/C/}(h"O = C?hv=Ʌ%[xp{۵_Pѣ<1H0ORBdJE4b$q_6LR7`0̞O,En7Lib/SeеPK!kytheme/theme/themeManager.xml M @}w7c(EbˮCAǠҟ7՛K Y, e.|,H,lxɴIsQ}#Ր ֵ+!,^$j=GW)E+& 8PK!Ptheme/theme/theme1.xmlYOo6w toc'vuر-MniP@I}úama[إ4:lЯGRX^6؊>$ !)O^rC$y@/yH*񄴽)޵߻UDb`}"qۋJחX^)I`nEp)liV[]1M<OP6r=zgbIguSebORD۫qu gZo~ٺlAplxpT0+[}`jzAV2Fi@qv֬5\|ʜ̭NleXdsjcs7f W+Ն7`g ȘJj|h(KD- dXiJ؇(x$( :;˹! I_TS 1?E??ZBΪmU/?~xY'y5g&΋/ɋ>GMGeD3Vq%'#q$8K)fw9:ĵ x}rxwr:\TZaG*y8IjbRc|XŻǿI u3KGnD1NIBs RuK>V.EL+M2#'fi ~V vl{u8zH *:(W☕ ~JTe\O*tHGHY}KNP*ݾ˦TѼ9/#A7qZ$*c?qUnwN%Oi4 =3ڗP 1Pm \\9Mؓ2aD];Yt\[x]}Wr|]g- eW )6-rCSj id DЇAΜIqbJ#x꺃 6k#ASh&ʌt(Q%p%m&]caSl=X\P1Mh9MVdDAaVB[݈fJíP|8 քAV^f Hn- "d>znNJ ة>b&2vKyϼD:,AGm\nziÙ.uχYC6OMf3or$5NHT[XF64T,ќM0E)`#5XY`פ;%1U٥m;R>QD DcpU'&LE/pm%]8firS4d 7y\`JnίI R3U~7+׸#m qBiDi*L69mY&iHE=(K&N!V.KeLDĕ{D vEꦚdeNƟe(MN9ߜR6&3(a/DUz<{ˊYȳV)9Z[4^n5!J?Q3eBoCM m<.vpIYfZY_p[=al-Y}Nc͙ŋ4vfavl'SA8|*u{-ߟ0%M07%<ҍPK! ѐ'theme/theme/_rels/themeManager.xml.relsM 0wooӺ&݈Э5 6?$Q ,.aic21h:qm@RN;d`o7gK(M&$R(.1r'JЊT8V"AȻHu}|$b{P8g/]QAsم(#L[PK-![Content_Types].xmlPK-!֧6 +_rels/.relsPK-!kytheme/theme/themeManager.xmlPK-!Ptheme/theme/theme1.xmlPK-! ѐ' theme/theme/_rels/themeManager.xml.relsPK] !0e)) e!QQTexto1Texto2Y.!! k"%&\NqbmYlW>m1@|b!!@!@@UnknownG*Ax Times New Roman5Symbol3" Arial7.@CalibriACambria Math"A"TGA"TGNnn0$P!W>m!xxTTULOEDYAHelioOh+'0x  4 @ LX`hpTTULOEDYANormal_WordconvHelio2Microsoft Office Outlook@@ ;@ ;N՜.+,0 hp|   TTULO Title  !"#$%'()*+,-/0123458Root Entry F@;:1TableNWordDocument>0SummaryInformation(&DocumentSummaryInformation8.CompObjy  F'Microsoft Office Word 97-2003 Document MSWordDocWord.Document.89q  F#Documento do Microsoft Office Word MSWordDocWord.Document.89q