標題: Titlebook: Declarative Agent Languages and Technologies III; Third International Matteo Baldoni,Ulle Endriss,Paolo Torroni Conference proceedings 200 [打印本頁] 作者: 動詞 時間: 2025-3-21 16:28
書目名稱Declarative Agent Languages and Technologies III影響因子(影響力)
書目名稱Declarative Agent Languages and Technologies III影響因子(影響力)學科排名
書目名稱Declarative Agent Languages and Technologies III網(wǎng)絡(luò)公開度
書目名稱Declarative Agent Languages and Technologies III網(wǎng)絡(luò)公開度學科排名
書目名稱Declarative Agent Languages and Technologies III被引頻次
書目名稱Declarative Agent Languages and Technologies III被引頻次學科排名
書目名稱Declarative Agent Languages and Technologies III年度引用
書目名稱Declarative Agent Languages and Technologies III年度引用學科排名
書目名稱Declarative Agent Languages and Technologies III讀者反饋
書目名稱Declarative Agent Languages and Technologies III讀者反饋學科排名
作者: CONE 時間: 2025-3-21 23:25 作者: 施加 時間: 2025-3-22 02:33
https://doi.org/10.1007/978-3-031-15397-6 to express queries to the agent’s belief base. We adopt and modify a proof procedure that decides if a belief query formula is derivable from the belief base of an agent. We show that the presented proof procedure is sound.作者: STEER 時間: 2025-3-22 06:00
https://doi.org/10.1007/978-3-319-41381-5work and associated influence diagram for selecting actions. The resulting agent architecture exhibits a tight integration between logic, probability, and learning. Two illustrations of the agent architecture are provided, including a user agent that is able to personalise its behaviour according to the user’s interests and preferences.作者: ungainly 時間: 2025-3-22 08:46 作者: preeclampsia 時間: 2025-3-22 16:04 作者: preeclampsia 時間: 2025-3-22 17:56 作者: expeditious 時間: 2025-3-22 21:43
An Architecture for Rational Agentswork and associated influence diagram for selecting actions. The resulting agent architecture exhibits a tight integration between logic, probability, and learning. Two illustrations of the agent architecture are provided, including a user agent that is able to personalise its behaviour according to the user’s interests and preferences.作者: alleviate 時間: 2025-3-23 01:53 作者: dura-mater 時間: 2025-3-23 06:35 作者: 蝕刻術(shù) 時間: 2025-3-23 12:59
Democratic Socialism in Britain and Swedenproposed in the literature, the algorithm that we propose in this paper allows us not only to verify if the dialogue game protocol (the model) satisfies a given property, but also if this protocol respects the tableau rules-based decomposition of the action formulae. This algorithm is an on-the-fly efficient algorithm.作者: 噴油井 時間: 2025-3-23 16:32
A Tableau Method for Verifying Dialogue Game Protocols for Agent Communicationproposed in the literature, the algorithm that we propose in this paper allows us not only to verify if the dialogue game protocol (the model) satisfies a given property, but also if this protocol respects the tableau rules-based decomposition of the action formulae. This algorithm is an on-the-fly efficient algorithm.作者: 同步信息 時間: 2025-3-23 21:56 作者: Instinctive 時間: 2025-3-23 23:55 作者: Flawless 時間: 2025-3-24 03:33 作者: crumble 時間: 2025-3-24 10:23 作者: 縮短 時間: 2025-3-24 14:43
https://doi.org/10.1007/978-3-031-15397-6’s Rule of Combination can be controlled. In particular, the certainty value of a proposition can be deduced in linear time from the beliefs of agents, without having to calculate the combination of Dempster-Shafer mass functions.作者: DEFT 時間: 2025-3-24 17:09 作者: 外向者 時間: 2025-3-24 21:36
Modelling Uncertainty in Agent Programming’s Rule of Combination can be controlled. In particular, the certainty value of a proposition can be deduced in linear time from the beliefs of agents, without having to calculate the combination of Dempster-Shafer mass functions.作者: ABASH 時間: 2025-3-25 01:59 作者: CRATE 時間: 2025-3-25 06:41 作者: Mortar 時間: 2025-3-25 09:42 作者: 江湖郎中 時間: 2025-3-25 12:08
Complete Axiomatizations of Finite Syntactic Epistemic Statesistency conditions on this set cannot in general be assumed – reasoning takes time and real agents frequently have contradictory beliefs. This paper discusses a formal model of knowledge as explicitly computed sets of formulae. It is assumed that agents represent their knowledge syntactically, and t作者: 節(jié)省 時間: 2025-3-25 18:23 作者: 厚顏無恥 時間: 2025-3-25 21:15
LAIMA: A Multi-agent Platform Using Ordered Choice Logic Programmingth respect to the design and implementation of multi-agent system is how these agents may individually reason and communicate about their knowledge and beliefs, with a view to cooperation and collaboration. In this paper, we present a deductive reasoning multi-agent platform using an extension of an作者: catagen 時間: 2025-3-26 03:08 作者: neutral-posture 時間: 2025-3-26 07:45
About Declarative Semantics of Logic-Based Agent Languagesguage DALI which has been previously defined by the authors. This “evolutionary semantics” does not resort to a concept of state: rather, it models reception of events as program transformation steps, that produce a “program evolution” and a corresponding “semantic evolution”. Communication among ag作者: 小蟲 時間: 2025-3-26 10:15
Goal Decomposition Tree: An Agent Model to Generate a Validated Agent Behaviour. This work takes place in a global framework whose goal is to define a process allowing to start from a problem specification to obtain a validated implementation of a corresponding MAS. The GDT model has been used to specify a prey-predator system which has been verified this way.作者: thwart 時間: 2025-3-26 16:23 作者: Mingle 時間: 2025-3-26 18:52 作者: 減至最低 時間: 2025-3-26 21:01
Dynagent: An Incremental Forward-Chaining HTN Planning Agent in Dynamic Domainsally changing world. Therefore, replanning in “forward-chaining” HTN planning has become an important subject for future study. This paper presents the new agent algorithm that integrates forward-chaining HTN planning, execution, belief updates, and plan modifications. Also, through combination with作者: ureter 時間: 2025-3-27 01:11
A Combination of Explicit and Deductive Knowledge with Branching Time: Completeness and Decidabilityc combination of Computational Tree Logic and an epistemic logic augmented to include an additional epistemic operator representing explicit knowledge. We show the resulting system enjoys the finite model property, decidability and is finitely axiomatisable. It is further shown that the expressivity作者: 刺耳 時間: 2025-3-27 06:31 作者: 圖畫文字 時間: 2025-3-27 10:30
A Tableau Method for Verifying Dialogue Game Protocols for Agent Communicationare defined using our social commitment-based framework for agent communication called Commitment and Argument Network (CAN). We use a variant of CTL* (ACTL*) for specifying these protocols and the properties to be verified. This logic extends CTL* by allowing formulae to constrain actions as well a作者: saphenous-vein 時間: 2025-3-27 16:09 作者: 能夠支付 時間: 2025-3-27 21:17 作者: 結(jié)合 時間: 2025-3-27 22:06
Declarative Agent Languages and Technologies III978-3-540-33107-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 保全 時間: 2025-3-28 02:11 作者: 大洪水 時間: 2025-3-28 08:27
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/d/image/264371.jpg作者: 描繪 時間: 2025-3-28 11:14
https://doi.org/10.1007/978-3-031-15397-6 In this programming language, the beliefs of agents are implemented by modal logic programs, where beliefs are represented by explicit modal operators. A distinction is made between a belief base language that can be used to represent an agent’s beliefs, and a belief query language that can be used作者: Opponent 時間: 2025-3-28 15:59 作者: CANON 時間: 2025-3-28 22:16
Delali A. Gawu,Richard Obeng Mensahistency conditions on this set cannot in general be assumed – reasoning takes time and real agents frequently have contradictory beliefs. This paper discusses a formal model of knowledge as explicitly computed sets of formulae. It is assumed that agents represent their knowledge syntactically, and t作者: 騷動 時間: 2025-3-29 02:28 作者: 改良 時間: 2025-3-29 05:54
Antonio Manrique de Luna Barriosth respect to the design and implementation of multi-agent system is how these agents may individually reason and communicate about their knowledge and beliefs, with a view to cooperation and collaboration. In this paper, we present a deductive reasoning multi-agent platform using an extension of an作者: Obliterate 時間: 2025-3-29 08:08
Antonio Manrique de Luna Barriosaged via rules. Our rules operate on a representation of the states of affairs of a multi-agent system. We define the syntax and semantics of our rules and an interpreter; we achieve greater precision and expressiveness by allowing . to be part of our rules. We show how the rules and states come tog作者: 賞心悅目 時間: 2025-3-29 13:34 作者: 悶熱 時間: 2025-3-29 18:48 作者: HOWL 時間: 2025-3-29 23:24
Democratic Network Governance in Europetheir set of beliefs, and . their beliefs by incorporating a new belief which may be inconsistent with their previous beliefs. An influential theory of belief change proposed by Alchourron, G?rdenfors and Makinson (AGM) [1] describes postulates which rational belief revision and contraction operatio作者: 剛開始 時間: 2025-3-30 00:42 作者: Incise 時間: 2025-3-30 07:21
Comparative Territorial Politicsally changing world. Therefore, replanning in “forward-chaining” HTN planning has become an important subject for future study. This paper presents the new agent algorithm that integrates forward-chaining HTN planning, execution, belief updates, and plan modifications. Also, through combination with作者: MUTED 時間: 2025-3-30 11:08 作者: Stagger 時間: 2025-3-30 14:09
Comparative Territorial Politics on Lucx, an Intensional Programming Language extended with context as first class object, to support coordination activities in a distributed network of agents. We study coordination constructs which can be applied to sequential programs and distributed transactions. We give formal syntax and seman作者: 終端 時間: 2025-3-30 19:23
