標(biāo)題: Titlebook: Relational and Algebraic Methods in Computer Science; 18th International C Uli Fahrenberg,Peter Jipsen,Michael Winter Conference proceeding [打印本頁] 作者: Aggrief 時(shí)間: 2025-3-21 18:02
書目名稱Relational and Algebraic Methods in Computer Science影響因子(影響力)
書目名稱Relational and Algebraic Methods in Computer Science影響因子(影響力)學(xué)科排名
書目名稱Relational and Algebraic Methods in Computer Science網(wǎng)絡(luò)公開度
書目名稱Relational and Algebraic Methods in Computer Science網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Relational and Algebraic Methods in Computer Science被引頻次
書目名稱Relational and Algebraic Methods in Computer Science被引頻次學(xué)科排名
書目名稱Relational and Algebraic Methods in Computer Science年度引用
書目名稱Relational and Algebraic Methods in Computer Science年度引用學(xué)科排名
書目名稱Relational and Algebraic Methods in Computer Science讀者反饋
書目名稱Relational and Algebraic Methods in Computer Science讀者反饋學(xué)科排名
作者: oncologist 時(shí)間: 2025-3-21 20:41
Commutative Doubly-Idempotent Semirings Determined by Chains and by Preorder Forests,all .. Bounded distributive lattices are cdi-semirings that satisfy ., and the variety of cdi-semirings covers the variety of bounded distributive lattices. Chajda and L?nger showed in 2017 that the variety of all cdi-semirings is generated by a 3-element cdi-semiring. We show that there are seven c作者: Detoxification 時(shí)間: 2025-3-22 00:41 作者: 友好 時(shí)間: 2025-3-22 05:58
Hardness of Network Satisfaction for Relation Algebras with Normal Representations, contains a non-trivial equivalence relation with a finite number of equivalence classes, then the network satisfaction problem for . is NP-hard. As a second result, we prove hardness if . has domain size at least three and contains no non-trivial equivalence relations but a symmetric atom . with a 作者: IVORY 時(shí)間: 2025-3-22 12:01 作者: 綠州 時(shí)間: 2025-3-22 13:26
Bisimilarity of Diagrams,lly defined using the theory of open maps of Joyal et al., we prove two characterisations of this bisimilarity: it is equivalent to the existence of a bisimulation-like relation and has a logical characterisation à la Hennessy and Milner. We then prove that we capture both path bisimilarity and stro作者: 植物茂盛 時(shí)間: 2025-3-22 19:30
Generating Posets Beyond ,their basic algebraic properties as well as the hierarchy of gluing-parallel posets generated from singletons by finitary applications of the two compositions. We show that not only series-parallel posets, but also interval orders, which seem more interesting for modelling concurrent and distributed作者: 泰然自若 時(shí)間: 2025-3-22 21:16
Automated Algebraic Reasoning for Collections and Local Variables with Lenses,mated proof in the Isabelle/UTP verification framework. In this paper, we expand our lens library with (1) dynamic lenses, that support mutable indexed collections, such as arrays, and (2) symmetric lenses, which allow partitioning of a state space into disjoint local and global regions to support v作者: Corral 時(shí)間: 2025-3-23 03:35 作者: 積習(xí)難改 時(shí)間: 2025-3-23 06:42 作者: AORTA 時(shí)間: 2025-3-23 11:11 作者: prostatitis 時(shí)間: 2025-3-23 16:03
Differential Hoare Logics and Refinement Calculi for Hybrid Systems with Isabelle/HOL,ith tests is used for reasoning about the program structure and generating verification conditions at this level. Lenses capture hybrid program stores in a generic algebraic way. The approach has been formalised with the Isabelle/HOL proof assistant. Several examples explain the workflow with the re作者: 晚間 時(shí)間: 2025-3-23 21:14 作者: 供過于求 時(shí)間: 2025-3-23 22:18 作者: languor 時(shí)間: 2025-3-24 05:37 作者: fetter 時(shí)間: 2025-3-24 07:50
,Preorders, Partial Semigroups, and?Quantales,im of this paper is to understand the relational embedding as a relationship between quantales and preorders. For that, this paper introduces the notion of weak preorders, a functor from the category of weak preorders to the category of partial semigroups, and a functor from the category of partial 作者: 易彎曲 時(shí)間: 2025-3-24 14:36
Counting and Computing Join-Endomorphisms in Lattices,morphisms of a given finite lattice .. In particular, we show that when . is ., the discrete order of . elements extended with top and bottom, . where . is the Laguerre polynomial of degree .. We also study the following problem: Given a lattice . of size . and a set . of size ., find the greatest l作者: construct 時(shí)間: 2025-3-24 15:58 作者: Inflammation 時(shí)間: 2025-3-24 21:44 作者: 有說服力 時(shí)間: 2025-3-25 00:42
Computer-Supported Exploration of a Categorical Axiomatization of Modeloids,with an operation, called the derivative, which is inspired by Ehrenfeucht-Fra?ssé games. In this paper we develop a generalization of a modeloid first to an inverse semigroup and then to an inverse category using an axiomatic approach to category theory. We then show that this formulation enables a作者: 商店街 時(shí)間: 2025-3-25 04:49 作者: 帶來 時(shí)間: 2025-3-25 09:10
Bisimilarity of Diagrams, spaces. We prove that checking bisimilarity and satisfiability of a positive formula by a diagram are both decidable by reducing to a problem of existence of invertible matrices with linear conditions, which in turn reduces to the existential theory of the reals.作者: 非秘密 時(shí)間: 2025-3-25 12:57 作者: GENRE 時(shí)間: 2025-3-25 16:19
,Preorders, Partial Semigroups, and?Quantales,ak preorders (including the class of ordinary preorders), four classes of partial semigroups, and four classes of quantales. As a corollary of the correspondence, we can understand the relational embedding map as a natural transformation between functors onto certain category of quantales.作者: 打包 時(shí)間: 2025-3-26 00:01
Counting and Computing Join-Endomorphisms in Lattices, problem can be solved with worst-case time complexity in . for powerset lattices, . for lattices of sets, and . for arbitrary lattices. The complexity is expressed in terms of the basic binary lattice operations performed by the algorithm.作者: companion 時(shí)間: 2025-3-26 03:57 作者: 似少年 時(shí)間: 2025-3-26 04:42
Generating Posets Beyond , systems, can be generated, but not all posets. Generating posets is also important for constructing free algebras for concurrent semirings and Kleene algebras that allow compositional reasoning about such systems.作者: arbovirus 時(shí)間: 2025-3-26 11:29
Automated Algebraic Reasoning for Collections and Local Variables with Lenses,ariable scopes. From this basis, we provide an enriched program model in Isabelle/UTP for collection variables and variable blocks. For the latter, we adopt an approach first used by Back and von Wright, and derive weakest precondition and Hoare calculi. We demonstrate several examples, including verification of insertion sort.作者: 十字架 時(shí)間: 2025-3-26 13:45 作者: Omniscient 時(shí)間: 2025-3-26 18:17 作者: 接觸 時(shí)間: 2025-3-26 21:47
Hardness of Network Satisfaction for Relation Algebras with Normal Representations, second result, we prove hardness if . has domain size at least three and contains no non-trivial equivalence relations but a symmetric atom . with a forbidden triple (.,?.,?.), that is, .. We illustrate how to apply our conditions on two small relation algebras.作者: Expiration 時(shí)間: 2025-3-27 03:49
Verifying the Correctness of Disjoint-Set Forests with Kleene Relation Algebras,verify the correctness of an array-based implementation of disjoint-set forests with a naive union operation and a find operation with path compression. All results are formally proved in Isabelle/HOL.作者: 保留 時(shí)間: 2025-3-27 08:31
Computer-Supported Exploration of a Categorical Axiomatization of Modeloids,t to an inverse semigroup and then to an inverse category using an axiomatic approach to category theory. We then show that this formulation enables a purely algebraic view on Ehrenfeucht-Fra?ssé games.作者: engrossed 時(shí)間: 2025-3-27 12:50
Conference proceedings 2020ether with 3 invited abstracts were carefully selected from 29 submissions. Topics covered range from mathematical foundations to applications as conceptual and methodological tools in computer science and beyond..作者: faddish 時(shí)間: 2025-3-27 16:40 作者: Cupidity 時(shí)間: 2025-3-27 18:22 作者: thyroid-hormone 時(shí)間: 2025-3-28 01:24
Higher-Order Categorical Substructural Logic: Expanding the Horizon of Tripos Theory,btain tripos-theoretical completeness theorems for a broad variety of higher-order logics. The framework thus developed, moreover, allows us to obtain tripos-theoretical Girard and Kolmogorov translation theorems for higher-order logics.作者: 2否定 時(shí)間: 2025-3-28 02:59
A Unary Semigroup Trace Algebra,nn semigroup. Reactive designs specified using it satisfy core laws that have been mechanised so far in Isabelle/UTP. More importantly, our results improve the support for unifying trace models in the UTP.作者: Erythropoietin 時(shí)間: 2025-3-28 06:18
The Involutive Quantaloid of Completely Distributive Lattices,nce . is closed under the monoidal operations of ., we also argue that if . is involutive, then . is completely distributive as well; consequently, any lattice embedding into an involutive quantale of the form . has, as its domain, a distributive lattice.作者: 毗鄰 時(shí)間: 2025-3-28 13:50 作者: 爵士樂 時(shí)間: 2025-3-28 18:12 作者: photopsia 時(shí)間: 2025-3-28 20:38
978-3-030-43519-6The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerl作者: Mucosa 時(shí)間: 2025-3-28 23:53 作者: Serenity 時(shí)間: 2025-3-29 06:50 作者: Cabg318 時(shí)間: 2025-3-29 10:57 作者: BUCK 時(shí)間: 2025-3-29 12:22 作者: Vasoconstrictor 時(shí)間: 2025-3-29 17:18 作者: 機(jī)警 時(shí)間: 2025-3-29 21:05 作者: PAGAN 時(shí)間: 2025-3-30 03:45
Manuel Bodirsky,Simon Kn?uere want this reorganization to be done in-place, i.e., using the file‘s original storage space for the newly reorganized file. The motivation for such a physical change is to improve the database system‘s performance. For example, by placing frequently and jointly accessed records on the same page or作者: Hemiplegia 時(shí)間: 2025-3-30 04:42
Jules Desharnais,Bernhard M?llerre a two-layer channel is used to route a specified set of nets between two rows of terminals. If the net list contains long runs, the only way to reduce the number of channel tracks is by splitting horizontal segments of nets (jogging)..A new algorithm is proposed which uses a preprocessing to deci作者: 眨眼 時(shí)間: 2025-3-30 11:26 作者: 改革運(yùn)動(dòng) 時(shí)間: 2025-3-30 12:39 作者: 災(zāi)難 時(shí)間: 2025-3-30 18:42 作者: 政府 時(shí)間: 2025-3-30 21:12 作者: 圓桶 時(shí)間: 2025-3-31 03:24 作者: 消耗 時(shí)間: 2025-3-31 08:41
Walter Guttmann,Bernhard M?llerfects of up-to-date hardware technology to data structure and database algorithms. Historically in database file organization, utilization of sequential access and clustering of data are two important techniques to improve processing efficiency. Flash memory, which is believed to replace conventiona作者: 你不公正 時(shí)間: 2025-3-31 09:58 作者: Ccu106 時(shí)間: 2025-3-31 15:37 作者: MEEK 時(shí)間: 2025-3-31 20:44 作者: abstemious 時(shí)間: 2025-4-1 01:35
Koki Nishizawa,Shin-ya Katsumata,Yuichi Komoridaoblems in various disciplines. It will also help us to make future predictions and decisions using AI algorithms for engineering problems. Machine learning and optimizing techniques provide strong insights into novice users. In the era of big data, there is a need to deal with data science problems 作者: 要控制 時(shí)間: 2025-4-1 04:32
Koki Nishizawa,Koji Yasuda,Hitoshi Furusawa of visualization techniques. In this chapter, we sample the visualization literature to provide a taxonomy of the usage of mathematics in visualization and to identify a fundamental set of mathematics that should be taught to students as part of an introduction to contemporary visualization researc作者: 使堅(jiān)硬 時(shí)間: 2025-4-1 09:57
Santiago Quintero,Sergio Ramirez,Camilo Rueda,Frank Valencia the data. As most visualization images are not interpreted by visualization experts, but by other users, such as domain experts, “users play a central role in visualization?[.].” Practically no one in the visualization community would seriously question this fact. Many researchers in the community 作者: 黃瓜 時(shí)間: 2025-4-1 13:21
Pedro Ribeirowe see large numbers of instances, dimensions, parameters, etc. Such data surpasses what can readily be shown on a 2D or 3D display. One solution to this challenge is the development of better or more complex interfaces, that include, for instance, linked views, large displays, dynamic visualization作者: prick-test 時(shí)間: 2025-4-1 18:00
Luigi Santocanale of visualization techniques. In this chapter, we sample the visualization literature to provide a taxonomy of the usage of mathematics in visualization and to identify a fundamental set of mathematics that should be taught to students as part of an introduction to contemporary visualization researc作者: sclera 時(shí)間: 2025-4-1 19:14 作者: 舊石器 時(shí)間: 2025-4-2 02:17 作者: 尾隨 時(shí)間: 2025-4-2 06:25
on Foundations of Data Organization, which was held on May 21-24, 1985, in Kyoto, Japan. This conference was held at Kyoto University, and sponsored by the organizing committee of the International Conference on Foundations of Data Organization and the Japan Society for the Promotion of Science. The conferenc978-1-4612-9048-3978-1-4613-1881-1
