標(biāo)題: Titlebook: Logics in AI; European Workshop JE D. Pearce,G. Wagner Conference proceedings 1992 Springer-Verlag Berlin Heidelberg 1992 Artificial intell [打印本頁] 作者: 小天使 時間: 2025-3-21 19:03
書目名稱Logics in AI影響因子(影響力)
書目名稱Logics in AI影響因子(影響力)學(xué)科排名
書目名稱Logics in AI網(wǎng)絡(luò)公開度
書目名稱Logics in AI網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Logics in AI被引頻次
書目名稱Logics in AI被引頻次學(xué)科排名
書目名稱Logics in AI年度引用
書目名稱Logics in AI年度引用學(xué)科排名
書目名稱Logics in AI讀者反饋
書目名稱Logics in AI讀者反饋學(xué)科排名
作者: 終止 時間: 2025-3-21 22:30 作者: 勤勉 時間: 2025-3-22 00:47 作者: compose 時間: 2025-3-22 08:36 作者: Morsel 時間: 2025-3-22 10:56 作者: 課程 時間: 2025-3-22 16:48 作者: GEON 時間: 2025-3-22 17:25 作者: BIAS 時間: 2025-3-22 22:36
Tim Fernando mit den jeweiligen spezifischen Situationen zu korrelieren, um somit Koalitionsbildungen in den deutschen Bundesl?ndern vorwiegend unter theoretischen, parteiensystematischen und historischen Gesichtspunkten zu erfassen und zu subsumieren. Trotz der spezifischen Besonderheiten jeder einzelnen Koali作者: 悶熱 時間: 2025-3-23 02:12
Hans-Joachim Goltz günstigen ?u?eren Erscheinung, kein gutes Metall ergaben. ?Cobali“, ?Virunculi montani”, als Name für eine Art Berggnomen, kommt 1335 in einer Chronik von Leoben vor; vgl. . (. 1842, ., S. 407). In solchem Sinne — ?nomine daemonis“— erkl?rt beispielsweise CH. .. 1551, S. 33, 34) den Namen, der, wie作者: AVANT 時間: 2025-3-23 06:00
Nicolas Zabel günstigen ?u?eren Erscheinung, kein gutes Metall ergaben. ?Cobali“, ?Virunculi montani”, als Name für eine Art Berggnomen, kommt 1335 in einer Chronik von Leoben vor; vgl. . (. 1842, ., S. 407). In solchem Sinne — ?nomine daemonis“— erkl?rt beispielsweise CH. .. 1551, S. 33, 34) den Namen, der, wie作者: ALLAY 時間: 2025-3-23 11:24 作者: 放逐某人 時間: 2025-3-23 16:07 作者: Vaginismus 時間: 2025-3-23 21:45
Design complete sequential calculus for continuous fixpoint temporal logic,culus for temporal logic under consideration to finitary one. As result of the reduction we can prove completeness and obtain the cut-free sequential calculus for temporal logic under consideration. The reduction present some way for searching so called invariant formulas.作者: 闖入 時間: 2025-3-24 01:08
Logical omniscience and classical logic,ordinary language syntactically different expressions in general are not intersubstitutable in the scope of verbs of propositional attitude. It thus seems that logics of knowledge and belief should not be subject to Leibniz‘s Law. In the literature (e.g. Rantala [1982., 1982.], Wansing [1990]) we in作者: 討好美人 時間: 2025-3-24 02:53
Weak implication: Theory and applications,nt a sound and complete set of deduction rules for weak implications..The notion of weak implication was introduced for the sake of a formal specification of a . system. Other practical . of can be found in the realm of relational database theory: query normalization and integrity constraints in the作者: PANT 時間: 2025-3-24 10:35
Deriving inference rules for terminological logics,oretical investigations with issues arising in the actual implementation of terminological representation systems. We propose to use inference rules, derived via the sequent calculus, as a new method for specifying terminological inference algorithms. This approach combines the advantages of the tab作者: Ovulation 時間: 2025-3-24 12:17
Linear proofs and linear logic,spired by this idea in [7] a similar approach based on Linear Logic was presented. The present paper analyses the relationship of these two approaches and shows to which extent they are equivalent and where they differ.作者: 旅行路線 時間: 2025-3-24 17:25
Modellings for belief change: Base contraction, multiple contraction, and epistemic entrenchment (py syntax-based belief changes that are governed exclusively by the structure of the belief base. In answering the question whether this kind of belief change can be reconstructed with the help of something like an epistemic entrenchment relation in the sense of G?rdenfors and Makinson [8], we extrac作者: exhilaration 時間: 2025-3-24 21:34
A framework for default logics,iants from a knowledge representation point of view. We then exploit this framework to generalize Brewka‘s work on cumulative default logic, and to give an operational definition of extensions. Proof theoretical and semantical aspects are investigated.作者: anticipate 時間: 2025-3-24 23:28 作者: esculent 時間: 2025-3-25 06:29
Reasoning with defeasible arguments: Examples and applications,o, we introduce a simple formalism, called abstract argumentation system, with which we discuss different methods for raising arguments: forward reasoning, backward reasoning and, in particular, . thereof. Resource bounded defeasible reasoning is also briefly dealt with (the prefix ‘defeasible’ is e作者: Monocle 時間: 2025-3-25 11:21 作者: Gourmet 時間: 2025-3-25 13:17
Transition systems and dynamic semantics,ic semantics (more specifically, DPL, DRT and Update logic). Going the other direction, first-order models are extracted from transition systems, bringing full circle the connection between static and dynamic notions. Only states computationally accessible from an initial state (with minimal informa作者: Relinquish 時間: 2025-3-25 19:25 作者: 個人長篇演說 時間: 2025-3-25 23:28 作者: Talkative 時間: 2025-3-26 03:22 作者: 兒童 時間: 2025-3-26 08:16 作者: syncope 時間: 2025-3-26 12:06
An efficient constraint language for polymorphic order-sorted resolution,nt a polymorphic order-sorted logic that can be implemented efficiently. Because the polymorphism is almost unrestricted, it is possible for two terms to have an exponential number of maximally general unifiers. To guarantee a single most general unifier, we embed the sorted logic into a more genera作者: 不能逃避 時間: 2025-3-26 16:03
Relevance and revision,This paper proposes a syntax-based revision-procedure for belief sets structured by an arbitrary relevance pre-ordcr and an elementary epistemic dependency relation and investigates the consequences for the Gaerdenforsian rationality postulates. In particular, it generalizes Nebel‘s epistemic relevance revision.作者: Obligatory 時間: 2025-3-26 18:13
https://doi.org/10.1007/BFb0023417Artificial intelligence; Automat; automated theorem proving; intelligence; knowledge; knowledge-based sys作者: 微塵 時間: 2025-3-26 23:02 作者: 清楚說話 時間: 2025-3-27 04:30
Weak implication: Theory and applications,nt a sound and complete set of deduction rules for weak implications..The notion of weak implication was introduced for the sake of a formal specification of a . system. Other practical . of can be found in the realm of relational database theory: query normalization and integrity constraints in the context of views.作者: 憤憤不平 時間: 2025-3-27 07:55 作者: 狂怒 時間: 2025-3-27 09:43
A framework for default logics,iants from a knowledge representation point of view. We then exploit this framework to generalize Brewka‘s work on cumulative default logic, and to give an operational definition of extensions. Proof theoretical and semantical aspects are investigated.作者: 謙卑 時間: 2025-3-27 16:19 作者: chemical-peel 時間: 2025-3-27 18:47 作者: Allege 時間: 2025-3-28 00:14 作者: 散開 時間: 2025-3-28 04:45 作者: puzzle 時間: 2025-3-28 10:05 作者: Thymus 時間: 2025-3-28 12:58 作者: 指耕作 時間: 2025-3-28 15:24 作者: 冷淡一切 時間: 2025-3-28 19:52
tionen gegenüber denen der Arbeitgeber hervortreten, weil diese, wie es die wirtschaftlich st?rkere Stellung ihrer Mitglieder mit sich bringt, immer erst als Gegenwirkung vorher gebildeter Arbeitnehmerorganisationen entstanden sind. Die Erkenntnis der deutschen Entwicklung erfordert, auch auf die Ge作者: jet-lag 時間: 2025-3-28 23:26 作者: Cleave 時間: 2025-3-29 05:31 作者: Locale 時間: 2025-3-29 09:22
Christine Froidevaux,Jér?me Menginbeispielen in einem Fazit vergleichen und ausgewertet. Dabei wird ein besonderer Fokus auf die Pr?ferenzen und die innerparlamentarische Vernetzung der an der jeweiligen Mehrheitsbildung beteiligten Abgeordneten gelegt. Die Analyse der Ausschussarbeit liefert einen wertvollen Einblick in die Binnens作者: Impugn 時間: 2025-3-29 14:09 作者: Vulnerable 時間: 2025-3-29 18:36
Gerard Vreeswijktigkeit haben sollten. In spieltheoretisch modellhaft simulierten Situationen sollten Verhaltenskonstanten ermittelt werden, die die Koalitionsentscheidung der beteiligten Akteure entscheidend beeinflussen. Es galt also Faktoren zu ermitteln, die unter wiederkehrenden externen und internen Situation作者: Digest 時間: 2025-3-29 19:52
Ph. Besnard,E. Grégoiretionserfahrungen, Koalitionsaussagen, ihr jeweiliger innerparteilicher Koh?sionsgrad und das Ausma?, in welchem das Parteiensystem die Stabilit?t der Exekutive sichert. Gezeigt werden konnte durchgehend, da? mit dem parteiensystematischen Ansatz Koalitionsbildungen erkl?rt werden k?nnen. Aus der Str作者: Corral 時間: 2025-3-30 02:49 作者: 生命 時間: 2025-3-30 06:07
Hans-Joachim Goltzxer” K?rper sei, sondern mit Metallen flüchtige Verbb. gebe: ?meliora metalla secum per fumum abducit“. M. . (1. c. S. 271) sagt im deutschen Text: ?Cobolt ist ein schwartz, etwan ein wenig Aschfarb Ertz, da? sich h?mmern unnd giessen l?st, hat aber kein metallischen Glantz, ist ein raubendt Schwebe作者: somnambulism 時間: 2025-3-30 09:08 作者: 可互換 時間: 2025-3-30 13:13 作者: CRUE 時間: 2025-3-30 20:08
,Tableau-based theorem proving and synthesis of λ-terms in the intuitionistic logic,ction calculus, our calculus is very appropriate for automatic reasoning. We implemented the calculus in Prolog. A strategy which is similar to model elimination has been built in. Several formulas (including program synthesis problems) have been proven automatically.作者: Glaci冰 時間: 2025-3-30 23:04 作者: floaters 時間: 2025-3-31 03:26 作者: assent 時間: 2025-3-31 07:28 作者: debase 時間: 2025-3-31 10:41
Reasoning with defeasible arguments: Examples and applications,ning, backward reasoning and, in particular, . thereof. Resource bounded defeasible reasoning is also briefly dealt with (the prefix ‘defeasible’ is essential here). The main goal of this paper is not to tell how this should be done, but to show how these simple procedures suddenly may change in the context of defeasible argumentation.作者: Discrete 時間: 2025-3-31 17:09
About deductive generalization,s, which can be checked in an efficient way, also prove useful when satisfied since they sometimes allow one to prune the space of potential generalizations. Departing from a standard logical framework, we then show how an intuitionistic account of deductive generalization relaxes those conditions to make them more natural.作者: 親屬 時間: 2025-3-31 17:56
Transition systems and dynamic semantics,ging full circle the connection between static and dynamic notions. Only states computationally accessible from an initial state (with minimal information content) are considered, motivating the introduction of an internal notion of proposition on which the concept of an update is analyzed.作者: 從容 時間: 2025-3-31 23:40
A modal theory of arrows. Arrow logics I, setting different properties of arrow structures. Several kinds of completeness theorems for BAL and some other arrow logics are proved, including completeness with respect to classes of finite models. And the end some open problems and possibilities for further development of the “arrow” approach are formulated.作者: 警告 時間: 2025-4-1 04:57
Knowledge without modality: A simplified framework for chronological ignorance,tation found in Shoham‘s approach without sacrificing the truth functional semantics and proof theory of classical logic. We demonstrate the utility of the logic by providing an equivalent nonmodal CI framework for causal theories.作者: Mammal 時間: 2025-4-1 06:44
A conceptualization of preferences in non-monotonic proof theory,non-monotonic reasoning, and for identifying new approaches. For this we introduce the family of prioritized logics — each member being a defeasible logic defined in terms of labelled deduction -that forms the basis of a framework for viewing the nature and mechanization of non-monotonic reasoning.作者: Foment 時間: 2025-4-1 11:20
Declarative semantics for inconsistent database programs,come from different, equally trusted sources and proposes mechanism telling one how to act when the primitive inconsistency arises..A characterization of the semantics for the proposed literal database programs is given by means of general properties of non-monotonic inference operations. Some points for future considerations are also announced.作者: 悠然 時間: 2025-4-1 16:55
An efficient constraint language for polymorphic order-sorted resolution,litates many optimizations. The main complexity gains are that the unnecessary generation of unifiers can be avoided and that the primary resolution search space remains constant if the complexity of the unification grows.作者: Communal 時間: 2025-4-1 21:58 作者: eczema 時間: 2025-4-1 23:46
Book 2007matiques depuis leurs fondements....Ce cinquième chaptire du Livre d’Intégration, sixième Livre des éléments de mathématique, traite notamment d’une generalisation du théorème des Lebesgue-Fubini et du théorème de Lebesque-Nikodym....Il contient également des notes historiques...Ce volume est une ré
