Related papers: A General Framework for the Derivation of Regular …
This paper proposes an alternative to standard first-order logic that seeks greater naturalness, generality, and semantic self-containment. The system removes the first-order restriction, avoids type hierarchies, and dispenses with external…
Many works on inverse problems in the imaging sciences consider regularization via one or more penalty functions or constraint sets. When the models/images are not easily described using one or a few penalty functions/constraints, additive…
Automata play important roles in wide area of computing and the growth of multicores calls for their efficient parallel implementation. Though it is known in theory that we can perform the computation of a finite automaton in parallel by…
Argumentation Frameworks (AFs) are a key formalism in AI research. Their semantics have been investigated in terms of principles, which define characteristic properties in order to deliver guidance for analysing established and developing…
Code generation, defined as automatically writing a piece of code to solve a given problem for which an evaluation function exists, is a classic hard AI problem. Its general form, writing code using a general language used by human…
In this article, we introduce a new general definition of fractional derivative and fractional integral, which depends on an unknown kernel. By using these definitions, we obtain the basic properties of fractional integral and fractional…
A new derivative, called deformable derivative, is introduced here which is equivalent to ordinary derivative in the sense that one implies other. The deformable derivative is defined using limit approach like that of ordinary one but with…
This paper continues the author's previous work on a limit-free algebraic-geometric construction of the derivative in the class of polynomial functions and extends the proposed framework to elementary functions. Derivatives of rational…
We investigate the complexity of evaluating queries in Relational Algebra (RA) over the relations extracted by regex formulas (i.e., regular expressions with capture variables) over text documents. Such queries, also known as the regular…
We investigate the existence of "generic derivations" in exponential fields. We show that exponential fields without additional compatibility conditions between derivation and exponentiation cannot support a generic derivation.
Many abstract interpretation frameworks and analyses for Prolog have been proposed, which seek to extract information useful for program optimization. Although motivated by practical considerations, notably making Prolog competitive with…
The Chernoff bound is one of the most widely used tools in theoretical computer science. It's rare to find a randomized algorithm that doesn't employ a Chernoff bound in its analysis. The standard proofs of Chernoff bounds are beautiful but…
This paper extends the work of Laurikari and Kuklewicz on tagged deterministic finite automata (TDFA) in the context of submatch extraction in regular expressions. The main goal of this work is application of TDFA to lexer generators that…
Creating a descriptive grammar of a language is an indispensable step for language documentation and preservation. However, at the same time it is a tedious, time-consuming task. In this paper, we take steps towards automating this process…
The main aim of this note is to provide characterization theorems concerning real derivations. Among others the following implication will be verified: Assume that $\xi\colon \mathbb{R}\to \mathbb{R}$ is a given differentiable function and…
We introduce `atomic flows': they are graphs obtained from derivations by tracing atom occurrences and forgetting the logical structure. We study simple manipulations of atomic flows that correspond to complex reductions on derivations.…
We explain how to construct in two different ways a cartesian closed fibration of higher-order regular languages in the sense of Salvati. In the first construction, we use fibrational techniques to derive the cartesian closed fibration from…
A new notion of typicality for arbitrary probability measures on standard Borel spaces is proposed, which encompasses the classical notions of weak and strong typicality as special cases. Useful lemmas about strong typical sets, including…
Concurrent to the rapid progress in the development of neural-network based models in areas like natural language processing and computer vision, the need for creating explanations for the predictions of these black-box models has risen…
The definition of a non-trivial space of generalized functions of a complex variable allowing to consider derivatives of continuous functions is a non-obvious task, e.g. because of Morera theorem, because distributional Cauchy-Riemann…