Related papers: Canonized Rewriting and Ground AC Completion Modul…
This paper proposes a method to embed the AC power flow problem with voltage magnitude constraints in the complex plane. Modeling the action of network controllers that regulate the magnitude of voltage phasors is a challenging task in the…
Canonical Correlation Analysis (CCA) has been widely applied to jointly embed multiple views of data in a maximally correlated latent space. However, the alignment between various data perspectives, which is required by traditional…
Large language models are increasingly capable at closed-world mathematical reasoning, but research assistance also requires source-grounded use of the literature. When a proof reaches a non-trivial step, a useful assistant should determine…
Argumentation has proved a useful tool in defining formal semantics for assumption-based reasoning by viewing a proof as a process in which proponents and opponents attack each others arguments by undercuts (attack to an argument's premise)…
Monoidal algebraic structures consist of operations that can have multiple outputs as well as multiple inputs, which have applications in many areas including categorical algebra, programming language semantics, representation theory,…
Finitely generated Z-modules have canonical decompositions. When such modules are given in a finitely presented form there is a classical algorithm for computing a canonical decomposition. This is the algorithm for computing the Smith…
A set $F$ of formulas is complete relative to a given class of logics, if every logic from this class can be axiomatized by formulas from $F$. A set of formulas $F$ is {\L}-complete relative to a given class of logics, if every logic of…
We propose an approach to modeling of AC motors entirely based on analytical mechanics. Symmetry and connection constraints are moreover incorporated in the energy function from which the models are derived. The approach is especially…
This paper presents a new solution to the containment problem for extended regular expressions that extends basic regular expressions with intersection and complement operators and consider regular expressions on infinite alphabets based on…
We introduce the adiabatic quantum Monte Carlo (AQMC) method, where we gradually crank up the interaction strength, as an amelioration of the sign problem. It is motivated by the adiabatic theorem and will approach the true ground-state if…
Answer set programming (ASP) is a logic programming formalism used in various areas of artificial intelligence like combinatorial problem solving and knowledge representation and reasoning. It is known that enhancing ASP with function…
Traces and their extension called combined traces (comtraces) are two formal models used in the analysis and verification of concurrent systems. Both models are based on concepts originating in the theory of formal languages, and they are…
This paper exhibits a general and uniform method to prove completeness for certain modal fixpoint logics. Given a set \Gamma of modal formulas of the form \gamma(x, p1, . . ., pn), where x occurs only positively in \gamma, the language…
We consider the problem of intruder deduction in security protocol analysis: that is, deciding whether a given message $M$ can be deduced from a set of messages $\Gamma$ under the theory of blind signatures and arbitrary convergent…
We study generalized comatrix coalgebras and upper triangular comatrix coalgebras, which are not only a dualization but also an extension of classical generalized matrix algebras. We use these to answer several questions on Noetherian and…
Answer Set Programming Modulo Theories (ASPMT) is a new framework of tight integration of answer set programming (ASP) and satisfiability modulo theories (SMT). Similar to the relationship between first-order logic and SMT, it is based on a…
A common approach for studying a solid solution or disordered system within a periodic ab-initio framework is to create a supercell in which a certain amount of target elements is substituted with other ones. The key to generating…
We present an algorithm for normalizing \emph{Batched Einstein Summation} expressions by mapping mathematically equivalent formulations to a unique normal form. Batches of einsums with the same Einstein notation that exhibit substantial…
We generalize Exel's notion of partial group action to monoids. For partial monoid actions that can be defined by means of suitably well-behaved systems of generators and relations, we employ classical rewriting theory in order to describe…
We formulate and analyze an optimization-based Atomistic-to-Continuum (AtC) coupling method for problems with point defects. Near the defect core the method employs a potential-based atomistic model, which enables accurate simulation of the…