標題: Titlebook: Computational Logic in Multi-Agent Systems; 15th International W Nils Bulling,Leendert Torre,Wamberto Vasconcelos Conference proceedings 20 [打印本頁] 作者: Aggrief 時間: 2025-3-21 18:05
書目名稱Computational Logic in Multi-Agent Systems影響因子(影響力)
書目名稱Computational Logic in Multi-Agent Systems影響因子(影響力)學科排名
書目名稱Computational Logic in Multi-Agent Systems網(wǎng)絡公開度
書目名稱Computational Logic in Multi-Agent Systems網(wǎng)絡公開度學科排名
書目名稱Computational Logic in Multi-Agent Systems被引頻次
書目名稱Computational Logic in Multi-Agent Systems被引頻次學科排名
書目名稱Computational Logic in Multi-Agent Systems年度引用
書目名稱Computational Logic in Multi-Agent Systems年度引用學科排名
書目名稱Computational Logic in Multi-Agent Systems讀者反饋
書目名稱Computational Logic in Multi-Agent Systems讀者反饋學科排名
作者: 檢查 時間: 2025-3-21 22:09 作者: ELUDE 時間: 2025-3-22 00:32
A Conceptual Model for Situated Artificial Institutionsuch as norms, roles, goals, etc. In this paper, we say that an artificial institution is situated when the whole regulation that it performs is based on facts occurring in the environment where agents act. The conceiving of situated institutions is challenging as it requires to situate all abstracti作者: 只有 時間: 2025-3-22 06:17 作者: Hamper 時間: 2025-3-22 11:32
Enumerating Extensions on Random Abstract-AFs with ArgTools, Aspartix, ConArg2, and Dung-O-MaticArg2, and Dung-O-Matic. They have been tested over three different models of randomly-generated graph models, corresponding to the Erd?s-Rényi model, the Kleinberg small-world model, and the scale-free Barabasi-Albert model. This first comparison is useful to study the behaviour of these reasoners o作者: Infusion 時間: 2025-3-22 13:25 作者: Infusion 時間: 2025-3-22 19:56 作者: 付出 時間: 2025-3-22 23:33 作者: surmount 時間: 2025-3-23 02:50 作者: VEN 時間: 2025-3-23 08:51 作者: 不能和解 時間: 2025-3-23 13:24
Synthesis and Verification of Uniform Strategies for Multi-agent Systemss arguably most appropriate when it comes to modeling and specification of multi-agent systems. The related variant of model checking is known to be theoretically hard (.- to .-complete, depending on the assumptions), but virtually no . attempts at it have been proposed so far. Our algorithm searche作者: 脆弱帶來 時間: 2025-3-23 16:39 作者: 蕨類 時間: 2025-3-23 21:04
https://doi.org/10.1007/978-3-319-18944-4 cases the upper complexity bounds established for the single-agent cases are maintained: these logics’ derivability problem is in the second step of the polynomial hierarchy. For certain logics, though, we discover a complexity jump to PSPACE-completeness, which is a new phenomenon for Justification Logic.作者: 較早 時間: 2025-3-24 00:34 作者: 殘暴 時間: 2025-3-24 03:54
0302-9743 ague, Czech Republic, in August 2014..The 12 regular papers were carefully reviewed and selected from 20 submissions. The purpose of the CLIMA workshops is to provide a forum for discussing techniques, based on computational logic, for representing, programming and reasoning about agents and multi-a作者: fructose 時間: 2025-3-24 08:10 作者: amphibian 時間: 2025-3-24 10:49
Fair Allocation of Group Tasks According to Social Normsto distribute individual responsibility for discharging the group norm in a ‘fair’ or ‘equitable’ way. We propose a simple language for this kind of fairness constraints and analyse the problem of computing a fair decomposition of a group obligation, both for non-repeating and for repeating group obligations.作者: Trigger-Point 時間: 2025-3-24 16:49
Enumerating Extensions on Random Abstract-AFs with ArgTools, Aspartix, ConArg2, and Dung-O-Maticver networks with different topologies (including small-world ones): we scale the number of arguments to check the limits of today’s systems. Such results can be used to guide further improvements, specifically ConArg2, which we recently developed, and tested for the first time in this work.作者: curettage 時間: 2025-3-24 20:26
Empirical Evaluation of Strategies for Multiparty Argumentative Debatesuments. In this paper, we experimentally test a number of strategies based on target sets, and we evaluate them with respect to different criteria, as the length of the debate, the happiness of the agents, and the rationality of the result.作者: 慷慨援助 時間: 2025-3-24 23:10
Synthesis and Verification of Uniform Strategies for Multi-agent Systemss through the set of possible uniform strategies, utilizing a simple reduction technique. In consequence, it not only verifies existence of a suitable strategy but also produces one (if it exists). We validate the algorithm experimentally on a simple scalable class of models, with promising results.作者: ENACT 時間: 2025-3-25 05:34 作者: 幻想 時間: 2025-3-25 07:49 作者: Hyperalgesia 時間: 2025-3-25 15:30 作者: GAVEL 時間: 2025-3-25 18:05
A Conceptual Model for Situated Artificial Institutionss allow a SAI model to clearly state the conditions for an element of the environment to carry a status function. From a first version of a SAI specification language based on this conceptual model, we discuss its features and illustrate its dynamics through examples.作者: elastic 時間: 2025-3-25 20:25
Partial Information and Uniform Strategies share their knowledge, the case where some agents in the group may be passive, and the case where all the agents in the group share their knowledge. We include a detailed comparison to the literature on the subject.作者: 憤怒歷史 時間: 2025-3-26 00:55 作者: 剛開始 時間: 2025-3-26 05:20 作者: FRAUD 時間: 2025-3-26 10:05
Conference proceedings 2014rovide a forum for discussing techniques, based on computational logic, for representing, programming and reasoning about agents and multi-agent systems in a formal way. This edition will feature two special sessions: logics for agreement technologies and logics for games, strategic reasoning, and social choice.作者: Dendritic-Cells 時間: 2025-3-26 14:16 作者: Osteoporosis 時間: 2025-3-26 20:37
Rino Falcone,Alessandro Sapienzaver networks with different topologies (including small-world ones): we scale the number of arguments to check the limits of today’s systems. Such results can be used to guide further improvements, specifically ConArg2, which we recently developed, and tested for the first time in this work.作者: 自傳 時間: 2025-3-26 21:57
Rino Falcone,Alessandro Sapienzauments. In this paper, we experimentally test a number of strategies based on target sets, and we evaluate them with respect to different criteria, as the length of the debate, the happiness of the agents, and the rationality of the result.作者: reject 時間: 2025-3-27 02:46 作者: BOOR 時間: 2025-3-27 07:33
https://doi.org/10.1007/978-3-319-59930-4dge rules, i.e., the dynamics of how the information flows, is neglected. In this paper, we fill this gap by building upon the framework of eMCSs by further extending it with the ability to update the bridge rules of each context taking into account an incoming stream of observed bridge rules. We sh作者: Mingle 時間: 2025-3-27 10:35
Alessandro Moro,Paolo Pellizzariour persuasion dialogue as a ., which can then be solved by an automated planner to generate a strategy that maximises the chance of success given the persuader’s model of the responder; this allows us to exploit the power of existing automated planners, which have been shown to be efficient in many作者: 不妥協(xié) 時間: 2025-3-27 16:09 作者: 使人煩燥 時間: 2025-3-27 18:02
Evolving Bridge Rules in Evolving Multi-Context Systemsdge rules, i.e., the dynamics of how the information flows, is neglected. In this paper, we fill this gap by building upon the framework of eMCSs by further extending it with the ability to update the bridge rules of each context taking into account an incoming stream of observed bridge rules. We sh作者: gratify 時間: 2025-3-28 00:09
Automated Planning of Simple Persuasion Dialoguesour persuasion dialogue as a ., which can then be solved by an automated planner to generate a strategy that maximises the chance of success given the persuader’s model of the responder; this allows us to exploit the power of existing automated planners, which have been shown to be efficient in many作者: 鬼魂 時間: 2025-3-28 02:25
A Behavioral Hierarchy of Strategy Logicthe conjunctive chain if it just contains conjunctions of atomic goals together with a unique formula belonging to the disjunctive chain of level .???1. The disjunctive chain is defined similarly. We formally prove that classic and behavioral semantics for (SL[.]) coincide. Additionally, we study th作者: 復習 時間: 2025-3-28 07:34 作者: 合適 時間: 2025-3-28 13:11 作者: Moderate 時間: 2025-3-28 15:15 作者: gerrymander 時間: 2025-3-28 21:30
978-3-319-09763-3Springer International Publishing Switzerland 2014作者: corpuscle 時間: 2025-3-29 01:40
https://doi.org/10.1007/978-3-319-18944-4, Justification Logic has the ability to model argumentation and track evidence in the full logic context, to measure the complexity of the arguments, to keep the logical omniscience at bay, etc. The complexity of single-agent justification logics has been well-studied and shown to be generally lowe作者: 撤退 時間: 2025-3-29 05:11
Francisco Sousa,Fernando Lopes,Jo?o Santanaual obligations are fulfilled, the group obligation is fulfilled. Such an assignment of tasks to agents is often subject to additional social or organisational norms that specify permissible ways in which tasks can be assigned. An important type of social norms are ‘fairness constraints’, that seek 作者: magnanimity 時間: 2025-3-29 11:07 作者: 革新 時間: 2025-3-29 14:20
https://doi.org/10.1007/978-3-319-59930-4CSs) allow for the integration of knowledge from different heterogeneous sources in an effective and modular way, where so-called bridge rules express how information flows between the contexts. The problem is that mMCSs are essentially static as they were not designed to run in a dynamic scenario. 作者: entreat 時間: 2025-3-29 19:00
Rino Falcone,Alessandro SapienzaArg2, and Dung-O-Matic. They have been tested over three different models of randomly-generated graph models, corresponding to the Erd?s-Rényi model, the Kleinberg small-world model, and the scale-free Barabasi-Albert model. This first comparison is useful to study the behaviour of these reasoners o作者: POINT 時間: 2025-3-29 23:30
Alessandro Moro,Paolo Pellizzarie dialogue by asserting sets of beliefs. The responder replies honestly to indicate whether it finds the topic to be acceptable (we make no prescription as to what formalism and semantics must be used for this, only assuming some function for determining acceptable beliefs from a logical knowledge b作者: Aerophagia 時間: 2025-3-30 01:59
Rino Falcone,Alessandro Sapienzadeciding how to contribute to the current state of the debate in order to satisfy their personal goals. We focus on target sets, that specify minimal changes on the current state of the debate allowing agents to satisfy their goals, where changes are the addition and/or deletion of attacks among arg
