標(biāo)題: Titlebook: Logics in Artificial Intelligence; European Workshop JE Craig MacNish,David Pearce,Luís Moniz Pereira Conference proceedings 1994 Springer- [打印本頁] 作者: 作業(yè) 時(shí)間: 2025-3-21 18:28
書目名稱Logics in Artificial Intelligence影響因子(影響力)
書目名稱Logics in Artificial Intelligence影響因子(影響力)學(xué)科排名
書目名稱Logics in Artificial Intelligence網(wǎng)絡(luò)公開度
書目名稱Logics in Artificial Intelligence網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Logics in Artificial Intelligence被引頻次
書目名稱Logics in Artificial Intelligence被引頻次學(xué)科排名
書目名稱Logics in Artificial Intelligence年度引用
書目名稱Logics in Artificial Intelligence年度引用學(xué)科排名
書目名稱Logics in Artificial Intelligence讀者反饋
書目名稱Logics in Artificial Intelligence讀者反饋學(xué)科排名
作者: MANIA 時(shí)間: 2025-3-22 00:17
Around a powerful property of circumscriptions, properties of circumscriptions can be considered as corollaries of reverse monotony. We introduce also a new property of circumscriptions, “disjunctive coherence”, which is not a consequence of reverse monotony.作者: Tdd526 時(shí)間: 2025-3-22 01:41 作者: 青春期 時(shí)間: 2025-3-22 06:40 作者: Bombast 時(shí)間: 2025-3-22 10:00
The computational value of joint consistency,emain intractable. We also present a propositional semantics for those approaches, stemming from the translation of the graph structures into propositional logic. Finally, the constraint stable model semantics is introduced, and proved to be related to the notion of joint consistency.作者: fetter 時(shí)間: 2025-3-22 14:25
Belief, provability, and logic programs,nt embeddings into autoepistemic logics of such programs under stable models based semantics..Furthermore, the language of the epistemic logic presented here being more general than that of extended programs, it offers a basic tool for further generalizations of the latter, for instance regarding disjunction and modal operators.作者: FEAT 時(shí)間: 2025-3-22 19:47 作者: AWL 時(shí)間: 2025-3-22 23:30 作者: 他去就結(jié)束 時(shí)間: 2025-3-23 04:04 作者: Dorsal 時(shí)間: 2025-3-23 06:27
,From Carnap’s modal logic to autoepistemic logic, possibility of deriving consequences from nonmodal theories and show that the resulting formalism is nonmonotonic. Finally, we explain the relationship between Carnap‘s logic and autoepistemic logic and show that autoepistemic reasoning corresponds to solving problems equivalent to (possibly cyclic) graphs of interdependent NP queries.作者: Inflated 時(shí)間: 2025-3-23 11:21
Revision of non-monotonic theories,ms using the stable model semantics..In particular, we present a strong expansion method which makes it possible to construct for an arbitrary (incoherent) normal logic program . a -classically- equivalent expanded program . such that . always has a stable model.作者: Deference 時(shí)間: 2025-3-23 17:02
Efficient strategies for Automated reasoning in modal logics,quirement. The strategies are proved to be complete for most of these logics. The results are presented for S4. The strategies have been implemented and extensively experimented in the tableaux theorem prover running on our Inference Laboratory ATINF. Experiments have shown the efficiency of some of the proposed strategies.作者: 捕鯨魚叉 時(shí)間: 2025-3-23 18:31 作者: indubitable 時(shí)間: 2025-3-23 23:39
Prioritized autoepistemic logic,that modify the semi-constructive definition of extensions of Reiter. Computationally the new priority notion can nevertheless be seen as a mechanism for pruning search trees in procedures for autoepistemic reasoning, as demonstrated by procedures given in the paper.作者: crucial 時(shí)間: 2025-3-24 04:10
Conference proceedings 1994apers presented were selected from a total of 79 submissions; in addition there are two abstracts of invited talks and one full paper of the invited presentation by Georg Gottlob. The papers point out that, with the depth and maturity of formalisms and methodologies available in AI today, logics pro作者: licence 時(shí)間: 2025-3-24 07:00 作者: exigent 時(shí)間: 2025-3-24 14:00
A complete connection calculus with rigid E-unification,ur general framework for building-in theories. We pose the problem whether for the construction of a complete goal-oriented prover with equality it is sufficient to be able to solve only a restricted version of the simultaneous rigid E-unification problem.作者: contradict 時(shí)間: 2025-3-24 15:03 作者: Infuriate 時(shí)間: 2025-3-24 21:26
https://doi.org/10.1007/BFb0021960Artificial intelligence; Automat; automated reasoning; intelligence; knowledge; knowledge representation; 作者: 一個(gè)姐姐 時(shí)間: 2025-3-25 02:58
978-3-540-58332-5Springer-Verlag Berlin Heidelberg 1994作者: 擦掉 時(shí)間: 2025-3-25 06:08
Logics in Artificial Intelligence978-3-540-48657-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 僵硬 時(shí)間: 2025-3-25 07:45
A unification of ordering refinements of resolution in classical logic,t can be described by rules of a certain type. It is also possible to obtain an ordered resolution calculus from a semantic tableau calculus. We apply this to classical logic to obtain simple proofs of the completeness of several refinements of resolution in classical logic.作者: ordain 時(shí)間: 2025-3-25 13:20
,From Carnap’s modal logic to autoepistemic logic,ed out that there are interesting connections between Carnap‘s modal logic and finite model theory for modal logics. In addition, Carnap‘s logic has applications in the field of epistemic reasoning. It was also shown that formulas of Carnap‘s logic are structurally equivalent to trees of NP queries,作者: implore 時(shí)間: 2025-3-25 18:29 作者: emission 時(shí)間: 2025-3-25 23:54 作者: 不知疲倦 時(shí)間: 2025-3-26 02:37 作者: compose 時(shí)間: 2025-3-26 04:57 作者: AFFIX 時(shí)間: 2025-3-26 08:29 作者: 中子 時(shí)間: 2025-3-26 14:53
Belief, provability, and logic programs, comparing a variety of known semantics for extended logic programs, and clarify their meaning. In particular we present here, for the first time, embeddings into epistemic logic of logic programs extended with a second kind of negation under the well-founded semantics, and contrast them to the rece作者: 規(guī)范要多 時(shí)間: 2025-3-26 18:05 作者: 裁決 時(shí)間: 2025-3-26 22:27 作者: GUMP 時(shí)間: 2025-3-27 02:36
A complete connection calculus with rigid E-unification,of total theory reasoning. In order to achieve a completeness result we combine results concerning the simultaneous rigid E-unification problem with our general framework for building-in theories. We pose the problem whether for the construction of a complete goal-oriented prover with equality it is作者: Gene408 時(shí)間: 2025-3-27 08:01
Equality and constrained resolution,These systems reason with a constraint logic in which the constraints are interpreted relative to a constraint theory. First, a special case is considered when equality can be treated as a constraint. Then the general case is dealt with by developing and proving correct the rule of constrained param作者: Gerontology 時(shí)間: 2025-3-27 10:37
Efficient strategies for Automated reasoning in modal logics,tegies are presented for the Fitting‘s tableaux calculi. Besides orderings of tableaux rules, different variants for backtracking are used. The strategies apply to most usual propositional modal logics: K, T, K4, S4, D, D4, C, CT, C4, CS4, CD, CD4, G. More precisely, they apply to logics for which t作者: 破裂 時(shí)間: 2025-3-27 15:04
TAS-D++: Syntactic trees transformations for Automated Theorem Proving,TAS-D., is introduced. The main objective in the design of this ATP was to obtain a parallel and computationally efficient method naturally extensible to non-standard logics (concretely, to temporal logics, see [8])..TAS-D. works by using transformations of the syntactic trees of the formulae and, a作者: cumulative 時(shí)間: 2025-3-27 18:36 作者: 協(xié)議 時(shí)間: 2025-3-27 23:53 作者: transient-pain 時(shí)間: 2025-3-28 04:45 作者: tenosynovitis 時(shí)間: 2025-3-28 07:54
Adding priorities and specificity to default logic,ificity principle, i.e. the commonly accepted idea that in case of a conflict more specific defaults should be preferred over more general ones, is lacking. In this paper we show how this principle can be added to Default Logic. We first present a prioritized version of DL for normal defaults, calle作者: languid 時(shí)間: 2025-3-28 12:44 作者: Accessible 時(shí)間: 2025-3-28 17:29
Chandrabose Aravindan,Phan Minh Dungdetect a patient’s changing motor status with a possible repetition every 10?s. MEPs, once confined to use in spine procedures, have expanded to procedures where rapid identification of central nervous system (CNS), spinal cord, and peripheral nerve motor function is critical for patient outcomes. P作者: aristocracy 時(shí)間: 2025-3-28 22:40 作者: 終止 時(shí)間: 2025-3-28 23:40 作者: 很是迷惑 時(shí)間: 2025-3-29 06:59 作者: obtuse 時(shí)間: 2025-3-29 10:12
Cees Witteveen,Wiebe van der Hoek,Hans de NivelleArt. Noch heute dienen Leuchttürme mit ihren Lichtsignalen als Wegweiser und wird verschiedenfarbiges Licht (rot, gelb, grün) dazu benutzt, den Verkehrsflu? zu steuern. Die Optik hat aber zun?chst bei der Entwicklung der Nachrichtentechnik keine gro?e Rolle gespielt. Zwar verdankt die drahtlose Nach作者: 勉勵(lì) 時(shí)間: 2025-3-29 14:36 作者: 絕種 時(shí)間: 2025-3-29 17:38 作者: 慢跑 時(shí)間: 2025-3-29 23:40
Stéphane DemriKoh?renz im Unterricht der Elementarteilchenphysik“ der Arbe.Koh?renz im Unterricht der Elementarteilchenphysik.Das vorliegende Buch fasst die Ergebnisse des Symposiums ?Koh?renz im Unterricht der Elementarteilchenphysik“ zusammen, das von der Arbeitsgruppe?.Physik und ihre Didaktik?.der Bergischen 作者: languid 時(shí)間: 2025-3-30 02:33 作者: 考得 時(shí)間: 2025-3-30 06:05
Mary-Anne Williamsluenced by a variety of physiologic inputs that can alert clinicians to dysfunction of the central nervous system (CNS) and other vital organs. Specifically, cerebral NIRS monitoring integrates the cumulative input of (a) cardiac output, (b) arterial blood pressure, (c) arterial oxygen content, (d) 作者: BOOM 時(shí)間: 2025-3-30 11:46 作者: 尖叫 時(shí)間: 2025-3-30 15:09 作者: 債務(wù) 時(shí)間: 2025-3-30 17:48 作者: BUMP 時(shí)間: 2025-3-30 21:45
Uwe Petermann – Robert Harlander.·????????????? Teilchen und Wellen als kosmische Boten – Brigitte Falkenburg.·????????????? Mit moderner Physik zum mündigen Bürger – Thomas Zügge.·????????????? Mystifizierung der Quantenmechanik und Trivialisierung der Teilchenphysik – Oliver Passon.·????????????? Basiskonzepte作者: 不可救藥 時(shí)間: 2025-3-31 02:06
Revision specifications by means of programs,m . then . is the unique .-justified revision of .. We show that .-justified revisions are models of .. We also show that .-justified revisions of a given knowledge base satisfy some minimality criterion. We outline the proof theory for revision programs and show its adequacy for the proposed semant作者: monologue 時(shí)間: 2025-3-31 08:47
Equality and constrained resolution,unctionally reflexive axioms are not needed. Some sorted logics satisfy these conditions. The analysis provides a means of extending restrictions on resolution and paramodulation (e.g. ordering restrictions) to constrained deduction, a relatively clean and simple mechanism for adding paramodulation 作者: conformity 時(shí)間: 2025-3-31 11:11
Two logical dimensions,sional part includes a procedural information, it represents transitions between knowledge states. Relational formalization exhibits these two dimensions in several nonclassical logics, including various modal logics, intuitionistic logic, Post logics, relevant logics. In the relational semantical s作者: ADORE 時(shí)間: 2025-3-31 13:50 作者: 禮節(jié) 時(shí)間: 2025-3-31 18:50 作者: Dysplasia 時(shí)間: 2025-4-1 00:35
Stéphane Demrienburg.·????????????? Mit moderner Physik zum mündigen Bürger – Thomas Zügge.·????????????? Mystifizierung der Quantenmechanik und Trivialisierung der Teilchenphysik – Oliver Passon.·????????????? Basiskonzepte978-3-662-61607-9作者: ARBOR 時(shí)間: 2025-4-1 01:57 作者: 自然環(huán)境 時(shí)間: 2025-4-1 06:29
ktive Bewertungskriterien für die global hochaktuelle Diskussion der Zukunft unserer Energieversorgung an die Hand zu geben. Insbesondere ist es ein zentrales Anliegen, dem Leser eine Bilanzierung aller Quellen hinsichtlich der Einflu?nahme ihrer Gewinnung und Verwendung auf die Umwelt zu erstellen
