標題: Titlebook: Logics in Artificial Intelligence; 14th European Confer Eduardo Fermé,Jo?o Leite Conference proceedings 2014 Springer International Publish [打印本頁] 作者: Guffaw 時間: 2025-3-21 18:04
書目名稱Logics in Artificial Intelligence影響因子(影響力)
書目名稱Logics in Artificial Intelligence影響因子(影響力)學科排名
書目名稱Logics in Artificial Intelligence網(wǎng)絡(luò)公開度
書目名稱Logics in Artificial Intelligence網(wǎng)絡(luò)公開度學科排名
書目名稱Logics in Artificial Intelligence被引頻次
書目名稱Logics in Artificial Intelligence被引頻次學科排名
書目名稱Logics in Artificial Intelligence年度引用
書目名稱Logics in Artificial Intelligence年度引用學科排名
書目名稱Logics in Artificial Intelligence讀者反饋
書目名稱Logics in Artificial Intelligence讀者反饋學科排名
作者: rheumatology 時間: 2025-3-21 21:35
Non-classical Planning with a Classical Planner: The Power of Transformationsving given goals. The main challenges in planning are computational as all models, whether featuring uncertainty and feedback or not, are intractable in the worst case when represented in compact form. Classical planning refers to the simplest form of planning where goals are to be achieved by apply作者: ARENA 時間: 2025-3-22 01:47 作者: 猛然一拉 時間: 2025-3-22 07:52 作者: 單調(diào)性 時間: 2025-3-22 12:48
Tight Complexity Bounds for Reasoning in the Description Logic $mathcal{BE{kern-.1em}L}$depends on an uncertain context. In this paper we introduce a novel structure, called ., that encodes the contextual information required to deduce subsumption relations from a . knowledge base. Using this structure, we show that probabilistic reasoning in . can be reduced in polynomial time to stan作者: DAMN 時間: 2025-3-22 15:21
Relevant Closure: A New Form of Defeasible Reasoning for Description Logics turns out to have a number of desirable properties. Not only it is computationally feasible, but it can also be implemented using existing classical reasoners. One of its drawbacks is that it can be seen as too weak from the inferential point of view. To overcome this limitation we introduce in thi作者: Enthralling 時間: 2025-3-22 17:59
Error-Tolerant Reasoning in the Description Logic $mathcal{E{kern-.1em}L}$a corrected version of the ontology is available. In the meantime, one might still want to derive meaningful knowledge from the ontology, while avoiding the known errors. We study error-tolerant reasoning tasks in the description logic .. While these problems are intractable, we propose methods for 作者: STRIA 時間: 2025-3-23 00:02 作者: deciduous 時間: 2025-3-23 02:48 作者: 老巫婆 時間: 2025-3-23 05:52
Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Formased on an encoding of the input formula as a new one whose models correspond to the set of prime implicants of the original theory. This first PI enumeration approach is then enhanced by an original use of the boolean functions or gates usually involved in many CNF instances encoding real-world pro作者: 爵士樂 時間: 2025-3-23 11:02
Improving the Normalization of Weight Rules in Answer Set Programsck into normal rules, e.g., for the sake of boosting the search for answers sets. For instance, the normalization of cardinality rules can be based on Boolean circuits that effectively sort or select greatest elements amongst Boolean values. In this paper, we develop further constructions for the no作者: 香料 時間: 2025-3-23 14:40
Logical Foundations of Possibilistic Keysy assigning to tuples of data a degree of possibility with which they occur in a relation, and assigning to keys a degree of certainty which says to which tuples the key applies. The associated implication problem is characterized axiomatically and algorithmically. It is shown how sets of possibilis作者: 小教堂 時間: 2025-3-23 18:31
Possibilistic Boolean Games: Strategic Reasoning under Incomplete Informationhow this framework can be naturally extended to model situations in which agents are uncertain about other agents’ goals. We first use uncertainty measures from possibility theory to semantically define (solution concepts to) Boolean games with incomplete information. Then we present a syntactic cha作者: defibrillator 時間: 2025-3-23 22:36
LEG Networks for Ranking Functions Therefore, network-based approaches that decompose the semantical space have proven to be fruitful in environments with probabilistic information. For applications where a more qualitative information is preferable to quantitative information, ordinal conditional functions (OCF) offer a convenient 作者: Carcinogenesis 時間: 2025-3-24 03:30 作者: 畢業(yè)典禮 時間: 2025-3-24 07:57 作者: ARK 時間: 2025-3-24 11:16 作者: 無法取消 時間: 2025-3-24 18:13
On the Expressiveness of the Interval Logic of Allen’s Relations Over Finite and Discrete Linear Ordl logics is Halpern and Shoham’s modal logic of time intervals HS, which associates a modal operator with each binary relation between intervals over a linear order (the so-called Allen’s interval relations). A complete classification of all HS fragments with respect to their relative expressive pow作者: Subjugate 時間: 2025-3-24 21:26
matography-tandem mass spectrometry. Among the raw and cooked foods tested, γ-Glu-Val-Gly was detected and quantified in raw and dried scallops at 0.26 and 2.5 μmole/kg, respectively. Cooked king prawns were previously reported to contain γ-Glu-Val-Gly at 0.60 μmole/kg. This peptide was present at h作者: Condense 時間: 2025-3-25 00:59 作者: Flustered 時間: 2025-3-25 03:47 作者: MAL 時間: 2025-3-25 10:45
Hector Geffnergnated as the thickness of taste, complexity, continuity of flavor, and mouthfulness. The present chapter describes the fractionation and identification of the compounds responsible for enhancing the thickness of taste, mouthfulness, and continuity of flavor. The results of fractionation and sensory作者: 壁畫 時間: 2025-3-25 14:39 作者: 不可知論 時間: 2025-3-25 17:20
Stefan Borgwardt,José A. Leyva Galano,Rafael Pe?alozam Kraftmittel (Dampf, Gas, Druckluft, Druckwasser usw.) bewegt, die Kolben der Arbeitsmaschinen wirken gegen die im Zylinder eingeschlossenen tropfbaren oder gasf?rmigen Flüssigkeiten. Sind beide Seiten des Kolbens dem wechselnden Drucke des arbeitenden oder zu bewegenden Stoffes ausgesetzt, so ist 作者: aggressor 時間: 2025-3-25 21:28 作者: Instrumental 時間: 2025-3-26 00:31
Giovanni Casini,Thomas Meyer,Kodylan Moodley,Riku Nortjéstigkeit durch FEM.Includes supplementary material: Die immer weiter steigenden Anforderungen an Verbrennungsmotoren machen auch vor dessen Herzstück – dem Kolben – nicht Halt. Für weniger Gewicht, Reibung oder auch noch mehr Verschlei?festigkeit sind tiefe Kenntnisse über die innermotorischen Proze作者: Cabinet 時間: 2025-3-26 07:00
Tools for the Investigation of Substructural and Paraconsistent LogicsWe present an overview of the methods in [10,7,13] and their implementation in the system .. This system introduces analytic calculi for large classes of substructural and paraconsistent logics, which it then uses to prove various results about the formalized logics.作者: 不易燃 時間: 2025-3-26 09:57 作者: 雪崩 時間: 2025-3-26 15:43
The Fuzzy Description Logic $mathsf{G} ext{-}{mathcal{F!L}_0} $ with Greatest Fixed-Point Semanticsitive definitions, using greatest fixed-point semantics, can be characterized by a relation on weighted automata. We use this result to provide tight complexity bounds for reasoning in this logic, showing that it is .-complete. If the definitions do not contain cycles, subsumption becomes .-complete.作者: Gourmet 時間: 2025-3-26 20:08
Efficient Program Transformers for Translating , to ,Change. Our proposal uses an elegant matrix treatment of Brzozowski’s equational method instead of Kleene’s translation from finite automata to regular expressions. The two alternatives are shown to be equivalent, with Brzozowski’s method having the advantage of being computationally more efficient.作者: enchant 時間: 2025-3-27 00:03 作者: Explosive 時間: 2025-3-27 02:38 作者: 貴族 時間: 2025-3-27 07:23 作者: 要塞 時間: 2025-3-27 09:35 作者: morale 時間: 2025-3-27 16:17
Diego Calvaneseto foods although they were tasteless at the concentration tested are referred to kokumi substances. In this chapter, the actions of smell (odor)-related koku-enhancing substances are introduced. Phthtalide compounds identified in celery were reported to enhance the thick and lasting flavors when ad作者: 乞丐 時間: 2025-3-27 21:06 作者: 使閉塞 時間: 2025-3-28 00:25 作者: 使困惑 時間: 2025-3-28 03:27 作者: Diastole 時間: 2025-3-28 06:59
Stefan Borgwardt,José A. Leyva Galano,Rafael Pe?alozaolben, Rohrkolben (auch Taucherkolben, Plunger), Ventilkolben und Stufenkolben. Bei den Kolben der ersten Art ist die Kolbenl?nge geringer als der Durchmesser, bei den Kolben der zweiten Art ist der Kolben l?nger als der Durchmesser, der Kolben hat die Form eines Rohres..) Die ?Ventilkolben“, auch d作者: acrobat 時間: 2025-3-28 12:36
?smail ?lkan Ceylan,Rafael Pe?alozaiten Auflage wurden alle Kapitel überarbeitet und erweitert. Das Kapitel "Motorische Erprobung" wurde beispielsweise um umfangreiche Ergebnisse zum Thema Reibleistungsmessungen und ?lverbrauchsmessungen erg?nzt.978-3-658-09558-1Series ISSN 2628-104X Series E-ISSN 2628-1058 作者: 初學者 時間: 2025-3-28 17:02 作者: Engulf 時間: 2025-3-28 19:55
Query Answering over Description Logic Ontologieseveloped. We overview here some of the key techniques developed in the last years for query answering over DL ontologies, ranging from rewriting based approaches for lightweight DLs, to tableaux algorithms, and techniques based on automata on infinite trees for very expressive DLs. The associated re作者: 爭吵 時間: 2025-3-28 23:54
Relevant Closure: A New Form of Defeasible Reasoning for Description Logicsthe area of ontology debugging. Both Basic and Minimal Relevant Closure increase the inferential power of Rational Closure, giving back intuitive conclusions that cannot be obtained from Rational Closure. We analyse the properties and present algorithms for both Basic and Minimal Relevant Closure, a作者: Liability 時間: 2025-3-29 03:47
LEG Networks for Ranking Functionss can be built for any conditional knowledge base and filled by local OCF that can be found by inductive reasoning. A global OCF is set up from the local ones, and it is shown that the global OCF is admissible with respect to the underlying knowledge base.作者: 寬大 時間: 2025-3-29 08:07
On the Expressiveness of the Interval Logic of Allen’s Relations Over Finite and Discrete Linear Ordders; then, we provide a complete set of definabilities for the HS modalities corresponding to the Allen’s relations ., ., ., ., and ., as well as the ones corresponding to their inverse relations. The only missing cases are those of the relations . and ..作者: 流動才波動 時間: 2025-3-29 13:57
Davide Bresolin,Emilio Mu?oz-Velasco,Guido Sciavicco作者: 江湖騙子 時間: 2025-3-29 16:23 作者: 男學院 時間: 2025-3-29 22:00
Henning Koehler,Uwe Leck,Sebastian Link,Henri Prade作者: perpetual 時間: 2025-3-30 00:45 作者: 撫育 時間: 2025-3-30 06:03
Tran Cao Son,Enrico Pontelli,Chitta Baral,Gregory Gelfond作者: 過去分詞 時間: 2025-3-30 12:06 作者: Anticoagulants 時間: 2025-3-30 15:21 作者: conduct 時間: 2025-3-30 18:10
Non-classical Planning with a Classical Planner: The Power of Transformationsle them to deal with large problems, and the transformations that have been developed for using these planners to deal with non-classical features such as soft goals, hidden goals to be recognized, planning with incomplete information and sensing, and multiagent nested beliefs.作者: 發(fā)微光 時間: 2025-3-30 21:28
Opportunities for Argument-Centric Persuasion in Behaviour Changement, there is the opportunity for argument-centric persuasion in behaviour change. In this paper, key requirements for this will be presented, together with some discussion of how computational models of argumentation can be harnessed.作者: promote 時間: 2025-3-31 02:11 作者: 索賠 時間: 2025-3-31 08:44
SAT Modulo Graphs: Acyclicityw that all existing encodings of acyclicity constraints in SAT are either prohibitively large or do not sanction all inferences made by the constraint propagator. Our experiments demonstrate the advantages of our solver over other approaches for handling acyclicity.作者: HIKE 時間: 2025-3-31 12:00 作者: ERUPT 時間: 2025-3-31 14:16
Logics for Approximating Implication Problems of Saturated Conditional Independenceed. The latter appeal to applications in which the existence of random variables is uncertain, for example, when statements are integrated from different sources, when random variables are unknown or when they shall remain hidden.作者: cartilage 時間: 2025-3-31 20:26
Tight Complexity Bounds for Reasoning in the Description Logic $mathcal{BE{kern-.1em}L}$bsumption relations from a . knowledge base. Using this structure, we show that probabilistic reasoning in . can be reduced in polynomial time to standard Bayesian network inferences, thus obtaining tight complexity bounds for reasoning in ..作者: 鳴叫 時間: 2025-4-1 00:14
Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Formmeration approach is then enhanced by an original use of the boolean functions or gates usually involved in many CNF instances encoding real-world problems. Experimental evaluation on several classes of CNF instances shows the feasibility of our proposed framework.作者: 大雨 時間: 2025-4-1 03:13
Possibilistic Boolean Games: Strategic Reasoning under Incomplete Informationsures from possibility theory to semantically define (solution concepts to) Boolean games with incomplete information. Then we present a syntactic characterization of these semantics, which can readily be implemented, and we characterize the computational complexity.作者: UNT 時間: 2025-4-1 08:34
Error-Tolerant Reasoning in the Description Logic $mathcal{E{kern-.1em}L}$improving the reasoning times by precompiling information about the known errors and using proof-theoretic techniques for computing justifications. A prototypical implementation shows that our approach is feasible for large ontologies used in practice.作者: 收養(yǎng) 時間: 2025-4-1 11:21
Logical Foundations of Possibilistic Keystic keys can be visualized as possibilistic Armstrong relations, and how they can be discovered from given possibilistic relations. It is also shown how possibilistic keys can be used to clean dirty data by revising the belief in possibility degrees of tuples.作者: cancer 時間: 2025-4-1 15:13
