作者: CARE 時間: 2025-3-21 21:43
Tor Hagland,Thomas ?gotneserumschwirren, habe ich nie gesehen. Dennoch betrachte ich das Hirn eines M?rders immer mit einer gewissen prickelnden Neugier: was mag in diesen korallfarbenen, grauen Windungen verborgen liegen? Was geschah auf den komplizierten Wegen durch die feinen Vernetzungen aus Axonen und Dendriten, deren w作者: 漫不經(jīng)心 時間: 2025-3-22 01:47
Nikolay Bazhenov,Manat Mustafa,Sergei Ospichev,Luca San Mauro作者: Highbrow 時間: 2025-3-22 06:47
Davide Grossi,Barteld Kooi,Xingchi Su,Rineke Verbrugge作者: Gnrh670 時間: 2025-3-22 10:47 作者: linear 時間: 2025-3-22 13:59
Approximating Approximate Reasoning: Fuzzy Sets and the Ershov Hierarchy,llapse; that, in analogy with the classical case, each fuzzy .-c.e. set can be represented as a Boolean combination of fuzzy c.e. sets; but that, contrary to the classical case, the Fuzzy Ershov Hierarchy does not exhaust the class of all . fuzzy sets.作者: 莎草 時間: 2025-3-22 18:37
Reasoning in Large Games with Unboundedly Many Players,resent a complete axiomatization of the valid formulas. The logic admits a natural model checking algorithm and bisimulation characterization. The logic with quantification over players is more appropriate, but is undecidable.作者: 母豬 時間: 2025-3-22 23:20
,Multi-agent Conformant Planning with?Distributed Knowledge,framework with modalities of distributed knowledge to handle the epistemic reasoning in such scenarios, and we reduce a problem of multi-agent conformant planning to a model checking problem. We prove that multi-agent conformant planning is .-complete on the size of the dynamic epistemic model.作者: 遷移 時間: 2025-3-23 03:39 作者: 保全 時間: 2025-3-23 06:45 作者: dithiolethione 時間: 2025-3-23 19:02
Logic, Rationality,and Interaction978-3-030-88708-7Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Ascribe 時間: 2025-3-23 23:43 作者: 排名真古怪 時間: 2025-3-24 04:43
Social Bot Detection as a Temporal Logic Model Checking Problem,el from a real-life social network. We show that we can reduce TNL to a fragment of linear temporal logic with past and use this to establish the computational efficiency of model checking for social bot detection.作者: 泰然自若 時間: 2025-3-24 07:11
Modelling Accuracy and Trustworthiness of Explaining Agents, and trustworthiness of explaining agents. We also provide a semantics for this logic, based on a multi-agent structure and relative model-checking algorithms. The paper concludes with a simple example of a possible application.作者: PLAYS 時間: 2025-3-24 14:09
Conference proceedings 2021on, LORI 2021, held in Xi`an, China, in October 2021..The 15 full papers presented together with 7 short papers in this book were carefully reviewed and selected from 40 submissions. The workshop covers a wide range on the following topics such as doxastic and epistemic logics, deontic logic, intuit作者: PATRI 時間: 2025-3-24 17:58
,Discrete Linear Temporal Logic with?Knowing-Value Operator,ent state of knowledge of the agents in the system relevant, but also how that state of knowledge changes over time. So we introduce temporal logic operators ‘next’ and ‘until’ to extend Plaza’s system. The completeness proof is highly non-trivial and we referred to the work of [., .].作者: output 時間: 2025-3-24 19:41 作者: 爭議的蘋果 時間: 2025-3-25 02:49
Situated Epistemic Updates,c, and non-monotonic update in substructural dynamic epistemic logic. Our investigation is mainly conceptual, but leads to completeness results using reduction axioms, and lays the groundwork for future investigation into the concept of situated epistemic update.作者: 無價值 時間: 2025-3-25 04:08 作者: Sedative 時間: 2025-3-25 10:55 作者: 不如屎殼郎 時間: 2025-3-25 12:59
,Epistemic Planning with Attention as?a?Bounded Resource,a powerful formalism for epistemic planning). We identify the framework as a fragment of standard DEL, and consider its plan existence problem. While it is undecidable in the general case, we show that when attention is required for learning, all instances of the problem are decidable.作者: Entrancing 時間: 2025-3-25 19:08
Hypergraphs, Local Reasoning, and Weakly Aggregative Modal Logic,ing point, we show that, among many completeness results obtained in this paper, the limit of a family of weakly aggregative logics is both exactly the modal logic of hypergraphs and also the epistemic logic of local reasoning with veracity and positive introspection. The logics studied are shown to be decidable based on a filtration construction.作者: 膽小懦夫 時間: 2025-3-25 22:41
,Weighted Modal Logic in Epistemic and?Deontic Contexts,or utilities. We make use of weighted Kripke models with the weights understood epistemically as a similarity measure between states and deontically as a measure of expected utilities. We present sound and complete axiomatizations for the logics, and discuss variants and possible extensions.作者: cochlea 時間: 2025-3-26 03:41 作者: MAPLE 時間: 2025-3-26 07:21
A Generalization of Ordered-Pair Semantics, set of designated (or distinguished) values that one chooses. Building on the technical observations, we offer intuitively plausible readings for the semantics, and we also discuss some weaknesses of the original intuitive reading advanced by Clemens.作者: Wallow 時間: 2025-3-26 09:17
How Knowledge Triggers Obligation, here. We motivate the logic by analyzing several scenarios and by showing how it can capture in an original manner several fundamental deontic notions such as absolute, . and all-things-considered obligations. Finally, in the dynamic epistemic logic tradition, we provide reduction axioms for the dynamic operator of the new logic.作者: 饑荒 時間: 2025-3-26 14:21 作者: 心胸狹窄 時間: 2025-3-26 20:39
Conference proceedings 2021nd selected from 40 submissions. The workshop covers a wide range on the following topics such as doxastic and epistemic logics, deontic logic, intuitionistic and subsstructural logics, voting theory, and (a new..theme emphasized this year) causal inference..作者: 民間傳說 時間: 2025-3-26 23:51 作者: septicemia 時間: 2025-3-27 04:22
0302-9743 Interaction, LORI 2021, held in Xi`an, China, in October 2021..The 15 full papers presented together with 7 short papers in this book were carefully reviewed and selected from 40 submissions. The workshop covers a wide range on the following topics such as doxastic and epistemic logics, deontic log作者: 分開如此和諧 時間: 2025-3-27 08:20
Approximating Approximate Reasoning: Fuzzy Sets and the Ershov Hierarchy,s according to the first-order complexity of their defining formulas. The Ershov Hierarchy classifies . sets with respect to the number of mistakes that are needed to approximate them. Biacino and Gerla extended the Kleene Hierarchy to the realm of fuzzy sets, whose membership functions range in a c作者: Brittle 時間: 2025-3-27 10:25 作者: 博識 時間: 2025-3-27 15:15 作者: Orthodontics 時間: 2025-3-27 21:01 作者: 染色體 時間: 2025-3-27 23:11 作者: 1FAWN 時間: 2025-3-28 05:13
,Weighted Modal Logic in Epistemic and?Deontic Contexts,mic logic for reasoning about agents’ knowledge based on their capability, and in deontic logic for agents’ choices based on their deontic capability or utilities. We make use of weighted Kripke models with the weights understood epistemically as a similarity measure between states and deontically a作者: Popcorn 時間: 2025-3-28 07:41 作者: OGLE 時間: 2025-3-28 12:13
,Crossing Hands in the Russian Cards?Problem,are able to transmit secret information safely over a public non-secure channel without the secret being learned by a third party with access to the channel. Epistemic logic in general and public announcement logic in particular have been very useful in this study, as it involves careful analysis of作者: Impugn 時間: 2025-3-28 17:31
Voting Theory in the Lean Theorem Prover,puter-aided methods such as SAT solving and interactive theorem proving. In this paper, we report on the development of a framework for formalizing voting theory in the Lean theorem prover, which we have applied to verify properties of a recently studied voting method. While previous applications of作者: INERT 時間: 2025-3-28 22:00 作者: 法律 時間: 2025-3-29 00:53 作者: 焦慮 時間: 2025-3-29 07:01
A Generalization of Ordered-Pair Semantics,.. Moreover, we show that the resulting semantics can accommodate not only ., but also classical logic as well as strong Kleene logic depending on the set of designated (or distinguished) values that one chooses. Building on the technical observations, we offer intuitively plausible readings for the作者: OREX 時間: 2025-3-29 07:55
Social Bot Detection as a Temporal Logic Model Checking Problem, of social bots is dominated by machine learning approaches. In this paper we explore bot detection as a model checking problem. We introduce Temporal Network Logic (TNL) which we use to specify social networks where agents can post and follow each other. In this logic we formalize different types o作者: FILLY 時間: 2025-3-29 11:38
Assertion, Rejection, and Semantic Universals,gated disjunction ., but no word to express negated conjunction *. nor any other Boolean connective. Natural language grammar can be described by a logic that expresses what the lexicon can express by its primitives, and the rest compositionally. Such logic for propositional connectives is described作者: 內閣 時間: 2025-3-29 16:14
Situated Epistemic Updates, paper we discuss representations of epistemic update in terms of situations. After linking epistemic update based on deleting epistemic accessibility arrows with update of situations, we discuss two specific kinds of public epistemic update; monotonic update in intuitionistic dynamic epistemic logi作者: Ordnance 時間: 2025-3-29 21:46
How Knowledge Triggers Obligation,o capture the . interaction between knowledge and obligations. We introduce the dynamic extension of an existing logic for knowledge-based obligations here. We motivate the logic by analyzing several scenarios and by showing how it can capture in an original manner several fundamental deontic notion作者: diskitis 時間: 2025-3-30 03:18
,On Artemov and Protopopescu’s Intuitionistic Epistemic Logic Expanded with Distributed Knowledge,mic logic ., where the axiom . is accepted but the axiom . is refused. This paper studies the notion of distributed knowledge on an expansion of the multi agent variant of .. We provide a BHK interpretation of distributed knowledge operator to define the intuitionistic epistemic logic with distribut作者: Antarctic 時間: 2025-3-30 04:59
Modelling Accuracy and Trustworthiness of Explaining Agents,nes. Such agents are naturally required to be accurate and trustworthy. However, what it means for an explaining agent to be accurate and trustworthy is far from being clear. We characterize accuracy and trustworthiness as measures of the distance between the formal properties of a given opaque syst作者: outskirts 時間: 2025-3-30 11:28
Rustam Galimullin,Thomas ?gotnesern ist lediglich die Abwesenheit oder Negation des Guten.? Derlei Feinheiten liegen au?erhalb meiner Kompetenz; ich bin Naturwissenschaftler, kein Theologe. Ich wei? nicht, woraus das B?se entsteht, aber ich habe gesehen, was es anrichtet. Ich habe seine Auswirkungen untersucht, als es bereits über作者: 無能性 時間: 2025-3-30 15:10 作者: 不自然 時間: 2025-3-30 19:00
7樓作者: 性別 時間: 2025-3-30 21:32
7樓作者: 排出 時間: 2025-3-31 04:14
7樓作者: 親密 時間: 2025-3-31 05:40
7樓作者: 得體 時間: 2025-3-31 09:15
8樓作者: 下垂 時間: 2025-3-31 14:30
8樓作者: FEAT 時間: 2025-3-31 17:31
8樓作者: backdrop 時間: 2025-4-1 00:03
8樓作者: Crater 時間: 2025-4-1 03:36
9樓作者: crockery 時間: 2025-4-1 07:04
9樓作者: 有害 時間: 2025-4-1 13:33
9樓作者: Anemia 時間: 2025-4-1 17:32
9樓作者: 剛開始 時間: 2025-4-1 21:57
10樓作者: 浪費物質 時間: 2025-4-1 22:49
10樓作者: 松軟無力 時間: 2025-4-2 06:41
10樓作者: CEDE 時間: 2025-4-2 08:24
10樓
