標題: Titlebook: Logical Foundations of Computer Science - Tver ‘92; Second International Anil Nerode,Mikhail Taitslin Conference proceedings 1992 Springer- [打印本頁] 作者: Auditory-Nerve 時間: 2025-3-21 18:59
書目名稱Logical Foundations of Computer Science - Tver ‘92影響因子(影響力)
書目名稱Logical Foundations of Computer Science - Tver ‘92影響因子(影響力)學科排名
書目名稱Logical Foundations of Computer Science - Tver ‘92網(wǎng)絡公開度
書目名稱Logical Foundations of Computer Science - Tver ‘92網(wǎng)絡公開度學科排名
書目名稱Logical Foundations of Computer Science - Tver ‘92被引頻次
書目名稱Logical Foundations of Computer Science - Tver ‘92被引頻次學科排名
書目名稱Logical Foundations of Computer Science - Tver ‘92年度引用
書目名稱Logical Foundations of Computer Science - Tver ‘92年度引用學科排名
書目名稱Logical Foundations of Computer Science - Tver ‘92讀者反饋
書目名稱Logical Foundations of Computer Science - Tver ‘92讀者反饋學科排名
作者: 千篇一律 時間: 2025-3-21 21:41
0302-9743 n a series of international symposiaon logical foundations of computer science held in Russia.The meeting is a joint effort of scholars from both theformer Soviet Union and the West, and indicates a new era ofinternational cooperation. Sponsors of the meeting include:theAssociation for Computing Mac作者: 尖 時間: 2025-3-22 00:49
Conference proceedings 1992 of international symposiaon logical foundations of computer science held in Russia.The meeting is a joint effort of scholars from both theformer Soviet Union and the West, and indicates a new era ofinternational cooperation. Sponsors of the meeting include:theAssociation for Computing Machinery, th作者: Harass 時間: 2025-3-22 05:05
Strictness logic and polymorphic invariance,e a program logic for assigning properties to terms. This places work on strictness analysis via type inference on a firm theoretical foundation. We then use proof theoretic techniques to show how the derivable strictness properties of different instances of polymorphically typed terms are related.作者: Engaged 時間: 2025-3-22 09:30
Many-valued non-monotonic modal logics,shed concerning these logics. In this paper we introduce non-monotonic modal logics based on many-valued logics, rather than on classical logic. This extends earlier work of ours on many-valued modal logics. Intended applications are to situations involving several reasoners, not just one as in the standard development.作者: macrophage 時間: 2025-3-22 14:44 作者: 不怕任性 時間: 2025-3-22 18:42 作者: Fraudulent 時間: 2025-3-22 21:41 作者: 使痛苦 時間: 2025-3-23 04:00
Incremental evaluation of natural semantics specifications,ntal facilities to our evaluator. That is to say, after some modification of a term whose semantic value has already been evaluated, we do not need to re-evaluate everything from scratch as it is the case with a Prolog engine.作者: blithe 時間: 2025-3-23 07:09 作者: bourgeois 時間: 2025-3-23 11:11
Automated deduction in additive and multiplicative linear logic,(or constructive) proof of the decidability of AMLL and as a first step to consider linear logic as a basis for an extended programming logic. The restriction (and adaptation) of this result to multiplicative linear logic (MLL) gives an adequate algorithm for automatic proof net construction.作者: 清楚說話 時間: 2025-3-23 14:00 作者: intelligible 時間: 2025-3-23 19:18 作者: 禁止 時間: 2025-3-24 00:05 作者: 財主 時間: 2025-3-24 06:25 作者: 懶洋洋 時間: 2025-3-24 07:36 作者: Occupation 時間: 2025-3-24 12:52 作者: FLAX 時間: 2025-3-24 18:38
Ordering optimisations for concurrent logic programs,out dereferencing; indicate where variable initialisation and unification can be simplified; and show which variables can be allocated to an environment. Some safety checks can also be removed by using mode information.作者: HAWK 時間: 2025-3-24 19:55 作者: 刺耳 時間: 2025-3-25 03:12 作者: jocular 時間: 2025-3-25 06:52
Quantifying the amount of verboseness (extended abstract),ld characteristic function of .. A complete characterization is obtained relating the question to finite combinatorics. In order to obtain an explicit description we encounter several interesting combinatorial problems.作者: 他很靈活 時間: 2025-3-25 10:23 作者: 迷住 時間: 2025-3-25 13:41
978-3-540-55707-4Springer-Verlag Berlin Heidelberg 1992作者: 阻撓 時間: 2025-3-25 16:36 作者: overshadow 時間: 2025-3-25 21:14
https://doi.org/10.1007/BFb0023857Beweisatheorie; Logical Foundations; Logische Grundlagen; Mathematical Logic; Nicht-klassische Logiken; N作者: 不遵守 時間: 2025-3-26 01:46 作者: RAG 時間: 2025-3-26 05:02
Ordinal arithmetic with list structures (preliminary version),We provide a set of “natural” requirements for well-orderings of (binary) list structures. We show that the resultant order-type is the successor of the first critical epsilon number.作者: Prologue 時間: 2025-3-26 12:09
Modal Linear Logic,ell. It describes transformation of resources not only for the single point but for some net, where supplies can be sent from one object to another one using interfaces. We introduce a new semantics and a new calculus for this logic and prove the completeness theorem for this calculus in respect to 作者: Banquet 時間: 2025-3-26 16:10 作者: paradigm 時間: 2025-3-26 18:29
Quantifying the amount of verboseness (extended abstract),ld characteristic function of .. A complete characterization is obtained relating the question to finite combinatorics. In order to obtain an explicit description we encounter several interesting combinatorial problems.作者: Carcinogenesis 時間: 2025-3-27 00:52
Strictness logic and polymorphic invariance,er on certain closed subsets of domains. The axiomatisation of the lattice of strictness properties is shown to be sound and complete, and we then give a program logic for assigning properties to terms. This places work on strictness analysis via type inference on a firm theoretical foundation. We t作者: Eructation 時間: 2025-3-27 03:41
,The Ehrenfeucht-Fra?ssé games for transitive closure,with generalized quantifiers was known before, the exact formulation of these games for the predicate transformers arising from various transitive-closure-like operations is new. The games are sound and complete both for finite and infinite models. Combined with well known theorems of Fagin and Imme作者: 難聽的聲音 時間: 2025-3-27 05:45
Feasibility of finite and infinite paths in data dependent programs,s the dependencies of real time systems on integer data, the language LTIM can model quantitative timing constraints in r.t.s. specifications. It is proven that the problem of whether a given LBASE or LTIM program has an infinite feasible path (i.e. whether it can exhibit an infinite behaviour) is d作者: 新奇 時間: 2025-3-27 10:30
An interleaving model for real-time systems,the natural numbers, or dense, such as the rationals or the reals. We extend the notion of strong bisimulation to timed processes and show that the largest strong bisimulation is decidable. The decidability is independent of the choice of the time domain.作者: fatuity 時間: 2025-3-27 13:49 作者: 把手 時間: 2025-3-27 18:44 作者: Accommodation 時間: 2025-3-28 01:23
Many-valued non-monotonic modal logics,ce of explicit modal operators allows flexibility in the embedding of other approaches. Also several theoretical results of interest have been established concerning these logics. In this paper we introduce non-monotonic modal logics based on many-valued logics, rather than on classical logic. This 作者: 禁令 時間: 2025-3-28 03:46 作者: incredulity 時間: 2025-3-28 07:47 作者: defenses 時間: 2025-3-28 11:03
A constructive proof that tree are well-quasi-ordered under minors (detailed abstract), polynomial time algorithms. However, partially because of their non-constructive nature, these proofs do not yield any information about the algorithms. Here we present a constructive proof that trees are well-quasi-ordered under minors. This extends the results of Murty and Russell [MR90] who give作者: 剛開始 時間: 2025-3-28 17:06
Banishing robust Turing completeness, themselves. We show that FewP does not robustly possess Turing-hard sets for UP ∩ coUP and IP ∩ coIP does not robustly possess Turing-hard sets for ZPP. It follows that ZPP, R, coR, UP ∩ coUP, UP, FewP ∩ coFewP, FewP, and IP ∩ coIP do not robustly possess Turing complete sets. This both resolves op作者: Lipoprotein(A) 時間: 2025-3-28 20:00 作者: 一美元 時間: 2025-3-29 01:29 作者: 采納 時間: 2025-3-29 04:30
Ordering optimisations for concurrent logic programs, paper ordering optimisations are reviewed, reformulated and refined. The paper explains how ordering optimisations can be realised in terms of abstract interpretation and shows that by, building on schedule analysis, simple, efficient and accurate forms of abstract interpretation can achieved. The 作者: Sedative 時間: 2025-3-29 07:36 作者: foreign 時間: 2025-3-29 15:09 作者: 彎曲道理 時間: 2025-3-29 15:51 作者: 機警 時間: 2025-3-29 23:18 作者: 多山 時間: 2025-3-30 00:36 作者: 贊美者 時間: 2025-3-30 05:28 作者: 難理解 時間: 2025-3-30 10:58
A. Calò,J. A. Makowskyos often suffer from cognitive overload, as well as conceptual and navigational disorientation. Particularly, when studying in resource-based learning scenarios with complex and ill-structured subject-matter content, there is a need for both effective learning strategies and the management of knowle作者: 保存 時間: 2025-3-30 16:06 作者: alabaster 時間: 2025-3-30 20:04
Liang Chenos often suffer from cognitive overload, as well as conceptual and navigational disorientation. Particularly, when studying in resource-based learning scenarios with complex and ill-structured subject-matter content, there is a need for both effective learning strategies and the management of knowle作者: intertwine 時間: 2025-3-30 22:34
Isabelle Attali,Jacques Chazarain,Serge Gilettermation graphics can enhance human cognitive capacities in a wide range of contexts and applications. But not every picture is worth the space it occupies. What qualities make a diagram an effective and efficient conduit of information to the human mind? In this article we argue that the best diagra作者: 傳染 時間: 2025-3-31 02:50
Philippe de Grootevolumes have focused, among other topics, on the role that creativity, culture, power, networks, science and universities have in cultivating an understanding of how the social process of knowing unfolds in space. They all draw attention to ways in which this process is situated in places and how le作者: 調味品 時間: 2025-3-31 07:26 作者: 打擊 時間: 2025-3-31 10:11
Melvin Fittingvolumes have focused, among other topics, on the role that creativity, culture, power, networks, science and universities have in cultivating an understanding of how the social process of knowing unfolds in space. They all draw attention to ways in which this process is situated in places and how le作者: 鎮(zhèn)壓 時間: 2025-3-31 17:15
Didier Galmiche,Guy Perriervolumes have focused, among other topics, on the role that creativity, culture, power, networks, science and universities have in cultivating an understanding of how the social process of knowing unfolds in space. They all draw attention to ways in which this process is situated in places and how le作者: 云狀 時間: 2025-3-31 18:39 作者: 輕而薄 時間: 2025-4-1 00:01 作者: Tinea-Capitis 時間: 2025-4-1 04:37
Lane A. Hemachandra,Sanjay Jain,Nikolai K. Vereshchagin occasion of the 37 5th anniversary of the University of Groningen. Studying the relation between knowledge and language, one may distin- guish two different lines of inquiry, one focussing on language as a body of knowledge, the other on language as a vehicle of knowledge. Approaching language as a作者: MIRE 時間: 2025-4-1 07:27
Sachio Hirokawa mean: what kinds of social, economic, or mental developments are causally responsible for promoting it? That is a question for historians, sociologists and psychologists of science to answer. Instead I shall concern myself with a more philosophical issue, namely: how can the possibility of conceptu作者: amenity 時間: 2025-4-1 13:51
R. Hoofman others; and it is also a sign of genius.”. Even if genius means something considerably less than it came to mean in romantic times, if Aristotle is at all right here then making metaphors cannot form part of ordinary linguistic competence, if only because we do acquire from others our knowledge of 作者: Longitude 時間: 2025-4-1 16:40
