Search
Search Results
-
Offline analysis of the relaxed upper boundedness for online estimation ofoptimal event sequences in Partially Observable Petri Nets
The aim of this paper is the analysis of the property of the relaxed structurally boundedness of the unobservable subnet of the Petri net which...
-
Reasoning with Theories
The objective of the chapter is to provide a usable way to deduce logical consequences from a given theory. We adopt Gentzen calculus (other...
-
Symbolic computation for the qualitative theory of differential equations
This paper provides a survey on symbolic computational approaches for the analysis of qualitative behaviors of systems of ordinary differential...
-
Coproduct and Amalgamation of Deductive Systems by Means of Ordered Algebras
We propose various methods for combining or amalgamating propositional languages and deductive systems. We make heavy use of quantales and quantale...
-
Vetoing: Social, Logical and Mathematical Aspects
An alternative title of this chapter could be ‘On Vetoer in Language, Logic and Mathematics’ because this text can be considered as an example...
-
-
Merging Arcs to Produce Acyclic Phylogenetic Networks and Normal Networks
As phylogenetic networks grow increasingly complicated, systematic methods for simplifying them to reveal properties will become more useful. This...
-
Complexity of the Problem of Being Equivalent to Horn Formulas. II
We look at the complexity of the existence problem for a Horn sentence equivalent to a given one. It is proved that for a signature consisting of one...
-
Extending the network calculus algorithmic toolbox for ultimately pseudo-periodic functions: pseudo-inverse and composition
Network Calculus (NC) is an algebraic theory that represents traffic and service guarantees as curves in a Cartesian plane, in order to compute...
-
Constructive Semigroups with Apartness: A State of the Art
This chapter aims to provide a clear and understandable picture of constructive semigroups with apartness in Bishop’s style of constructive...
-
Problem of Groupage Cargo Routing in the Multicommodity Transport Network with Given Tariffs and Delivery Time Constraints
The paper considers the network problem of optimizing the routing of groupage cargo flows in the transportation network with given tariffs for the...
-
Glivenko sequent classes and constructive cut elimination in geometric logics
A constructivisation of the cut-elimination proof for sequent calculi for classical, intuitionistic and minimal infinitary logics with geometric...
-
A Survey on Algorithms for Computing Comprehensive Gröbner Systems and Comprehensive Gröbner Bases
Weispfenning in 1992 introduced the concepts of comprehensive Gröbner system/basis of a parametric polynomial system, and he also presented an...
-
Intuitionistic sets and numbers: small set theory and Heyting arithmetic
It has long been known that (classical) Peano arithmetic is, in some strong sense, “equivalent” to the variant of (classical) Zermelo–Fraenkel set...
-
Scalable discrete algorithms for big data applications
In the past year, the project “Scalable Discrete Algorithms for Big Data Applications” dealt with High-Performance SAT Solving, Malleable Job...
-
-
The research and progress of the enumeration of lattice paths
The enumeration of lattice paths is an important counting model in enumerative combinatorics. Because it can provide powerful methods and technical...
-
Computer Algebra Systems and Dynamic Geometry for Mathematical Thinking
For more than three decades, the use of Computer Algebra Systems (CAS) and Dynamic Geometry Environments (DGE) has introduced new possibilities in...
-
A Sheaf-Theoretic Construction of Shape Space
We present a sheaf-theoretic construction of shape space—the space of all shapes. We do this by describing a homotopy sheaf on the poset category of...
-
On two supercongruences involving Almkvist-Zudilin sequences
We prove two supercongruences involving Almkvist-Zudilin sequences, which were originally conjectured by Z.-H. Sun (2020).