標(biāo)題: Titlebook: Computational Logic in Multi-Agent Systems; 11th International W Jürgen Dix,Jo?o Leite,Wojtek Jamroga Conference proceedings 2010 Springer- [打印本頁] 作者: Fatuous 時(shí)間: 2025-3-21 16:59
書目名稱Computational Logic in Multi-Agent Systems影響因子(影響力)
書目名稱Computational Logic in Multi-Agent Systems影響因子(影響力)學(xué)科排名
書目名稱Computational Logic in Multi-Agent Systems網(wǎng)絡(luò)公開度
書目名稱Computational Logic in Multi-Agent Systems網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Computational Logic in Multi-Agent Systems被引頻次
書目名稱Computational Logic in Multi-Agent Systems被引頻次學(xué)科排名
書目名稱Computational Logic in Multi-Agent Systems年度引用
書目名稱Computational Logic in Multi-Agent Systems年度引用學(xué)科排名
書目名稱Computational Logic in Multi-Agent Systems讀者反饋
書目名稱Computational Logic in Multi-Agent Systems讀者反饋學(xué)科排名
作者: Palter 時(shí)間: 2025-3-22 00:13 作者: 草率男 時(shí)間: 2025-3-22 02:46 作者: 新星 時(shí)間: 2025-3-22 07:55 作者: emission 時(shí)間: 2025-3-22 09:18
Is Computational Complexity a Barrier to Manipulation?satisfiability and other NP-hard problems. I show that phase transition behaviour gives insight into the hardness of manipulating voting rules, increasing concern that computational complexity is indeed any sort of barrier. Finally, I look at the problem of computing manipulation of other, related p作者: 稱贊 時(shí)間: 2025-3-22 14:22 作者: 稱贊 時(shí)間: 2025-3-22 20:58
From Organisation Specification to Normative Programming in Multi-Agent Organisationsnormative programming language (with primitives such as norms and obligations). We briefly describe how this all has been implemented on top of ., the distributed artifact-based organisation management infrastructure for ..作者: SLAY 時(shí)間: 2025-3-22 22:27 作者: CRANK 時(shí)間: 2025-3-23 03:18 作者: Senescent 時(shí)間: 2025-3-23 07:36
https://doi.org/10.1007/978-3-663-19721-8e current state of the database and recent agent actions and external events. The execution of actions and the assimilation of observations generate a sequence of database states. In the case of the successful solution of all goals, this sequence, taken as a whole, determines a model that makes the agent’s goals and beliefs all..作者: Grandstand 時(shí)間: 2025-3-23 11:44
Speculative Abductive Reasoning for Hierarchical Agent Systemstraints, enables agents to receive conditional answers and to continue their local reasoning using default answers, thus increasing the parallelism of agents collaboration. The paper describes the framework and its operational model, illustrates the main features with an example and states soundness and completeness results.作者: prosthesis 時(shí)間: 2025-3-23 15:01
An Agent Language with Destructive Assignment and Model-Theoretic Semanticse current state of the database and recent agent actions and external events. The execution of actions and the assimilation of observations generate a sequence of database states. In the case of the successful solution of all goals, this sequence, taken as a whole, determines a model that makes the agent’s goals and beliefs all..作者: STELL 時(shí)間: 2025-3-23 19:16 作者: artifice 時(shí)間: 2025-3-23 22:16
Die Aufgabe und ihre Bedeutung, for simple type theory exist that can be uniformly employed for reasoning . and . combinations of logics. Combinations of modal logics and other logics are particularly relevant for multi-agent systems.作者: Optometrist 時(shí)間: 2025-3-24 02:53 作者: Affection 時(shí)間: 2025-3-24 08:56 作者: 踉蹌 時(shí)間: 2025-3-24 13:06 作者: inculpate 時(shí)間: 2025-3-24 15:54
,Zusatzverkokung und Koksqualit?t,y) non monotonic causal laws which (possibly) enforce new obligations. In this context, verifying compliance amounts to verify that no execution of the business process leaves some commitment unfulfilled. Compliance verification can be performed by Bounded Model Checking.作者: bizarre 時(shí)間: 2025-3-24 20:56
Games, Norms and Strategic Notions in Information Flow Security definitions of information flow security. Results concerning several types of games are drawn upon in the proofs of these complexity results. We also consider a normative aspect, viz, the use in implementations of access control permission policies to enforce an information flow security policy.作者: fibula 時(shí)間: 2025-3-25 00:10
Formal Semantics of a Dynamic Epistemic Logic for Describing Knowledge Properties of ,-Calculus Procteraction among agents as elaborated .-calculus programs, and it is also possible to describe the dynamic knowledge implications of such programs. We show the utility of our language by encoding the Dining Cryptographers protocol.作者: 嚴(yán)厲批評(píng) 時(shí)間: 2025-3-25 04:34 作者: interference 時(shí)間: 2025-3-25 10:40 作者: 分開如此和諧 時(shí)間: 2025-3-25 13:33 作者: TRAWL 時(shí)間: 2025-3-25 16:30
0302-9743 , programming and reasoning about agents and multi-agent systems in a formal way. CLIMA 2010 featured two thematic special sessions on norms and normative multi-agent systems and logics for games and strategic reasoning.?.978-3-642-14976-4978-3-642-14977-1Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Dendritic-Cells 時(shí)間: 2025-3-25 20:55
Conference proceedings 2010bon, Portugal in August 2010.?The 14 papers included in this volume were carefully reviewed and selected from 31 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 an作者: 延期 時(shí)間: 2025-3-26 00:44 作者: Itinerant 時(shí)間: 2025-3-26 05:10 作者: Osteoarthritis 時(shí)間: 2025-3-26 09:06
,Zusatzverkokung und Koksqualit?t, system that describes interdependencies that may exist on a fixed hypergraph. The properties of interdependencies are defined through a multi-argument relation called ., which is a generalization of a binary relation also known as nondeducibility.作者: 退出可食用 時(shí)間: 2025-3-26 13:43 作者: Nmda-Receptor 時(shí)間: 2025-3-26 17:33 作者: Maximize 時(shí)間: 2025-3-27 00:52
https://doi.org/10.1007/978-3-663-19721-8ictly dominated strategies, or playing a best response. The other, ., is a modal fixpoint language with expressions for optimality, rationality and belief. Fixpoints are used to form expressions for common belief and for iterated elimination of non-optimal strategies.作者: ACRID 時(shí)間: 2025-3-27 01:58
Group Announcements: Logic and Games (Abstract of Invited Talk) announcements can be studied by adding quantification over group announcements to the logical language. Second, the game theory of group announcements can be studied by assuming that each agent has preferences over epistemic states (here, represented as an epistemic goal formula).作者: 高興去去 時(shí)間: 2025-3-27 08:03
Hypergraphs of Multiparty Secrets system that describes interdependencies that may exist on a fixed hypergraph. The properties of interdependencies are defined through a multi-argument relation called ., which is a generalization of a binary relation also known as nondeducibility.作者: 一再困擾 時(shí)間: 2025-3-27 11:28 作者: Canopy 時(shí)間: 2025-3-27 17:07 作者: 犬儒主義者 時(shí)間: 2025-3-27 19:16
Proof-Theoretic Analysis of Rationality for Strategic Games with Arbitrary Strategy Setsictly dominated strategies, or playing a best response. The other, ., is a modal fixpoint language with expressions for optimality, rationality and belief. Fixpoints are used to form expressions for common belief and for iterated elimination of non-optimal strategies.作者: Mobile 時(shí)間: 2025-3-27 22:50
Jürgen Dix,Jo?o Leite,Wojtek Jamrogafast-track conference proceedings作者: misshapen 時(shí)間: 2025-3-28 05:31
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/232630.jpg作者: FIG 時(shí)間: 2025-3-28 08:24
https://doi.org/10.1007/978-3-642-14977-1Multi-agent system; agent interaction; agents; computational complexity; normative programming; programmi作者: 希望 時(shí)間: 2025-3-28 12:00
978-3-642-14976-4Springer-Verlag Berlin Heidelberg 2010作者: 立即 時(shí)間: 2025-3-28 16:43
What Happened to My Commitment? Exception Diagnosis among Misalignment and Misbehavior current states of their commitments. We also provide an alignment policy that can be applied by an agent when the diagnosis algorithm identifies a misalignment. We formalize a delivery process from e-commerce using ., and present a case study to demonstrate the workings of our approach.作者: 口訣法 時(shí)間: 2025-3-28 21:07 作者: 陳腐的人 時(shí)間: 2025-3-28 23:02
,Zusatzverkokung und Koksqualit?t,erences in the form of a ballot and use a voting rule to decide the winning action(s). Unfortunately, agents may try to manipulate such an election by mis-reporting their preferences. Fortunately, it has been shown that it is NP-hard to compute how to manipulate a number of different voting rules. H作者: 怕失去錢 時(shí)間: 2025-3-29 04:22
Die Aufgabe und ihre Bedeutung, a system is intended to maintain. Giving precise definitions of information flow security has proved to be a subtle matter. Some of the definitions that have been developed make explicit reference to strategic behaviour of the adversary. We present a perspective on these aspects of information secu作者: Morsel 時(shí)間: 2025-3-29 10:16 作者: cinder 時(shí)間: 2025-3-29 13:41 作者: PLUMP 時(shí)間: 2025-3-29 16:53
,Zusatzverkokung und Koksqualit?t,s. These sets can be viewed as edges of a hypergraph whose vertices are the parties of the system. The main result is a complete and decidable logical system that describes interdependencies that may exist on a fixed hypergraph. The properties of interdependencies are defined through a multi-argumen作者: 壓碎 時(shí)間: 2025-3-29 20:24
Die Aufgabe und ihre Bedeutung,ent logics, including (quantified) multimodal logics and intuitionistic logics, can be elegantly embedded in simple type theory. Furthermore, simple type theory is sufficiently expressive to model combinations of embedded logics and it has a well understood semantics. Off-the-shelf reasoning systems作者: 反應(yīng) 時(shí)間: 2025-3-30 03:57
,Einzelheiten zur Durchführung der Versuche, of the world can influence each agent’s local computation, and communication channels may introduce delays, creating multiple partial answers at different times. Agent’s answers may, therefore, be incomplete and revisable, giving rise to the concept of speculative reasoning, which provides a framew作者: 威脅你 時(shí)間: 2025-3-30 05:04
Theoretische Grundlagen des Problems,cy nor epistemic capabilities. In this paper, we present the formal syntax and semantics of a multi-agent dynamic epistemic logic. In this logic, the epistemic actions of agents are .-calculus processes. A process of the language is translated to a class of model updating functions reflecting the ep作者: HEED 時(shí)間: 2025-3-30 10:57 作者: GLEAN 時(shí)間: 2025-3-30 16:25
,Zusatzverkokung und Koksqualit?t, action theory. The action theory is defined through a combination of Answer Set Programming and Dynamic Linear Time Temporal Logic (DLTL). The temporal action theory allows us to formalize a business process as a temporal domain description, possibly including temporal constraints. Obligations in n作者: 倒轉(zhuǎn) 時(shí)間: 2025-3-30 16:35
,Einzelheiten zur Durchführung der Versuche,ative programming. With this approach, while designers and agents still use a highly abstract organisational modelling language to specify and reason about the multi-agent organisation, the development of the organisation management infrastructure is facilitated in the following manner. The high-lev作者: intercede 時(shí)間: 2025-3-30 21:43
Die Aufgabe und ihre Bedeutung,ategies for agents with incomplete information for enforcing a property expressible in the language of Alternating-time Temporal Logic ATL. The main application of the algorithm is automated program synthesis for systems that can be modeled as multi-agent systems with incomplete information (e.g., d作者: antipsychotic 時(shí)間: 2025-3-31 03:16 作者: 多樣 時(shí)間: 2025-3-31 05:27
https://doi.org/10.1007/978-3-663-04452-9r game on a graph. Such problem applies to the automatic synthesis of controllers, where positional strategies represent efficient controllers. As our main result, we describe a novel sufficient condition for half positionality, more general than what was previously known. Moreover, we compare our p作者: fluffy 時(shí)間: 2025-3-31 13:15
https://doi.org/10.1007/978-3-663-19721-8st responses. This involves looking at two formal languages. One, ., is first-order, and is used to formalise optimality conditions, like avoiding strictly dominated strategies, or playing a best response. The other, ., is a modal fixpoint language with expressions for optimality, rationality and be
