標題: Titlebook: Computational Logic in Multi-Agent Systems; 12th International W Jo?o Leite,Paolo Torroni,Leon Torre Conference proceedings 2011 Springer-V [打印本頁] 作者: 不足木 時間: 2025-3-21 16:46
書目名稱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 21:26
Shear Strength and Polymer Frictionppose action . can only be performed in state .’: we show when such preconditions exist. An application are characteristic formulae for interpreted systems. They have a special form wherein factual knowledge, positive knowledge, and ignorance can be separated.作者: 細查 時間: 2025-3-22 01:33 作者: 敘述 時間: 2025-3-22 08:14 作者: murmur 時間: 2025-3-22 11:10 作者: ureter 時間: 2025-3-22 16:19 作者: ureter 時間: 2025-3-22 17:28
Probabilistic Rule Learning in Nonmonotonic Domainsst probability of entailing the observations. This ultimately improves tolerance of noisy data compared to traditional inductive logic programming techniques. We illustrate the benefits of the approach by applying it to a planning problem in which the involved agent requires both nonmonotonicity and tolerance of noisy input.作者: SMART 時間: 2025-3-22 22:07 作者: 鉤針織物 時間: 2025-3-23 05:19
0302-9743 Workshop on Computational Logic in Multi-Agent Systems, CLIMA XII, held in Barcelona, Spain, in July 2011. .The 22 papers presented were carefully reviewed and selected from 43 submissions. The purpose of the CLIMA workshops is to provide a forum for discussing techniques, based on computational lo作者: 不合 時間: 2025-3-23 08:54 作者: 頑固 時間: 2025-3-23 13:05
Evan Schnidman,Norman Schofieldsent a protocol of three steps that achieves that goal. We verify the properties of that protocol by combinatorial and, mainly, logical (model checking) means. No such three-step protocol for cards was known. The method can be generalized. This will advance the characterization of card deals for which such exchanges of secrets are possible.作者: 眼界 時間: 2025-3-23 16:47
Bowen Li,Shefford P. Baker,Ruigang Wangorithms known from the literature, our algorithm can be used for automated program synthesis for systems in which agents are required to be homogeneous (i.e., every agent has to follow the same strategy), which is a more restrictive setting.作者: 耕種 時間: 2025-3-23 18:51 作者: 勉勵 時間: 2025-3-23 23:13 作者: Femish 時間: 2025-3-24 05:57
Transitivity and Propagation of Trust in Information Sources: An Analysis in Modal Logic, vigilance, cooperativity, validity and completeness. These definitions are formalized in Modal Logic and it is shown that even if trust, in that sense, is not transitive, we can find interesting sufficient conditions based on trust that guarantee that the truth of an information is propagated along a chain of information sources.作者: 暫時別動 時間: 2025-3-24 07:58
Three Stepssent a protocol of three steps that achieves that goal. We verify the properties of that protocol by combinatorial and, mainly, logical (model checking) means. No such three-step protocol for cards was known. The method can be generalized. This will advance the characterization of card deals for which such exchanges of secrets are possible.作者: 說笑 時間: 2025-3-24 10:44 作者: 為現(xiàn)場 時間: 2025-3-24 17:41 作者: 領帶 時間: 2025-3-24 21:00 作者: fidelity 時間: 2025-3-25 02:57
Olga Shvetsova,Katri K. Siebergnondeducibility. This work studies properties expressible through functional dependence. The main result is a complete and decidable logical system that describes interdependencies on a fixed hypergraph.作者: DEI 時間: 2025-3-25 04:04 作者: 浪費時間 時間: 2025-3-25 09:41 作者: Tincture 時間: 2025-3-25 14:59
Huu-Tu Dang,Benoit Gaudou,Nicolas Verstaevelst probability of entailing the observations. This ultimately improves tolerance of noisy data compared to traditional inductive logic programming techniques. We illustrate the benefits of the approach by applying it to a planning problem in which the involved agent requires both nonmonotonicity and tolerance of noisy input.作者: BAIL 時間: 2025-3-25 17:27
0302-9743 ions: secrets and trust, knowledge and beliefs, logics for games and social choice, cooperation, logic and languages, and norms and normative multi-agent systems.978-3-642-22358-7978-3-642-22359-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Presbyopia 時間: 2025-3-25 21:57
https://doi.org/10.1007/978-1-4684-9042-8 of agents . is able to enforce that . is true from the next step on until . becomes true’. We also provide a sound and complete axiomatization for ATAL and draw comparisons with several other logics, such as Public Announcement Logic with Assignment, Arbitrary Public Announcement Logic, Coalition Logic and Alternating-time Temporal Logic.作者: JOT 時間: 2025-3-26 02:53 作者: dialect 時間: 2025-3-26 05:30 作者: 音樂會 時間: 2025-3-26 11:37 作者: ostrish 時間: 2025-3-26 13:03 作者: Hypopnea 時間: 2025-3-26 17:59
A Formal Semantics for Brahmsxtensively used within NASA. This provides a first, but important, step towards our overall goal by establishing a formal basis for describing human-agent teamwork, which can then lead on to verification techniques.作者: 投票 時間: 2025-3-26 22:43 作者: 勉強 時間: 2025-3-27 04:52 作者: 戰(zhàn)勝 時間: 2025-3-27 06:31
A Modal Framework for Relating Belief and Signed Informationom a dynamic point of view as an agent receives information it adapts its belief state about signed information. Splitting the notions of beliefs and signed statement is useful for handling the underlying trust issue: an agent believes some statement because it may justify the statement’s origin and its reliability.作者: 變色龍 時間: 2025-3-27 13:11
Reasoning about Joint Action and Coalitional Ability in ,, with Intersectioncomplete axiomatisation of the corresponding models, as well as a characterisation of key complexity problems. We also prove a representation theorem identifying the effectivity functions corresponding to injective games.作者: 摘要記錄 時間: 2025-3-27 16:17 作者: Gastric 時間: 2025-3-27 18:20
978-3-642-22358-7Springer-Verlag GmbH Berlin Heidelberg 2011作者: Axillary 時間: 2025-3-27 22:24
Physiology and Metabalism of Boron in Plantsputer science in general and in multi-agent systems in particular. We then describe the setting of our work, situating it within the broad area of work on trust. Next we provide an overview of two lines of work we are currently pursuing — using argumentation to reason about which individuals to trus作者: escalate 時間: 2025-3-28 05:38
Gonzalo Caballero,Xosé Carlos Ariasefinition is inspired from Cognitive Science and it is seen as a truster’s belief in some trustee’s properties which are called: sincerity, competence, vigilance, cooperativity, validity and completeness. These definitions are formalized in Modal Logic and it is shown that even if trust, in that sen作者: PET-scan 時間: 2025-3-28 09:41 作者: 極大的痛苦 時間: 2025-3-28 10:49
Evan Schnidman,Norman Schofield show that there does not exist a protocol of two steps for the four-card players to inform each other safely of their hands of cards, and we then present a protocol of three steps that achieves that goal. We verify the properties of that protocol by combinatorial and, mainly, logical (model checkin作者: Acetaldehyde 時間: 2025-3-28 18:26
B. J. Briscoe,C. M. Pooley,D. Taborrmation source as long as they receive information in a multi-agent system. Agents gain that they can elaborate and justify their own current belief state by considering a reliability relation over the sources of information. The belief elaboration process is considered under two perspectives: (i) f作者: 噱頭 時間: 2025-3-28 21:50 作者: 厚顏無恥 時間: 2025-3-29 01:18 作者: 保守黨 時間: 2025-3-29 03:54 作者: orient 時間: 2025-3-29 07:16 作者: Aggressive 時間: 2025-3-29 15:01 作者: 狗窩 時間: 2025-3-29 16:09 作者: 使成波狀 時間: 2025-3-29 20:18 作者: 無法破譯 時間: 2025-3-30 00:13
Bowen Li,Shefford P. Baker,Ruigang Wangs requires the design of efficient collaboration protocols, a typical example of which is .. In this paper, we illustrate how probabilistic model checking, a technique for formal verification of probabilistic systems, can be applied to the analysis, design and verification of such protocols. We star作者: comely 時間: 2025-3-30 07:14 作者: Esalate 時間: 2025-3-30 11:58
https://doi.org/10.1007/978-3-031-22622-9on enjoys interesting properties regarding the ABA semantics of results obtained and the determinism of diagnostic answers. As a case study, we present the workings of the framework on a delivery process from e-commerce.作者: COUCH 時間: 2025-3-30 15:44
Huu-Tu Dang,Benoit Gaudou,Nicolas Verstaevel to update the knowledge base of an agent based on observations. To handle the probabilistic nature of our observation data, we employ parameter estimation to find the probabilities associated with each of these atoms and consequently with rules. The outcome is the set of rules which have the greate作者: ARY 時間: 2025-3-30 18:16
https://doi.org/10.1007/978-3-031-18192-4 verify interactions with humans still remains. In this paper we are concerned with addressing this problem. Our overall goal is to provide formal verification techniques for human-agent teamwork, particularly astronaut-robot teamwork on future space missions and human-robot interactions in health-c作者: 捏造 時間: 2025-3-30 21:31 作者: 修飾 時間: 2025-3-31 02:04 作者: Expiration 時間: 2025-3-31 08:00
Biosynthesis of Factor XIII A and B Subunitsmetric proof of the Gibbard/Satterthwaite theorem, and new insight into what it means to manipulate the vote. Next, we propose two possible strengthenings of the notion of manipulability (or weakenings of the notion of non-manipulability), and analyze how these affect the impossibility proof for non-manipulable voting rules.作者: 否決 時間: 2025-3-31 12:03
The Minerals, Metals & Materials Seriesrstand what are the commitments’ mutual relations as well as their individual states. Accordingly, we explore how commitments are related through the three-agent commitment delegation operation. We then propose exception monitoring based on such relations, and demonstrate it via a case study.作者: 砍伐 時間: 2025-3-31 16:23
https://doi.org/10.1007/978-3-031-22622-9on enjoys interesting properties regarding the ABA semantics of results obtained and the determinism of diagnostic answers. As a case study, we present the workings of the framework on a delivery process from e-commerce.作者: incite 時間: 2025-3-31 20:20
Jo?o Leite,Paolo Torroni,Leon TorreFast rack conference proceedings.Unique visuability.State of the art research作者: Abrade 時間: 2025-4-1 01:17 作者: 怕失去錢 時間: 2025-4-1 02:09 作者: 獨裁政府 時間: 2025-4-1 09:45
Social Commitment Delegation and Monitoringrstand what are the commitments’ mutual relations as well as their individual states. Accordingly, we explore how commitments are related through the three-agent commitment delegation operation. We then propose exception monitoring based on such relations, and demonstrate it via a case study.作者: nutrients 時間: 2025-4-1 14:14
Reasoning about Exceptions to Contractson enjoys interesting properties regarding the ABA semantics of results obtained and the determinism of diagnostic answers. As a case study, we present the workings of the framework on a delivery process from e-commerce.作者: 金哥占卜者 時間: 2025-4-1 17:20 作者: 寡頭政治 時間: 2025-4-1 18:36 作者: 會議 時間: 2025-4-2 02:35
Some Thoughts on Using Argumentation to Handle Trustputer science in general and in multi-agent systems in particular. We then describe the setting of our work, situating it within the broad area of work on trust. Next we provide an overview of two lines of work we are currently pursuing — using argumentation to reason about which individuals to trus
