標題: Titlebook: Computer Science Logic; 20th International W Zoltán ésik Conference proceedings 2006 Springer-Verlag Berlin Heidelberg 2006 AI logics.Actio [打印本頁] 作者: AMUSE 時間: 2025-3-21 19:12
書目名稱Computer Science Logic影響因子(影響力)
書目名稱Computer Science Logic影響因子(影響力)學科排名
書目名稱Computer Science Logic網(wǎng)絡公開度
書目名稱Computer Science Logic網(wǎng)絡公開度學科排名
書目名稱Computer Science Logic被引頻次
書目名稱Computer Science Logic被引頻次學科排名
書目名稱Computer Science Logic年度引用
書目名稱Computer Science Logic年度引用學科排名
書目名稱Computer Science Logic讀者反饋
書目名稱Computer Science Logic讀者反饋學科排名
作者: NOCT 時間: 2025-3-21 23:30
William Ascher,Natalia Mirovitskayaa is a certain . from the structure generated by a given recursion scheme to an auxiliary ., which is itself generated by a related order-0 recursion scheme. By a structural analysis of the computation tree based on the . of the recursion scheme, we can infer certain properties of the generated stru作者: 常到 時間: 2025-3-22 04:18 作者: Insul島 時間: 2025-3-22 04:42
https://doi.org/10.1007/978-94-011-4032-4otivations that led to the emergence of nonmonotonic logics and introduce two major nonmonotonic formalisms, default and autoepistemic logics. We then point out to algebraic principles behind the two logics and present an abstract algebraic theory that unifies them and provides an effective framewor作者: FLAT 時間: 2025-3-22 11:22
The Cassini Cosmic Dust Analyzer,ver a sized type is accepted if it is visible in the type system that recursive calls occur just at a smaller size. This approach is only sound if the type of the recursive function is admissible, i.e., depends on the size index in a certain way. To explore the space of admissible functions in the p作者: CURL 時間: 2025-3-22 16:38
https://doi.org/10.1007/1-4020-3874-7ly many classes, according to which state has an infinite run. Building the full type hierarchy upon this interpretation of the base type gives a finite semantics for simply-typed lambda-trees..A calculus based on this semantics is proven sound and complete. In particular, for regular infinite lambd作者: CURL 時間: 2025-3-22 20:11 作者: 思考 時間: 2025-3-22 22:43
Using plutonium to run a spacecraftknows all logical consequences of her assumptions. In this paper, we suggest the following Logical Omniscience Test?(LOT): an epistemic system?. is not logically omniscient if for any valid in?. knowledge assertion?. of type ‘.,’ there is a proof of?. in?., the complexity of which is bounded by some作者: 會議 時間: 2025-3-23 02:44
Using plutonium to run a spacecraftes on lambda-calculus terms: all typable terms can be evaluated in polynomial time and all Ptime functions can be represented. In the present work we address the problem of typing lambda-terms in second-order .. For that we give a procedure which, starting with a term typed in system F, finds all po作者: 獎牌 時間: 2025-3-23 06:03
The mother planet and its magnetospherecond step computes successively all the solutions with a delay between two consecutive solutions .. and .. that is linear in |..|. We prove that evaluating a fixed monadic second order (MSO) query . (i.e. computing all the tuples that satisfy the MSO formula) in a binary tree is a .. problem. More p作者: 燒烤 時間: 2025-3-23 12:19 作者: heckle 時間: 2025-3-23 16:16
Prathap Reddy Kallamadi,Mulpuri Sujathahe first order theory of these graphs is undecidable, there is even a rational graph with an undecidable first order theory. In this paper we consider the family of rational trees, that is rational graphs which are trees. We prove that first order theory is decidable for this family. We also present作者: 流浪 時間: 2025-3-23 22:00
The Casual Sky Observer‘s Guided to obtain a sound Hoare-style calculus for basic probabilistic sequential programs. The Hoare calculus presented herein is the first probabilistic Hoare calculus with a complete and decidable state logic that has truth-functional propositional (not arithmetical) connectives. The models of the stat作者: 致詞 時間: 2025-3-23 23:03
The Casual Sky Observer‘s Guidee . (players make moves simultaneously and independently), . (the next state is determined by a probability distribution that depends on the current state and chosen moves of the players) and . (proceeds for infinite number of rounds). The analysis of concurrent stochastic games can be classified in作者: 觀察 時間: 2025-3-24 02:52 作者: 確定無疑 時間: 2025-3-24 08:13 作者: 割讓 時間: 2025-3-24 12:14
https://doi.org/10.1007/11874683AI logics; Action; Constraint; classical logic; complexity; computational logic; finite models; higher orde作者: 慎重 時間: 2025-3-24 16:04 作者: Recess 時間: 2025-3-24 22:26
Automata and Logics for Words and Trees over an Infinite Alphabete realm of semistructured data, timed automata and extended temporal logics..This paper survey several know results on automata and logics manipulating data words and data trees, the focus being on their relative expressive power and decidability.作者: Anal-Canal 時間: 2025-3-25 01:42 作者: 拉開這車床 時間: 2025-3-25 06:56
Computer Science Logic978-3-540-45459-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 袖章 時間: 2025-3-25 07:41
0302-9743 Overview: 978-3-540-45458-8978-3-540-45459-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 善變 時間: 2025-3-25 14:36 作者: 兇猛 時間: 2025-3-25 19:54 作者: excrete 時間: 2025-3-25 20:07
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/233776.jpg作者: Culpable 時間: 2025-3-26 03:32
Kenneth C. Mills,Carl-?ke D?ckerIn this article, we study the quantified constraint satisfaction problem (QCSP) over infinite domains. We develop a technique called collapsibility that allows one to give strong complexity upper bounds on the QCSP. This technique makes use of both logical and universal-algebraic ideas. We give applications illustrating the use of our technique.作者: Vital-Signs 時間: 2025-3-26 04:47 作者: 按等級 時間: 2025-3-26 09:46 作者: 搖曳 時間: 2025-3-26 14:58 作者: Initial 時間: 2025-3-26 20:22
A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automataa-trees it is decidable whether a given automaton has a run or not. As regular lambda-trees are precisely recursion schemes, this decidability result holds for arbitrary recursion schemes of arbitrary level, without any syntactical restriction. This partially solves an open problem of Knapik, Niwinski and Urzyczyn.作者: 人工制品 時間: 2025-3-27 00:53
Abstracting Allocationointers and address arithmetic. We demonstrate how to specify and verify the implementation of a simple memory manager and, independently, its clients in this style. The work has been fully machine-checked within the Coq proof assistant.作者: manifestation 時間: 2025-3-27 03:42
Reasoning About States of Probabilistic Sequential Programse logic are obtained exogenously by attaching sub-probability measures to valuations over memory cells. In order to achieve complete and recursive axiomatization of the state logic, the probabilities are taken in arbitrary real closed fields.作者: 脆弱吧 時間: 2025-3-27 07:47
https://doi.org/10.1007/1-4020-3874-7a-trees it is decidable whether a given automaton has a run or not. As regular lambda-trees are precisely recursion schemes, this decidability result holds for arbitrary recursion schemes of arbitrary level, without any syntactical restriction. This partially solves an open problem of Knapik, Niwinski and Urzyczyn.作者: 發(fā)生 時間: 2025-3-27 10:23 作者: Grandstand 時間: 2025-3-27 15:20 作者: mucous-membrane 時間: 2025-3-27 18:10 作者: micronized 時間: 2025-3-27 23:11 作者: infarct 時間: 2025-3-28 03:22 作者: 上下倒置 時間: 2025-3-28 07:20
Prathap Reddy Kallamadi,Mulpuri Sujatha the family of rational trees, that is rational graphs which are trees. We prove that first order theory is decidable for this family. We also present counter examples showing that this result cannot be significantly extended both in terms of logic and of structure.作者: Glossy 時間: 2025-3-28 10:49 作者: CHASM 時間: 2025-3-28 17:09 作者: 古老 時間: 2025-3-28 19:22
Verification of Ptime Reducibility for System F Terms Via Dual Light Affine Logicaddress the problem of typing lambda-terms in second-order .. For that we give a procedure which, starting with a term typed in system F, finds all possible ways to decorate it into a . typed term. We show that our procedure can be run in time polynomial in the size of the original Church typed system F term.作者: 顯赫的人 時間: 2025-3-28 23:27 作者: 整體 時間: 2025-3-29 03:12
The Cassini Cosmic Dust Analyzer,als into sets of strongly normalizing terms. It is shown that upper semi-continuity of such functions is a sufficient semantical criterion for admissibility. To provide a syntactical criterion, a calculus for semi-continuous function is developed.作者: 說笑 時間: 2025-3-29 07:59
Semi-continuous Sized Types and Terminationals into sets of strongly normalizing terms. It is shown that upper semi-continuity of such functions is a sufficient semantical criterion for admissibility. To provide a syntactical criterion, a calculus for semi-continuous function is developed.作者: 好忠告人 時間: 2025-3-29 13:48 作者: Oligarchy 時間: 2025-3-29 18:36 作者: Perineum 時間: 2025-3-29 23:24 作者: committed 時間: 2025-3-30 01:35
Concurrent Games with Tail Objectivesh tail objectives. We prove the . property for tail objectives, that states for all concurrent games if the optimum value for a player is positive for a tail objective Φ at some state, then there is a state where the optimum value is?1 for Φ, for the player. We also show that the optimum values of .作者: monochromatic 時間: 2025-3-30 05:11
Nash Equilibrium for Upward-Closed Objectives depend only on the current state. We also study the complexity of finding values (payoff profile) of an .-Nash equilibrium. We show that the values of an .-Nash equilibrium in nonzero-sum concurrent games with upward-closed objectives for all players can be computed by computing .-Nash equilibrium 作者: cinder 時間: 2025-3-30 08:57 作者: BOLUS 時間: 2025-3-30 15:55 作者: DEFER 時間: 2025-3-30 20:25
Using plutonium to run a spacecrafte terms?. is rich enough to match modal logic. We show that evidence-based knowledge systems are logically omniscient w.r.t.?the usual knowledge and are not logically omniscient w.r.t.?evidence-based knowledge.作者: BLANC 時間: 2025-3-31 00:33
The mother planet and its magnetosphereblems. In addition, we extend the precomputation (with the same complexity) such that the .. (with respect to a certain order) solution . is produced directly in time .(|.|log(|.|)). Finally, we generalize these results to bounded treewidth structures.作者: 愛花花兒憤怒 時間: 2025-3-31 02:44 作者: 調(diào)味品 時間: 2025-3-31 06:34
The Catalan Language in the Digital Age depend only on the current state. We also study the complexity of finding values (payoff profile) of an .-Nash equilibrium. We show that the values of an .-Nash equilibrium in nonzero-sum concurrent games with upward-closed objectives for all players can be computed by computing .-Nash equilibrium 作者: plasma-cells 時間: 2025-3-31 10:18 作者: BRINK 時間: 2025-3-31 13:37 作者: 可卡 時間: 2025-3-31 18:05 作者: 過渡時期 時間: 2025-3-31 22:32 作者: IRATE 時間: 2025-4-1 05:16 作者: 商談 時間: 2025-4-1 08:42 作者: irradicable 時間: 2025-4-1 12:05
Semi-continuous Sized Types and Terminationver a sized type is accepted if it is visible in the type system that recursive calls occur just at a smaller size. This approach is only sound if the type of the recursive function is admissible, i.e., depends on the size index in a certain way. To explore the space of admissible functions in the p
