標題: Titlebook: Logic, Language, Information, and Computation; 18th International W Lev D. Beklemishev,Ruy Queiroz Conference proceedings 2011 Springer Ber [打印本頁] 作者: Clique 時間: 2025-3-21 16:04
書目名稱Logic, Language, Information, and Computation影響因子(影響力)
書目名稱Logic, Language, Information, and Computation影響因子(影響力)學(xué)科排名
書目名稱Logic, Language, Information, and Computation網(wǎng)絡(luò)公開度
書目名稱Logic, Language, Information, and Computation網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Logic, Language, Information, and Computation被引頻次
書目名稱Logic, Language, Information, and Computation被引頻次學(xué)科排名
書目名稱Logic, Language, Information, and Computation年度引用
書目名稱Logic, Language, Information, and Computation年度引用學(xué)科排名
書目名稱Logic, Language, Information, and Computation讀者反饋
書目名稱Logic, Language, Information, and Computation讀者反饋學(xué)科排名
作者: Extort 時間: 2025-3-21 23:21
Univalent Foundations of Mathematicspproach constructive and “classical” mathematics. I will try to describe the basic construction of a model of constructive type theories which underlies these innovations and provide some demonstration on how this model is used to develop mathematics in Coq.作者: Perceive 時間: 2025-3-22 01:20 作者: Abrade 時間: 2025-3-22 06:39
Basic Model Theory for Memory Logicsmory logics, and prove results concerning characterization, definability and interpolation. While the first two properties hold for all memory logics introduced in this article, interpolation fails in most cases.作者: 細頸瓶 時間: 2025-3-22 12:06 作者: deciduous 時間: 2025-3-22 16:52
Untestable Properties in the Kahr-Moore-Wang Classand in particular, on the classification of prefix-vocabulary classes for testability. The main result is the untestability of [???????,(0,1)].. This is a well-known class and minimal for untestability. We discuss what is currently known about the classification for testability and briefly compare it to other classifications.作者: 催眠藥 時間: 2025-3-22 17:48 作者: exclamation 時間: 2025-3-23 00:10
Hoare Logic for Higher Order Store Using Simple Semanticstic programs “for free”. We also explain and demonstrate with an example that, contrary to what has been stated in the literature, such a proof system does support proofs which are (in a specific sense) modular.作者: inundate 時間: 2025-3-23 04:37
Concurrent Logic Games on Partial Ordersntation of concurrent systems, logical specifications, and problem descriptions, it is particularly suitable for reasoning about concurrent systems with partial order semantics, such as Petri nets or event structures. Two applications can be cast within this unified approach: bisimulation and model-checking.作者: 租約 時間: 2025-3-23 08:15
Unification in Logicnifiers of a formula. Nonclassical logics in general do not have this useful property, but many modal and intermediate propositional logics satisfy a slightly weaker property. In these logics, for every formula there is a finite set of unifiers such that any other unifier of the formula is generated by one of them.作者: IRS 時間: 2025-3-23 11:26 作者: HOWL 時間: 2025-3-23 16:40
On the Expressive Power of IF-Logic with Classical Negation that, nevertheless, the expressive power of this logic does not go beyond .. As part of the proof, we give a prenex normal form result and introduce a non-trivial syntactic fragment of full second-order logic that we show to be contained in ..作者: 結(jié)合 時間: 2025-3-23 21:32 作者: 費解 時間: 2025-3-23 23:41
0302-9743 philosophical logics, such as complexity theory, model theory, partial order, Hoare logics, hybrid logics, Turing machines, etc.978-3-642-20919-2978-3-642-20920-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: interpose 時間: 2025-3-24 06:02
Hybrid Logics and NP Graph PropertiesWe show that for each property of graphs . in NP there is a sequence .., .., ... of formulas of the full hybrid logic which are satisfied exactly by the frames in .. Moreover, the size of .. is bounded by a polynomial. We also show that the same holds for each graph property in the polynomial hierarchy.作者: cloture 時間: 2025-3-24 07:32 作者: novelty 時間: 2025-3-24 10:59 作者: Allege 時間: 2025-3-24 14:49
Relational Concepts and the Logic of Reciprocityakes such . to denote 〈1, 2 〉 generalized quantifiers over a given domain ., i.e. relations between subsets of E and binary relations over .. One of the reoccurring problems has been that reciprocal expressions seem to denote different quantifiers in different sentences.作者: Ergots 時間: 2025-3-24 20:00 作者: 施加 時間: 2025-3-24 23:35
Turing Machines on Cayley Graphsnd conclude that the proper degree of generality is Cayley graphs. Surprisingly, this generalization does not lead to yet another equivalent formulation of the notion of computable function. Rather, it gives an alternative definition of the recursively enumerable Turing degrees that does not rely on oracles.作者: 高興一回 時間: 2025-3-25 05:25
Information Flow on Directed Acyclic Graphs a relation known in information flow as nondeducibility. A logical system that describes the properties of this relation for an arbitrary fixed directed acyclic graph is introduced and proven to be complete and decidable.作者: Restenosis 時間: 2025-3-25 07:38 作者: GLOSS 時間: 2025-3-25 11:59 作者: lobster 時間: 2025-3-25 17:33 作者: 相容 時間: 2025-3-25 22:45 作者: consolidate 時間: 2025-3-26 04:02 作者: 濃縮 時間: 2025-3-26 06:43 作者: 具體 時間: 2025-3-26 12:16
A Symbolic Logic with Exact Bounds for Cryptographic Protocols bounds that could be used to choose key lengths or other concrete security parameters. The soundness proof for this logic, a variant of previous versions of Protocol Composition Logic (PCL), shows that derivable properties are guaranteed in a standard cryptographic model of protocol execution and r作者: 彎曲道理 時間: 2025-3-26 16:42
Univalent Foundations of Mathematicsonnections open a way to construct new foundations of mathematics alternative to the ZFC. These foundations promise to resolve several seemingly unconnected problems-provide a support for categorical and higher categorical arguments directly on the level of the language, make formalizations of usual作者: SKIFF 時間: 2025-3-26 17:23 作者: Functional 時間: 2025-3-26 21:55
Logic in the Time of WWW: An OWL Viewxt of the . Web Ontology Language and ontology-based data access (OBDA). In a typical OBDA scenario, . is an . ‘ontology’ providing a user-oriented view of raw data . and .(.) is a query with answer variables .. Unlike classical automated reasoning, an important requirement for OBDA is that it shoul作者: judiciousness 時間: 2025-3-27 04:59
A Complexity Question in Justification LogicT, LP and JD, were established to be .-complete. A corresponding lower bound is also known for JD4, the system that includes the consistency axiom and positive introspection. However, no upper bound has been established so far for this logic. Here, the missing upper bound for the complexity of JD4 i作者: Derogate 時間: 2025-3-27 07:43 作者: neologism 時間: 2025-3-27 12:27
Partial Realization in Dynamic Justification Logic ., a dynamic justification logic that includes term operators to reflect public announcements on the level of justifications. We create dynamic epistemic semantics for .. We also elaborate on the relationship of dynamic justification logics to Gerbrandy–Groeneveld’s . by providing a partial realiza作者: NEEDY 時間: 2025-3-27 15:14
Hoare Logic for Higher Order Store Using Simple Semanticstore program, the procedures/commands of the program are not fixed, but can be manipulated at runtime by the program itself; such programs provide a foundation to study language features such as reflection, dynamic loading and runtime code generation. By adapting the semantics of a proof system for 作者: Sedative 時間: 2025-3-27 17:56
Nominal Lawvere Theoriesducts. This formulation allows equational theories to be investigated as first class mathematical entities. However, many formal systems, particularly in computer science, are described by equations modulated by side conditions asserting the “freshness of names”; these may be expressed as theories o作者: 膽汁 時間: 2025-3-27 22:55
Turing Machines on Cayley Graphsnd conclude that the proper degree of generality is Cayley graphs. Surprisingly, this generalization does not lead to yet another equivalent formulation of the notion of computable function. Rather, it gives an alternative definition of the recursively enumerable Turing degrees that does not rely on作者: 高度表 時間: 2025-3-28 02:34
Information Flow on Directed Acyclic Graphs a relation known in information flow as nondeducibility. A logical system that describes the properties of this relation for an arbitrary fixed directed acyclic graph is introduced and proven to be complete and decidable.作者: ESPY 時間: 2025-3-28 06:33
The Boyce-Codd-Heath Normal Form for SQLdundancy in terms of functional dependencies. For efficient means of data processing the industry standard SQL permits partial data and duplicate rows of data to occur in database systems. Consequently, the combined class of uniqueness constraints and functional dependencies is more expressive than 作者: 范圍廣 時間: 2025-3-28 13:23 作者: inventory 時間: 2025-3-28 15:07 作者: maroon 時間: 2025-3-28 19:21
Dynamic Epistemic Algebra with Post-conditions to Reason about Robot Navigation algebraic-axiomatic methods have been restricted to a positive fragment of dynamic epistemic logic with communication events only. This paper proposes Boolean algebraic extensions which overcome these limitations by generalizing dynamic epistemic algebra to scenarios where events can change facts i作者: Hyperlipidemia 時間: 2025-3-29 00:12
Untestable Properties in the Kahr-Moore-Wang Classructure satisfies some property or is far from satisfying the property. We focus on the testability of classes of first-order expressible properties, and in particular, on the classification of prefix-vocabulary classes for testability. The main result is the untestability of [???????,(0,1)].. This 作者: crucial 時間: 2025-3-29 03:46
Samuel Bucheli,Roman Kuznets,Thomas Studerndlung. Diese Entscheide sind für Patienten, ihre ., aber oft auch für das klinische Personal von gro?er Tragweite. Sie stellen deshalb einen besonderen Anspruch an die Qualit?t der Entscheidungsfindung. Die Literatur weist allerdings darauf hin, dass Entscheidungsprozesse von vielerlei Faktoren ung作者: 擴大 時間: 2025-3-29 10:16 作者: 假 時間: 2025-3-29 13:11 作者: 有法律效應(yīng) 時間: 2025-3-29 17:58 作者: entrance 時間: 2025-3-29 23:24
Michael Donders,Sara Miner More,Pavel Naumovnsiliarisch durchgeführte Ethikberatungen. Im klinischen Alltag müssen viele ethische Fragen vom klinischen Personal selbstst?ndig gel?st werden, gestützt auf ihre in der jeweiligen Ausbildung erworbene medizin- oder pflegeethische Kompetenz und ohne eigentliche .. Daher sind neben der traditionelle作者: Adornment 時間: 2025-3-30 00:43 作者: 河潭 時間: 2025-3-30 05:59
Flavio Ferrarotti,Sven Hartmann,Henning K?hler,Sebastian Link,Millist Vincent作者: 吞沒 時間: 2025-3-30 11:13
Francicleber Martins Ferreira,Cibele Matos Freire,Mario R. F. Benevides,L. Menasché Schechter,Ana Te作者: Hyperplasia 時間: 2025-3-30 15:31 作者: 有害處 時間: 2025-3-30 16:54 作者: Carcinogenesis 時間: 2025-3-30 23:26 作者: Communal 時間: 2025-3-31 01:51
Samuel Bucheli,Roman Kuznets,Thomas Studerinflussfaktoren, welche den Entscheidungsprozess beeintr?chtigen oder verzerren k?nnen. Das Kapitel richtet sich an alle interessierten Fachleute und ist von besonderer Bedeutung für Personen, die ethische Entscheidungsfindungsprozesse moderieren. Sie sollen mittels ausgew?hlter Beispiele sensibilis作者: archetype 時間: 2025-3-31 07:08 作者: anachronistic 時間: 2025-3-31 10:41 作者: 呼吸 時間: 2025-3-31 17:09
Aubrey da Cunhainflussfaktoren, welche den Entscheidungsprozess beeintr?chtigen oder verzerren k?nnen. Das Kapitel richtet sich an alle interessierten Fachleute und ist von besonderer Bedeutung für Personen, die ethische Entscheidungsfindungsprozesse moderieren. Sie sollen mittels ausgew?hlter Beispiele sensibilis作者: 失誤 時間: 2025-3-31 20:10 作者: wreathe 時間: 2025-4-1 01:03
,Bayesian Evidential Deep Learning for?Online Action Detection, an attention module for active OAD, which actively selects important features based on the Bayesian mutual information instead of using all the features. We evaluated BEDL on benchmark datasets including THUMPS’14, TVSeries, and HDD. BEDL achieves competitive performance while keeping efficient inf作者: 微枝末節(jié) 時間: 2025-4-1 04:54 作者: 警告 時間: 2025-4-1 07:16 作者: BIBLE 時間: 2025-4-1 11:22 作者: pacific 時間: 2025-4-1 15:17
