標(biāo)題: Titlebook: Description Logic, Theory Combination, and All That; Essays Dedicated to Carsten Lutz,Uli Sattler,Frank Wolter Book 2019 Springer Nature S [打印本頁] 作者: oxidation 時(shí)間: 2025-3-21 18:42
書目名稱Description Logic, Theory Combination, and All That影響因子(影響力)
書目名稱Description Logic, Theory Combination, and All That影響因子(影響力)學(xué)科排名
書目名稱Description Logic, Theory Combination, and All That網(wǎng)絡(luò)公開度
書目名稱Description Logic, Theory Combination, and All That網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Description Logic, Theory Combination, and All That被引頻次
書目名稱Description Logic, Theory Combination, and All That被引頻次學(xué)科排名
書目名稱Description Logic, Theory Combination, and All That年度引用
書目名稱Description Logic, Theory Combination, and All That年度引用學(xué)科排名
書目名稱Description Logic, Theory Combination, and All That讀者反饋
書目名稱Description Logic, Theory Combination, and All That讀者反饋學(xué)科排名
作者: 舞蹈編排 時(shí)間: 2025-3-21 20:20
Conference proceedings 1987Latest editionhe important notion of concurrency, we also consider interleaving..We present results from the formal language literature which have immediate bearing on the complexity of DL-like reasoning tasks. However, we also focus on succinctness of representation, and on expressive power, issues first studied作者: output 時(shí)間: 2025-3-22 02:31 作者: 磨坊 時(shí)間: 2025-3-22 06:06
https://doi.org/10.1007/978-3-642-76510-0 algorithm relies completely on classical entailment checks and shows that the computational complexity of reasoning over defeasible ontologies is no worse than that of the underlying classical?.. Before concluding, we take a brief tour of some existing work on defeasible extensions of?.?that go bey作者: LEVY 時(shí)間: 2025-3-22 11:35
Fibrinklebung in der Otorhinolaryngologieeer by relying only on the query answering service available at the queried peer and at the other peer. We show both a positive and a negative result. Namely, we first prove that a solution to this problem always exists when the ontology is specified in ., and we provide an algorithm to compute it. 作者: 多余 時(shí)間: 2025-3-22 15:02 作者: 多余 時(shí)間: 2025-3-22 17:30 作者: 安慰 時(shí)間: 2025-3-22 23:01 作者: 注視 時(shí)間: 2025-3-23 03:18 作者: 鍵琴 時(shí)間: 2025-3-23 05:37
Initial Steps Towards a Family of Regular-Like Plan Description Logics,he important notion of concurrency, we also consider interleaving..We present results from the formal language literature which have immediate bearing on the complexity of DL-like reasoning tasks. However, we also focus on succinctness of representation, and on expressive power, issues first studied作者: 相互影響 時(shí)間: 2025-3-23 13:46
Reasoning with Justifiable Exceptions in , Contextualized Knowledge Repositories, basic description logic .. We provide a formalization of . CKRs with global defeasible axioms and study their semantic and computational properties. Moreover, we present a translation of CKRs to datalog programs under the answer set semantics for instance checking.作者: 解脫 時(shí)間: 2025-3-23 15:31 作者: Enteropathic 時(shí)間: 2025-3-23 20:54 作者: Cleave 時(shí)間: 2025-3-24 00:41 作者: expdient 時(shí)間: 2025-3-24 05:01
Provenance Analysis: A Perspective for Description Logics?,proach has also been applied to fragments of first-order logics such as modal and guarded logics. In this paper, we explore the question whether, and to what extent, the provenance approach might be useful in the field of description logics.作者: NOVA 時(shí)間: 2025-3-24 09:14 作者: 施加 時(shí)間: 2025-3-24 14:38 作者: ordain 時(shí)間: 2025-3-24 17:55
Situation Calculus Meets Description Logics,ity, the expressiveness of the base logic had to be restricted, and using a Description Logic was a natural choice. In this chapter, we highlight some of the main results and insights obtained during our collaboration.作者: Collision 時(shí)間: 2025-3-24 21:02
Checking the Data Complexity of Ontology-Mediated Queries: A Case Study with Non-uniform CSPs and Pingle covering axiom ., possibly supplemented with a disjointness axiom for . and .. The ultimate aim is to classify such OMQs according to their data complexity: ., L, NL, P or .. We report on our experience with trying to distinguish between OMQs in P and . using the reduction to CSPs and the Polyanna software for finding polymorphisms.作者: 直覺好 時(shí)間: 2025-3-25 02:00 作者: CHURL 時(shí)間: 2025-3-25 06:47
Book 2019ding? description logics,? term rewriting, and the combination of decision procedures.? We? hope that readers will enjoy the articles gathered in Franz‘s honour and appreciate the breadth and depth of his favourite areas of computer science..作者: 清晰 時(shí)間: 2025-3-25 08:03
H.-J. Koubenec,G. Hintz,F. Christitted from his collaboration and mentoring. Our selection is not intended to be complete and it is in fact strongly biased by our own personal experience and preferences. Many of Franz’s contributions that we had to leave out are discussed in later chapters of this volume.作者: 不適 時(shí)間: 2025-3-25 13:25
Applikationstechniken bei der Fibrinklebungnformation can never invalidate former conclusions. However, for nonmonotonic logics the concept simply makes no sense. In this paper, we introduce a different notion, called strong explanation. Strong explanations coincide with the standard notion for monotonic logics, but also handle the nonmonotonic case adequately.作者: Nibble 時(shí)間: 2025-3-25 17:37 作者: 潛伏期 時(shí)間: 2025-3-25 23:46 作者: 暴露他抗議 時(shí)間: 2025-3-26 01:09
Strong Explanations for Nonmonotonic Reasoning,nformation can never invalidate former conclusions. However, for nonmonotonic logics the concept simply makes no sense. In this paper, we introduce a different notion, called strong explanation. Strong explanations coincide with the standard notion for monotonic logics, but also handle the nonmonotonic case adequately.作者: 等級(jí)的上升 時(shí)間: 2025-3-26 08:09 作者: nonradioactive 時(shí)間: 2025-3-26 08:35 作者: 蓋他為秘密 時(shí)間: 2025-3-26 15:52 作者: cravat 時(shí)間: 2025-3-26 17:26
Duraverletzungen der Frontobasisity, the expressiveness of the base logic had to be restricted, and using a Description Logic was a natural choice. In this chapter, we highlight some of the main results and insights obtained during our collaboration.作者: COWER 時(shí)間: 2025-3-26 21:39 作者: optional 時(shí)間: 2025-3-27 03:36
https://doi.org/10.1007/978-3-642-70785-8ptual context and its integration into a new process model for cognitive hierarchies. Several simple instantiations of a cognitive hierarchy are used to illustrate the role of context. Notably, we demonstrate the use context in a novel approach to visually track the pose of rigid objects with just a 2D camera.作者: 浪費(fèi)物質(zhì) 時(shí)間: 2025-3-27 08:54 作者: FIS 時(shí)間: 2025-3-27 11:38 作者: Charade 時(shí)間: 2025-3-27 16:22
Diskussion — Pr?prothetische Chirurgieterprets . axioms in terms of their translation into first order sentences, so that the semantics of TEL is eventually used in the background. The resulting formalism conservatively extends TEL, hybrid theories and .-LTL as particular cases.作者: PRE 時(shí)間: 2025-3-27 21:42
Hierarchic Superposition Revisited, and provide two new completeness results: one for the fragment where all background-sorted terms are ground and another one for a special case of linear (integer or rational) arithmetic as a background theory.作者: 合適 時(shí)間: 2025-3-28 00:06
Theory Combination: Beyond Equality Sharing,d equality sharing, including: . extensions of equality sharing, where some theories are unrestricted, while others must satisfy stronger requirements than stable infiniteness; . decision procedures; and current work on . (CDSAT).作者: 文藝 時(shí)間: 2025-3-28 05:11 作者: 安心地散步 時(shí)間: 2025-3-28 09:47 作者: 前面 時(shí)間: 2025-3-28 13:56 作者: 翅膀拍動(dòng) 時(shí)間: 2025-3-28 18:23
Book 2019 contributions. The 30 papers in this volume cover several scientific areas that Franz Baader has been working on during the last three decades, including? description logics,? term rewriting, and the combination of decision procedures.? We? hope that readers will enjoy the articles gathered in Fran作者: 惰性氣體 時(shí)間: 2025-3-28 21:41
,A Tour of Franz Baader’s Contributions to Knowledge Representation and Automated Deduction,undamental and highly influential scientific contributions. We start with a brief and personal overview of Franz’s career, listing some important collaborators, places, and scientific milestones, and then provide first person accounts of how each one of us came in contact with Franz and how we benef作者: 善變 時(shí)間: 2025-3-29 01:18 作者: indices 時(shí)間: 2025-3-29 04:46
Theory Combination: Beyond Equality Sharing,n some first-order theories or fragments thereof (e.g., the quantifier-free fragment). . is the problem of determining whether a quantifier-free formula admits a model that is a model of a given theory. If the formula mixes theories, the considered theory is their union, and . is the problem of comb作者: habitat 時(shí)間: 2025-3-29 10:19
Initial Steps Towards a Family of Regular-Like Plan Description Logics,es, yielding an array of complexity results. Representation and reasoning with plans is a very important topic in AI, yet there has been very little work on finding and studying DL constructors for plan concepts..We start to remedy this problem here by considering Plan DLs where concept instances ar作者: 費(fèi)解 時(shí)間: 2025-3-29 12:12 作者: Prostaglandins 時(shí)間: 2025-3-29 17:07
Strong Explanations for Nonmonotonic Reasoning,his context are minimal subsets of the knowledge base entailing a certain formula. Such subsets are often referred to as justifications, and their identification is called axiom pinpointing.As observed by Franz Baader, this concept of explanations is useful for monotonic logics in which additional i作者: MEEK 時(shí)間: 2025-3-29 20:13
A KLM Perspective on Defeasible Reasoning for Description Logics,Lehmann and Magidor (KLM) on defeasible conditionals in the propositional case. We consider versions of a preferential semantics for two forms of defeasible subsumption, and link these semantic constructions formally to KLM-style syntactic properties via representation results. In addition to showin作者: Climate 時(shí)間: 2025-3-30 01:32
Temporal Logic Programs with Temporal Description Logic Axioms,is using connectives from Linear-time Temporal Logic (LTL). On the one hand, for the temporal extension of ., we depart from Baader et al.’s proposal .-LTL that restricts the use of temporal operators to occur only in front of DL axioms. On the other hand, for the temporal extension of ASP we use it作者: itinerary 時(shí)間: 2025-3-30 04:31
The What-To-Ask Problem for Ontology-Based Peers,c Web and in several other networked environments, including data integration, Peer-to-Peer and Grid computing, service-oriented computing, distributed agent systems, and collaborative data sharing. One of the main problems arising in such contexts is how to exploit the mappings between peers in ord作者: 寬容 時(shí)間: 2025-3-30 10:48 作者: Generator 時(shí)間: 2025-3-30 12:37
Situation Calculus Meets Description Logics,an action programming language, whose semantics is based on the Situation Calculus, a variant of full first-order logic. In order to achieve decidability, the expressiveness of the base logic had to be restricted, and using a Description Logic was a natural choice. In this chapter, we highlight some作者: 健談的人 時(shí)間: 2025-3-30 19:24 作者: 莎草 時(shí)間: 2025-3-30 23:47
Extending , with Linear Constraints on the Probability of Axioms,ding consistency and inferring subsumption. However, simply by adding negation of concepts to it, we obtain the expressivity of description logics whose decision procedure is .-complete. Similar complexity explosion occurs if we add probability assignments on concepts. To lower the resulting complex作者: 象形文字 時(shí)間: 2025-3-31 02:43 作者: 阻塞 時(shí)間: 2025-3-31 08:07
Checking the Data Complexity of Ontology-Mediated Queries: A Case Study with Non-uniform CSPs and Pn . using a reduction to CSPs. In this paper, we present a case study for OMQs with Boolean conjunctive queries and a fixed ontology consisting of a single covering axiom ., possibly supplemented with a disjointness axiom for . and .. The ultimate aim is to classify such OMQs according to their data作者: BOLUS 時(shí)間: 2025-3-31 12:09
Perceptual Context in Cognitive Hierarchies,gher level information that helps to predict belief states at lower levels. The main contribution of this paper is to provide a formalisation of perceptual context and its integration into a new process model for cognitive hierarchies. Several simple instantiations of a cognitive hierarchy are used 作者: 憤世嫉俗者 時(shí)間: 2025-3-31 16:47
Pseudo-contractions as Gentle Repairs,n such a way that the sentence to be removed is no longer entailed by the resulting set. On the other hand, it is desirable that the existing knowledge be preserved as much as possible, minimising the loss of information. Several approaches to this problem can be found in the literature. In particul作者: carotid-bruit 時(shí)間: 2025-3-31 19:40
FunDL,ture of these logics is their use of path functional dependencies that allow for complex identification constraints to be formulated. The use of features and path functional dependencies makes the logics particularly well suited for capturing and integrating data sources conforming to an underlying 作者: osteocytes 時(shí)間: 2025-3-31 22:42 作者: 抱怨 時(shí)間: 2025-4-1 05:48 作者: 誘使 時(shí)間: 2025-4-1 07:25 作者: Cursory 時(shí)間: 2025-4-1 13:35 作者: agonist 時(shí)間: 2025-4-1 16:37 作者: 抗原 時(shí)間: 2025-4-1 19:41
F. Kubli,W. Schmidt,J. Gauwerkyn some first-order theories or fragments thereof (e.g., the quantifier-free fragment). . is the problem of determining whether a quantifier-free formula admits a model that is a model of a given theory. If the formula mixes theories, the considered theory is their union, and . is the problem of comb作者: malign 時(shí)間: 2025-4-1 23:53
Conference proceedings 1987Latest editiones, yielding an array of complexity results. Representation and reasoning with plans is a very important topic in AI, yet there has been very little work on finding and studying DL constructors for plan concepts..We start to remedy this problem here by considering Plan DLs where concept instances ar作者: 多嘴多舌 時(shí)間: 2025-4-2 05:16 作者: yohimbine 時(shí)間: 2025-4-2 09:37 作者: Thyroiditis 時(shí)間: 2025-4-2 12:14
