標(biāo)題: Titlebook: Logical Foundations of Computer Science; Third International Anil Nerode,Yu. V. Matiyasevich Conference proceedings 1994 Springer-Verlag B [打印本頁(yè)] 作者: Malinger 時(shí)間: 2025-3-21 18:25
書(shū)目名稱Logical Foundations of Computer Science影響因子(影響力)
書(shū)目名稱Logical Foundations of Computer Science影響因子(影響力)學(xué)科排名
書(shū)目名稱Logical Foundations of Computer Science網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Logical Foundations of Computer Science網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Logical Foundations of Computer Science被引頻次
書(shū)目名稱Logical Foundations of Computer Science被引頻次學(xué)科排名
書(shū)目名稱Logical Foundations of Computer Science年度引用
書(shū)目名稱Logical Foundations of Computer Science年度引用學(xué)科排名
書(shū)目名稱Logical Foundations of Computer Science讀者反饋
書(shū)目名稱Logical Foundations of Computer Science讀者反饋學(xué)科排名
作者: 用肘 時(shí)間: 2025-3-21 22:58 作者: 轎車 時(shí)間: 2025-3-22 00:33
Henrik Reif Andersentely infer tags for new software objects by learning the relationships between historical software objects and their corresponding tags. Given a new software object, TagDeepRec is able to compute the confidence probability of each tag and then recommend top-k tags by ranking the probabilities. We us作者: 寄生蟲(chóng) 時(shí)間: 2025-3-22 06:18
Dmitry A. Archangelsky,Mikhail I. Dekhtyar,Evgeny Kruglov,Ilmir Kh. Musikaev,Mikhail A. Taitslinproaches, we propose a shallow semantic parsing framework to extract event arguments with the event trigger as the predicate and the event arguments as the predicate arguments. In specific, we design and compare different features for the proposed model. The experimental results show that our approa作者: 脫水 時(shí)間: 2025-3-22 09:01
Sergei Art?mov,Vladimir Krupskitely infer tags for new software objects by learning the relationships between historical software objects and their corresponding tags. Given a new software object, TagDeepRec is able to compute the confidence probability of each tag and then recommend top-k tags by ranking the probabilities. We us作者: Ptosis 時(shí)間: 2025-3-22 14:46
Andrea Asperti,Giovanna Dored agency” is being developed principally by John Debenham [UTS, Australia] and Carles Sierra [IIIA, Spain]. Published work to date has considered argumentation frameworks between a set of (often just two) agents, and has not taken into account the relationships that the various agents have with othe作者: tackle 時(shí)間: 2025-3-22 17:31
S. A. Berezin,N. V. Shiloves. The key insight of . is to extract the variance features of the fine-grained time-series CSI, which is sensitively affected by customer activity, to recognize what is the customer doing. First, we conduct . (PCA) to smooth the preprocessed CSI values since general denoising method is insufficien作者: pulse-pressure 時(shí)間: 2025-3-22 23:19
Carolyn Brown,Alan Jeffreyes. The key insight of . is to extract the variance features of the fine-grained time-series CSI, which is sensitively affected by customer activity, to recognize what is the customer doing. First, we conduct . (PCA) to smooth the preprocessed CSI values since general denoising method is insufficien作者: Misnomer 時(shí)間: 2025-3-23 03:19 作者: monogamy 時(shí)間: 2025-3-23 06:14 作者: ovation 時(shí)間: 2025-3-23 16:02 作者: APNEA 時(shí)間: 2025-3-23 19:10 作者: triptans 時(shí)間: 2025-3-24 00:29
S. S. Goncharov,S. A. Badaev the KnowledgeSeeker system framework is that it can improve the traditional information system with higher efficiency. In particular, it can increase the accuracy of a text classification system, and also enhance the search intelligence in a search engine. This can be done by enhancing the system w作者: 男學(xué)院 時(shí)間: 2025-3-24 06:22 作者: fructose 時(shí)間: 2025-3-24 10:30 作者: Malcontent 時(shí)間: 2025-3-24 13:43 作者: 停止償付 時(shí)間: 2025-3-24 18:49
R. Hoofman creation of the “Proventure Workplace”, a work environment which accentuates jobs requiring rich cognitive skills for continuing innovation and creativity..978-1-4614-2454-3978-0-387-09519-6Series ISSN 1865-4924 Series E-ISSN 1865-4932 作者: Motilin 時(shí)間: 2025-3-24 22:19 作者: Emasculate 時(shí)間: 2025-3-24 23:24
Max I. Kanovich creation of the “Proventure Workplace”, a work environment which accentuates jobs requiring rich cognitive skills for continuing innovation and creativity..978-1-4614-2454-3978-0-387-09519-6Series ISSN 1865-4924 Series E-ISSN 1865-4932 作者: 最低點(diǎn) 時(shí)間: 2025-3-25 06:04 作者: 保全 時(shí)間: 2025-3-25 09:33 作者: 沒(méi)血色 時(shí)間: 2025-3-25 14:39
Computational and concurrency models of linear logic,作者: 綠州 時(shí)間: 2025-3-25 17:30 作者: 粘 時(shí)間: 2025-3-25 21:43
978-3-540-58140-6Springer-Verlag Berlin Heidelberg 1994作者: 侵略主義 時(shí)間: 2025-3-26 00:50 作者: Phonophobia 時(shí)間: 2025-3-26 07:31 作者: 允許 時(shí)間: 2025-3-26 11:35
,Concurrency problem for Horn fragment of Girard’s Linear Logic,In this paper we propose a sufficient condition for a sequence of Horn implications to be concurrent. We prove that the problem of determining of nonconcurrency of a sequence of Horn implications is .-complete.作者: 館長(zhǎng) 時(shí)間: 2025-3-26 13:03 作者: municipality 時(shí)間: 2025-3-26 20:49 作者: 形上升才刺激 時(shí)間: 2025-3-26 22:12
An approach to effective model-checking of real-time Finite-State Machines in mu-calculus,nal mu-calculus. Formulae in this class have some discipline of alternation of fixed points. The other result extends the model checking techniques to the so-called semilinear class of finite Kripke structures induced by Finite-State Machines with multiple clock functioning in real time.作者: 嬉耍 時(shí)間: 2025-3-27 03:54
,Comparing models of the non-extensional typed λ-calculus extended abstract,general not uniquely determined, we can make a canonical choice in this particular ase; there exists a . interpretation of ? (with respect to a certain class of interpretations) which yields models with a . theory (in that class).作者: RAGE 時(shí)間: 2025-3-27 06:17
Conference proceedings 1994, held in St. Petersburg, Russia in July 1994. The symposium was the third in a series of joint efforts of logicians from both the former Soviet Union and the West..The volume reflects that the interaction of logic and computer science is an especially fertile ground for interdisciplinary work provi作者: 血統(tǒng) 時(shí)間: 2025-3-27 10:39
Foundations of proof search strategies design in linear logic,trategies construction using the notions of ., deduced from permutability properties and inference movements in a proof. Thus, we have logical bases for the design of proof strategies in CLL fragments and then we can propose sketches for their design.作者: 推延 時(shí)間: 2025-3-27 15:48 作者: 混沌 時(shí)間: 2025-3-27 20:40
0302-9743 Petersburg, held in St. Petersburg, Russia in July 1994. The symposium was the third in a series of joint efforts of logicians from both the former Soviet Union and the West..The volume reflects that the interaction of logic and computer science is an especially fertile ground for interdisciplinary 作者: ECG769 時(shí)間: 2025-3-27 22:30
On model checking infinite-state systems,roof will be correct when all leaves are directly seen to be valid. Therefore, it seems well-suited for implementation as a tool, by, for instance, integration into existing general-purpose theorem provers.作者: 可觸知 時(shí)間: 2025-3-28 06:09
Allegories of circuits,g garbage collection, we show that there is no faithful representation of nets in .: we conjecture that a semantics for nets which takes garbage collection into account is faithfully representable in ..作者: essential-fats 時(shí)間: 2025-3-28 07:05
Lower bounds for probabilistic space complexity: Communication-automata approach,ierarchies for different one-way probabilistic space communication complexity classes inside SPACE(.) (namely for bounded error probabilistic computation, and for errors of probabilistic computation).作者: 集聚成團(tuán) 時(shí)間: 2025-3-28 10:25
Yet another correctness criterion for Multiplicative Linear Logic with MIX,as . Proof Structures (deadlock free distributed systems). This result follows by considering the . among logical formulae inside proofs, and it provides a new understanding of notions like acyclicity, chains, and empires in terms of concurrent computations.作者: 空氣 時(shí)間: 2025-3-28 16:17
On extreme points of convex compact turing located set,tion that K is Turing located is necessary for the success of Algorithm E, that is, Algorithm E is effective if and only if K is Turing located. Algorithm E ia an effective version of the finite dimensinal Krein-Milman Theorem. A sequel will investigate the effective content of the KreinMilman theorem in effectively presented metric spaces.作者: 積云 時(shí)間: 2025-3-28 19:50
Application of typed lambda calculi in the untyped lambda calculus,son. Typability in various intersection type assignment systems characterizes lambda terms in normal form, normalizing, solvable and unsolvable terms. Hence, its application in the proof of the Genericity Lemma turns out to be appropriate.作者: Androgen 時(shí)間: 2025-3-29 00:16 作者: 非秘密 時(shí)間: 2025-3-29 03:48 作者: 高度 時(shí)間: 2025-3-29 10:05 作者: Allure 時(shí)間: 2025-3-29 12:24
0302-9743 work providing mutual understanding and benefits. The totally 35 papers are devoted to topics as linear logic, Horn clauses, model-checking, lambda-calculi, modal logic, and problem complexity.978-3-540-58140-6978-3-540-48442-4Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 討好美人 時(shí)間: 2025-3-29 19:19 作者: 職業(yè)拳擊手 時(shí)間: 2025-3-29 20:18 作者: osteocytes 時(shí)間: 2025-3-30 02:49 作者: 我們的面粉 時(shí)間: 2025-3-30 04:34
Yet another correctness criterion for Multiplicative Linear Logic with MIX,ion is inspired by an original interpretation of Proof Structures as distributed systems, and logical formulae as processes. The computation inside a system corresponds to the logical . inside a proof, that is, roughly, a distributed version of Girard‘s token trip. Proof Nets are then characterised 作者: 公社 時(shí)間: 2025-3-30 10:07 作者: 粗野 時(shí)間: 2025-3-30 12:27 作者: 凝結(jié)劑 時(shí)間: 2025-3-30 19:29
The complexity of propositional modal theories and the complexity of consistency of propositional m a finite set of formulas . and a formula ., determine if . is in the modal theory ..(S) formed with all theorems of the modal logic . as logical axioms and with all members of . as proper axioms. (2). The .-consistency problem: given a finite set of formulas ., determine if the theory ..(.) is cons作者: 你正派 時(shí)間: 2025-3-30 22:26 作者: 歌曲 時(shí)間: 2025-3-31 02:45
Foundations of proof search strategies design in linear logic,h strategies. We propose common theoretical foundations for top-down, bottom-up and mixed proof search procedures with a systematic formalization of strategies construction using the notions of ., deduced from permutability properties and inference movements in a proof. Thus, we have logical bases f作者: 高度 時(shí)間: 2025-3-31 07:26 作者: orient 時(shí)間: 2025-3-31 09:38
Application of typed lambda calculi in the untyped lambda calculus,he strong normalization property of the intersection type assignment system is used in order to prove the finitness of developments property of the untyped lambda calculus in Krivine (1990). Similarly, the strong normalization property of the simply typed lambda calculus can be used for the same rea作者: interlude 時(shí)間: 2025-3-31 15:01
Strong normalization in a non-deterministic typed lambda-calculus,calculus, however, cannot be provided with a computational interpretation. Some of the constructs act as oracles and, for this reason, it is not possible to define an effective notion of reduction. In the present paper, we address this problem. We consider a weak version of the implicative fragment 作者: conquer 時(shí)間: 2025-3-31 17:37
On expressive completeness of modal logic,ithin a class of special finite hamiltonian binary ramified frames, called ., the complete ones have been classified by means of simple numerical invariants..In the meantime, the question of expressive completeness could be answered for . binary ramified frames. The corresonding results will appear 作者: 燕麥 時(shí)間: 2025-3-31 23:14
,Comparing models of the non-extensional typed λ-calculus extended abstract,general not uniquely determined, we can make a canonical choice in this particular ase; there exists a . interpretation of ? (with respect to a certain class of interpretations) which yields models with a . theory (in that class).作者: infantile 時(shí)間: 2025-4-1 04:42
Coalgebras and approximation,he canonical comonad that one has on a category of algebras. We obtain a very simple model of linear logic where linear formulas are complete lattices and intuitionistic formulas are just sets. Also, in another, domain theoretic example, we give a new characterization of continuous posets (where eve作者: 設(shè)想 時(shí)間: 2025-4-1 07:32
There are many studies about this task. To obtain the important context in the input sentences and improve the model’s performance, recent studies use the attention mechanism. But the attention mechanism used in them does not take the distance into account when calculating the weight of words and ig作者: 玷污 時(shí)間: 2025-4-1 11:40 作者: 緯度 時(shí)間: 2025-4-1 16:37
Henrik Reif Andersenfacilitating information classification and organization. However, the insufficient understanding of software objects and the lack of relevant knowledge among developers may lead to incorrect tags. Thus, the automatic tag recommendation technique has been proposed. However, tag explosion and tag syn作者: Semblance 時(shí)間: 2025-4-1 18:49
Dmitry A. Archangelsky,Mikhail I. Dekhtyar,Evgeny Kruglov,Ilmir Kh. Musikaev,Mikhail A. Taitslin provided in advance. One popular solution of jointly extracting entities and events is to detect the entity mentions using sequence labeling approaches. However, this methods may ignore the syntactic relationship among triggers and arguments. We find that the constituents in the parse tree structur作者: tic-douloureux 時(shí)間: 2025-4-2 00:47 作者: osteoclasts 時(shí)間: 2025-4-2 03:37
