標(biāo)題: Titlebook: Logics in Artificial Intelligence; 15th European Confer Loizos Michael,Antonis Kakas Conference proceedings 2016 Springer International Pub [打印本頁(yè)] 作者: malcontented 時(shí)間: 2025-3-21 19:21
書(shū)目名稱Logics in Artificial Intelligence影響因子(影響力)
書(shū)目名稱Logics in Artificial Intelligence影響因子(影響力)學(xué)科排名
書(shū)目名稱Logics in Artificial Intelligence網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Logics in Artificial Intelligence網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Logics in Artificial Intelligence被引頻次
書(shū)目名稱Logics in Artificial Intelligence被引頻次學(xué)科排名
書(shū)目名稱Logics in Artificial Intelligence年度引用
書(shū)目名稱Logics in Artificial Intelligence年度引用學(xué)科排名
書(shū)目名稱Logics in Artificial Intelligence讀者反饋
書(shū)目名稱Logics in Artificial Intelligence讀者反饋學(xué)科排名
作者: 充滿裝飾 時(shí)間: 2025-3-21 22:31
Philippe Balbiani,Martín Diéguezaktikers orientiert.Das Behandlungsprogramm beschreibt detailliert die Gestaltung einer gruppentherapeutischen Behandlung und ist angepasst an die Behandlung von Patienten, die an leichteren Formen unipolarer Depressionen leiden (teil- oder vollremittierte Major Depression, Minor Depression, Dysthym作者: nugatory 時(shí)間: 2025-3-22 02:25
Stefano Bistarelli,Fabio Rossi,Francesco Santiniaktikers orientiert.Das Behandlungsprogramm beschreibt detailliert die Gestaltung einer gruppentherapeutischen Behandlung und ist angepasst an die Behandlung von Patienten, die an leichteren Formen unipolarer Depressionen leiden (teil- oder vollremittierte Major Depression, Minor Depression, Dysthym作者: harbinger 時(shí)間: 2025-3-22 08:32
Martin Gebser,Tomi Janhunen,Roland Kaminski,Torsten Schaub,Shahab Tasharrofi F?higkeit, mit moderner Technik umgehen zu k?nnen, ist also zu einer zentralen Qualifikation für eine erfolgreiche und selbst?ndige Bew?ltigung des Alltags geworden. Die Bedeutung einer solchen Qualifikation beschr?nkt sich aber nicht nur auf die F?higkeit, bestimmten technischen Anforderungen unmi作者: Celiac-Plexus 時(shí)間: 2025-3-22 09:26
Marianna Girlando,Bj?rn Lellmann,Nicola Olivetti,Gian Luca Pozzato F?higkeit, mit moderner Technik umgehen zu k?nnen, ist also zu einer zentralen Qualifikation für eine erfolgreiche und selbst?ndige Bew?ltigung des Alltags geworden. Die Bedeutung einer solchen Qualifikation beschr?nkt sich aber nicht nur auf die F?higkeit, bestimmten technischen Anforderungen unmi作者: RAG 時(shí)間: 2025-3-22 13:42
Jean Fran?ois Baget,Salem Benferhat,Zied Bouraoui,Madalina Croitoru,Marie-Laure Mugnier,Odile Papiniuppentherapeutischen Behandlung und ist angepasst an die Behandlung von Patienten, die an leichteren Formen unipolarer Depressionen leiden (teil- oder vollremittierte Major Depression, Minor Depression, Dysthym978-3-642-25229-7作者: thalamus 時(shí)間: 2025-3-22 17:15 作者: 鑒賞家 時(shí)間: 2025-3-22 22:39
Francesco Belardinelli,Alessio Lomusciouppentherapeutischen Behandlung und ist angepasst an die Behandlung von Patienten, die an leichteren Formen unipolarer Depressionen leiden (teil- oder vollremittierte Major Depression, Minor Depression, Dysthym978-3-642-25229-7作者: 召集 時(shí)間: 2025-3-23 02:30
Jean-Marc Alliot,Martín Diéguez,Luis Fari?as del Cerro作者: 上坡 時(shí)間: 2025-3-23 08:34
Dario Della Monica,Angelo Montanari,Aniello Murano,Pietro Sala作者: Density 時(shí)間: 2025-3-23 13:19
Writing Declarative Specifications for Clausesate-of-the-art ASP grounders to accomplish the grounding step of clauses. As a result, we obtain a general-purpose clause-level grounding approach for SAT solvers. Finally, we illustrate the capabilities of our specification methodology in terms of combinatorial and application problems.作者: 厭倦嗎你 時(shí)間: 2025-3-23 14:07
https://doi.org/10.1007/978-3-319-48758-8Argumentation; complexity; decidability; logic; probabilistic reasoning; answer set programming; artificia作者: Cerumen 時(shí)間: 2025-3-23 19:03
978-3-319-48757-1Springer International Publishing AG 2016作者: infringe 時(shí)間: 2025-3-24 01:33 作者: 確定 時(shí)間: 2025-3-24 03:29 作者: 蔑視 時(shí)間: 2025-3-24 08:51
A Three-Value Abstraction Technique for the Verification of Epistemic Properties in Multi-agent Systulti-agent system. First we introduce a three-value interpretation of epistemic logic, based on a notion of order defined on the information content of the local states of each agent. Then, we use the three-value semantics to introduce an abstraction technique to verify epistemic properties of agents in infinite-state multi-agent systems.作者: cardiac-arrest 時(shí)間: 2025-3-24 12:18
Loizos Michael,Antonis KakasIncludes supplementary material: 作者: accessory 時(shí)間: 2025-3-24 17:56 作者: 信任 時(shí)間: 2025-3-24 19:26
Hilbert-Style Axiomatization for Hybrid XPath with Dataspect to the class of abstract data trees, i.e., data trees in which data values are abstracted as equivalence relations. As a corollary, we also obtain completeness with respect to the class of concrete data trees.作者: 令人悲傷 時(shí)間: 2025-3-25 01:56 作者: 興奮過(guò)度 時(shí)間: 2025-3-25 07:02 作者: 一大塊 時(shí)間: 2025-3-25 10:50 作者: jealousy 時(shí)間: 2025-3-25 13:36
Prompt Interval Temporal Logictroduce .., a prompt extension of the well-studied interval temporal logic ., and we prove the undecidability of its satisfiability problem; then, we show how to recover decidability (NEXPTIME-completeness) by imposing a natural syntactic restriction on it.作者: 幸福愉悅感 時(shí)間: 2025-3-25 18:51
Reasoning About Justified Belief Based on the Fusion of Evidencegics. As a byproduct, we also show that the proposed logics are easily extended to accommodate dynamic evidential reasoning. Consequently, we can integrate JL and dynamic epistemic logic (DEL) paradigms in a natural way.作者: 你不公正 時(shí)間: 2025-3-25 23:45
0302-9743 , JELIA 2016, held in Larnaca, Cyprus, in November 2015. The 32 full papers and 10 short papers included in this volume were carefully reviewed and selected from 88 submissions. The accepted papers span a number of areas within Logics in AI, including: belief revision, answer set programming, argume作者: 小臼 時(shí)間: 2025-3-26 03:26
Metabolic Pathways as Temporal Logic ProgramsMolecular Equilibrium Logic, a nonmonotonic logic which allows representing metabolic pathways. We also show how this logic can be presented in terms of a syntactical subset of Temporal Equilibrium Logic, the temporal extension of Equilibrium Logic, called Splittable Temporal Logic Programs.作者: sparse 時(shí)間: 2025-3-26 04:27
Approximate Unification in the Description Logic ,distance measures between concepts. We show that approximate unification in . can be reduced to approximately solving language equations, and devise algorithms for solving the latter problem for two particular distance measures.作者: 蠟燭 時(shí)間: 2025-3-26 09:16 作者: 不發(fā)音 時(shí)間: 2025-3-26 14:45 作者: MIR 時(shí)間: 2025-3-26 19:24 作者: Forage飼料 時(shí)間: 2025-3-27 00:35 作者: 熱心助人 時(shí)間: 2025-3-27 01:15 作者: Meditative 時(shí)間: 2025-3-27 06:54
On Logics of Group Belief in Structured Coalitionstural semantics for the group belief operator. We define the group belief of a set of agents in two different ways and study their corresponding logics. We also study a logic where doxastic preference is expressed by a binary operator. We prove completeness and discuss correspondences between the logics.作者: hauteur 時(shí)間: 2025-3-27 09:43
Decidability and Expressivity of Ockhamist?Propositional Dynamic LogicsEXPTIME decision procedure for the satisfiability problem of each variant. The decision procedure for the first variant of . is based on the elimination of Hintikka sets while the decision procedure for the second variant relies on automata.作者: Ccu106 時(shí)間: 2025-3-27 14:18 作者: Obverse 時(shí)間: 2025-3-27 21:13
Introducing Role Defeasibility in Description Logicsrential semantics for a number of defeasible constructs on roles. We show that this does not negatively affect decidability or complexity of reasoning for an important class of DLs, and that existing notions of preferential reasoning can be expressed in terms of defeasible roles.作者: affect 時(shí)間: 2025-3-28 00:52
0302-9743 ntation, probabilistic reasoning, handling inconsistencies, temporal logics and planning, description logics, and decidability and complexity results..978-3-319-48757-1978-3-319-48758-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 貧窮地活 時(shí)間: 2025-3-28 02:20 作者: 衰弱的心 時(shí)間: 2025-3-28 07:54
Jean Fran?ois Baget,Salem Benferhat,Zied Bouraoui,Madalina Croitoru,Marie-Laure Mugnier,Odile Papini zu depressiven St?rungen.Gut gegliedert: Eine einheitliche .Kognitive Verhaltenstherapie depressiven Grübelns .Grübeln gilt als ein zentraler Vulnerabilit?tsfaktor für die Entstehung und Aufrechterhaltung depressiver St?rungen wie auch für das Auftreten von Rückf?llen und Wiedererkrankungen. Im vor作者: 證實(shí) 時(shí)間: 2025-3-28 14:08
Philippe Balbiani,Martín Diéguezessiver St?rungen wie auch für das Auftreten von Rückf?llen und Wiedererkrankungen. Im vorliegenden Manual findet sich die erste deutschsprachige Anleitung zur Therapie depressiver Grübelprozesse. Basierend auf aktuellen Forschungsergebnissen zur metakognitiven Therapie sowie zu modernen verhaltenst作者: 褪色 時(shí)間: 2025-3-28 18:11 作者: Thyroiditis 時(shí)間: 2025-3-28 19:10 作者: 關(guān)節(jié)炎 時(shí)間: 2025-3-29 00:33 作者: Venules 時(shí)間: 2025-3-29 03:05 作者: LEERY 時(shí)間: 2025-3-29 11:11 作者: progestin 時(shí)間: 2025-3-29 13:32 作者: 原告 時(shí)間: 2025-3-29 17:06 作者: Antagonism 時(shí)間: 2025-3-29 20:08
Hilbert-Style Axiomatization for Hybrid XPath with Dataextension of vertical XPath with nominals and the hybrid operator @. Then, we introduce an axiomatic system for ., and we prove it is complete with respect to the class of abstract data trees, i.e., data trees in which data values are abstracted as equivalence relations. As a corollary, we also obta作者: Coterminous 時(shí)間: 2025-3-30 02:43 作者: neuron 時(shí)間: 2025-3-30 05:19 作者: Microgram 時(shí)間: 2025-3-30 10:57
Temporal Here and Therece results about axiomatisation and interdefinability of modal operators remained unknown. In this paper we provide a sound and complete axiomatic system for THT together with several results on interdefinability of modal operators.作者: Vulnerable 時(shí)間: 2025-3-30 12:36 作者: HEW 時(shí)間: 2025-3-30 16:41 作者: 惡名聲 時(shí)間: 2025-3-30 23:05 作者: arthroplasty 時(shí)間: 2025-3-31 02:50
Decidability and Expressivity of Ockhamist?Propositional Dynamic Logicsies of logic widely used in AI to model reactive systems and multi-agent systems (MAS). In this paper, we present two variants of this logic. These two logics share the same language and differ only in one semantic condition. The first logic embeds Bundled . while the second embeds .. We provide a 2作者: OWL 時(shí)間: 2025-3-31 06:57 作者: Graphite 時(shí)間: 2025-3-31 13:15 作者: Nefarious 時(shí)間: 2025-3-31 16:28 作者: 1FAWN 時(shí)間: 2025-3-31 17:36 作者: deciduous 時(shí)間: 2025-3-31 23:14 作者: 揮舞 時(shí)間: 2025-4-1 03:36
Reasoning About Justified Belief Based on the Fusion of Evidencelieved are explicitly represented as justification terms, we explore the relationship between justified belief and fused information from different evidential sources. We argue that the expressive power of JL is inadequate for our purpose, because, while a justification formula can represent that a 作者: DUCE 時(shí)間: 2025-4-1 06:14
Writing Declarative Specifications for Clauseshe conjunctive normal form (CNF) of propositional formulas. To use SAT solver technology in practice, a user must create the input clauses in one way or another. A typical approach is to write a procedural program that generates formulas on the basis of some input data relevant for the problem domai作者: iodides 時(shí)間: 2025-4-1 12:43
