標(biāo)題: Titlebook: CSL ‘89; 3rd Workshop on Comp Egon B?rger,Hans Kleine Büning,Michael M. Richter Conference proceedings 1990 Springer-Verlag Berlin Heidelbe [打印本頁] 作者: 風(fēng)俗習(xí)慣 時(shí)間: 2025-3-21 16:54
書目名稱CSL ‘89影響因子(影響力)
書目名稱CSL ‘89影響因子(影響力)學(xué)科排名
書目名稱CSL ‘89網(wǎng)絡(luò)公開度
書目名稱CSL ‘89網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱CSL ‘89被引頻次
書目名稱CSL ‘89被引頻次學(xué)科排名
書目名稱CSL ‘89年度引用
書目名稱CSL ‘89年度引用學(xué)科排名
書目名稱CSL ‘89讀者反饋
書目名稱CSL ‘89讀者反饋學(xué)科排名
作者: Mechanics 時(shí)間: 2025-3-21 23:34
Crossing Borders in Southern Africa,) and then with the standard translator from CL into an order-sorted predicate logic where a standard theorem prover can be used. The CL translation mechanism which simplifies the development of proof theories for complex nonclassical logics is briefly described.作者: SLAY 時(shí)間: 2025-3-22 02:15 作者: Trypsin 時(shí)間: 2025-3-22 04:48 作者: 發(fā)酵 時(shí)間: 2025-3-22 11:28 作者: Shuttle 時(shí)間: 2025-3-22 16:54 作者: Shuttle 時(shí)間: 2025-3-22 19:03
Propositional provability and models of weak arithmetic,作者: 追逐 時(shí)間: 2025-3-23 00:32 作者: BLINK 時(shí)間: 2025-3-23 04:28 作者: Motilin 時(shí)間: 2025-3-23 09:12 作者: FOLLY 時(shí)間: 2025-3-23 11:20 作者: 翻動 時(shí)間: 2025-3-23 15:04 作者: 向下 時(shí)間: 2025-3-23 18:25 作者: Processes 時(shí)間: 2025-3-23 22:54
Davis-Putnam resolution versus unrestricted resolution,e of the variables of the formula such that x is eliminated (with the resolution rule) before y on any branch of the proof tree representing the resolution proof, only if x is before y in this sequence. Davis-Putnam resolution is one of several resolution restrictions. It is complete..We present an 作者: dyspareunia 時(shí)間: 2025-3-24 02:27
Polymorphic recursion and semi-unification,pe theory of programming languages. We introduce semi-unification via the typability problem for polymorphic recursive definitions, present a reduction calculus for semi-unification problems, and discuss partial results on termination of reductions. We prove decidability of semi-unification in two v作者: 招待 時(shí)間: 2025-3-24 07:47
Deciding Horn classes by hyperresolution,es or by propositional features these classes are characterized by variable occurrence — and term depth properties. Special attention is given to a subclass of the Horn clause implication problem, which can be represented as consistency problem; to decide ?C→?D, ( ?C denotes the universal closoure o作者: Ceremony 時(shí)間: 2025-3-24 13:52
New ways for developing proof theories for first-order multi modal logics,sentially extensions of modal logics. In this paper a quite complex first-order many-sorted multi modal logic (MM-Logic) with modal operators referring to a basic branching accessibility relation, its reflexive, transitive and reflexive-transitive closure, indexed modal operators, ‘eventually’ opera作者: cornucopia 時(shí)間: 2025-3-24 18:41 作者: 羽飾 時(shí)間: 2025-3-24 21:27 作者: 健談 時(shí)間: 2025-3-25 01:21 作者: 乞丐 時(shí)間: 2025-3-25 05:23
978-3-540-52753-4Springer-Verlag Berlin Heidelberg 1990作者: 調(diào)味品 時(shí)間: 2025-3-25 11:16 作者: 要求比…更好 時(shí)間: 2025-3-25 14:13 作者: Friction 時(shí)間: 2025-3-25 15:51
https://doi.org/10.1007/978-1-4939-1295-7A logical framework is introduced which captures the behaviour of oracle machines and gives logical descriptions of complexity classes that are defined by oracle machines. Using this technique the notion of first-order selfreducibility is investigated and applied to obtain a structural result about non-uniform complexity classes below P.作者: heterodox 時(shí)間: 2025-3-25 23:18
Carol Yeh-Yun Lin,Leif Edvinsson,Tord BedingWe generalize algebraic operational semantics from sequential languages to distributed, concurrent languages using Occam as an example. Elsewhere, we will discuss applications to the study of verification and transformation of programs.作者: 刺穿 時(shí)間: 2025-3-26 03:00 作者: 弄皺 時(shí)間: 2025-3-26 07:16 作者: 藝術(shù) 時(shí)間: 2025-3-26 08:30 作者: SENT 時(shí)間: 2025-3-26 14:16
On logical descriptions of some concepts in structural complexity theory,A logical framework is introduced which captures the behaviour of oracle machines and gives logical descriptions of complexity classes that are defined by oracle machines. Using this technique the notion of first-order selfreducibility is investigated and applied to obtain a structural result about non-uniform complexity classes below P.作者: 灌輸 時(shí)間: 2025-3-26 18:24
Algebraic operational semantics and Occam,We generalize algebraic operational semantics from sequential languages to distributed, concurrent languages using Occam as an example. Elsewhere, we will discuss applications to the study of verification and transformation of programs.作者: 寬敞 時(shí)間: 2025-3-26 22:45
,Ω-branching programs of bounded width,We investigate the question whether equipping some of the nodes of a width-bounded branching program with devices for evaluating Boolean functions does increase its computational power. In contrast to the situation for unbounded width branching programs, in the bounded width case we have to negate this question generalizing a result of Barrington.作者: textile 時(shí)間: 2025-3-27 03:45
A predicate calculus with control of derivations,A fragment of classical predicate calculus which does not contain rules for contraction is defined. It is shown to be decidable and yet propositionally complete. A semantics which reflects its constructive character is developed.作者: definition 時(shí)間: 2025-3-27 05:37 作者: Unsaturated-Fat 時(shí)間: 2025-3-27 12:20 作者: Indent 時(shí)間: 2025-3-27 14:38
,Resisting Racism in the Academy: ‘,’, the property of recursively covered programs and goals. We show that, for programs and goals that are call-consistent, even and recursively covered, SLDNF-resolution computes a complete set of ground answers. We then propose further generalized conditions that ensure that SLDNF-resolution is flound作者: 吸引人的花招 時(shí)間: 2025-3-27 17:54 作者: Exposition 時(shí)間: 2025-3-27 22:59
https://doi.org/10.1007/978-94-6209-704-9pe theory of programming languages. We introduce semi-unification via the typability problem for polymorphic recursive definitions, present a reduction calculus for semi-unification problems, and discuss partial results on termination of reductions. We prove decidability of semi-unification in two v作者: Generator 時(shí)間: 2025-3-28 06:10
https://doi.org/10.1057/9781137010889es or by propositional features these classes are characterized by variable occurrence — and term depth properties. Special attention is given to a subclass of the Horn clause implication problem, which can be represented as consistency problem; to decide ?C→?D, ( ?C denotes the universal closoure o作者: Hemoptysis 時(shí)間: 2025-3-28 07:51
Crossing Borders in Southern Africa,sentially extensions of modal logics. In this paper a quite complex first-order many-sorted multi modal logic (MM-Logic) with modal operators referring to a basic branching accessibility relation, its reflexive, transitive and reflexive-transitive closure, indexed modal operators, ‘eventually’ opera作者: obsolete 時(shí)間: 2025-3-28 14:07
https://doi.org/10.1007/978-3-658-43850-0 there are two canonical ways of defining the data types: the iterative one and the recursive one. Both define the same mathematical object, but we show that they have a completely different algorithmic content. The essential of the difference appears in the operational properties of two programs: t作者: 我不明白 時(shí)間: 2025-3-28 18:27 作者: 使尷尬 時(shí)間: 2025-3-28 20:36 作者: 混沌 時(shí)間: 2025-3-29 01:39 作者: 火花 時(shí)間: 2025-3-29 05:40 作者: 怒目而視 時(shí)間: 2025-3-29 07:16
Conference proceedings 19902-6, 1989. These proceedings cover a wide range of topics both from theoretical and applied areas of computer science. More specifically, the papers deal with problems arising at the border of logic and computer science, e.g. in complexity, data base theory, logic programming, artificial intelligece作者: Immobilize 時(shí)間: 2025-3-29 14:38 作者: Myosin 時(shí)間: 2025-3-29 19:04 作者: 單挑 時(shí)間: 2025-3-29 22:38
https://doi.org/10.1057/9781137010889such implication clause forms, because there is only one rule, ground unit facts and ground unit goals. The sharp boundary between solvable and unsolvable classes is illustrated, and a complexity analysis of some classes is given.作者: 陰謀小團(tuán)體 時(shí)間: 2025-3-30 01:46 作者: Cervical-Spine 時(shí)間: 2025-3-30 04:24 作者: MAIM 時(shí)間: 2025-3-30 08:29 作者: angina-pectoris 時(shí)間: 2025-3-30 14:21 作者: 得體 時(shí)間: 2025-3-30 18:49
The complexity of subtheories of the existential linear theory of reals,ructure of atoms..In the case that the quantifier free part is a conjunction of atomic formulas we have nothing else than the linear optimation problem, which is P-complete. In the case of two variables per atomic formula the problem is in NC..Also the case that all atoms are of the form Σ.....≥., such that .>0, is considered.作者: 串通 時(shí)間: 2025-3-30 21:05
0302-9743 ntelligece, and temporal logic. The volume should be of interest to all logicians and computer scientists working in the above field.978-3-540-52753-4978-3-540-47137-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 護(hù)航艦 時(shí)間: 2025-3-31 00:55
9樓作者: 終點(diǎn) 時(shí)間: 2025-3-31 06:51
9樓作者: BIBLE 時(shí)間: 2025-3-31 11:42
9樓作者: legislate 時(shí)間: 2025-3-31 16:24
10樓作者: MUTED 時(shí)間: 2025-3-31 21:09
10樓作者: 的是兄弟 時(shí)間: 2025-3-31 22:25
10樓作者: AVOID 時(shí)間: 2025-4-1 03:02
10樓
