Results 31 to 40 of about 158 (143)
Measure‐valued processes for energy markets
Mathematical Finance, Volume 35, Issue 2, Page 520-566, April 2025.Abstract We introduce a framework that allows to employ (non‐negative) measure‐valued processes for energy market modeling, in particular for electricity and gas futures. Interpreting the process' spatial structure as time to maturity, we show how the Heath–Jarrow–Morton approach can be translated to this framework, thus guaranteeing arbitrage free ...
Christa Cuchiero +3 more
wiley +1 more source
Representing hybrid automata by action language modulo theories
, 2017 Both hybrid automata and action languages are formalisms for describing the evolution of dynamic systems. This paper establishes a formal relationship between them.
NIKHIL LONEY, JOOHYUNG LEE, YUNSONG MENG
core +1 more source
Exploiting Partial Assignments for Efficient Evaluation of Answer Set Programs with External Source Access [PDF]
, 2018 Answer Set Programming (ASP) is a well-known declarative problem solving approach based on nonmonotonic logic programs, which has been successfully applied to a wide range of applications in artificial intelligence and beyond.
Kaminski, Tobias +6 more
core +1 more source
Functional Stable Model Semantics and Answer Set Programming Modulo Theories
Recently there has been an increasing interest in incorporating ``intensional'' functions in answer set programming. Intensional functions are those whose values can be described by other functions and predicates, rather than being pre-defined as in the standard answer set programming.
Michael Bartholomew, Joohyung Lee 0002
openaire +3 more sources
On the additive image of zeroth persistent homology
Transactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.Abstract For a category X$X$ and a finite field F$F$, we study the additive image of the functor H0(−;F)∗:rep(X,Top)→rep(X,VectF)$\operatorname{H}_0(-;F)_* \colon \operatorname{rep}(X, \mathbf {Top}) \rightarrow \operatorname{rep}(X, \mathbf {Vect}_F)$, or equivalently, of the free functor rep(X,Set)→rep(X,VectF)$\operatorname{rep}(X, \mathbf {Set ...
Ulrich Bauer +3 more
wiley +1 more source
Cross-Translating Answer Set Programs Using the ASPTOOLS Collection
, 2018 One viable way of implementing answer set programming (ASP) is to compile (ground) logic programs into other formalisms and to use existing solver technology to compute answer sets.
Janhunen, Tomi, Tomi Janhunen
core +1 more source
Self‐Similar Blowup for the Cubic Schrödinger Equation
Communications on Pure and Applied Mathematics, Volume 79, Issue 8, Page 1831-1918, August 2026.ABSTRACT We give a rigorous proof for the existence of a finite‐energy, self‐similar solution to the focusing cubic Schrödinger equation in three spatial dimensions. The proof is computer‐assisted and relies on a fixed point argument that shows the existence of a solution in the vicinity of a numerically constructed approximation.
Roland Donninger, Birgit Schörkhuber
wiley +1 more source
, 2015 Boolean satisfiability (SAT) solvers have been successfully applied to a wide variety of difficult combinatorial problems. Many further problems can be solved by SAT Modulo Theory (SMT) solvers, which extend SAT solvers to handle additional types of ...
Hoos, Holger +3 more
core +1 more source
Upper Bounds on the Minimum Size of Feedback Arc Set of Directed Multigraphs With Bounded Degree
Journal of Graph Theory, Volume 112, Issue 4, Page 421-432, August 2026.ABSTRACT An oriented multigraph is a directed multigraph without directed 2‐cycles. Let fas ( D ) denote the minimum size of a feedback arc set in an oriented multigraph D. In several papers, upper bounds for fas ( D ) were obtained for oriented multigraphs D with maximum degree upper‐bounded by a constant.
Gregory Gutin +3 more
wiley +1 more source
Edge‐Length Preserving Embeddings of Graphs Between Normed Spaces
Journal of Graph Theory, Volume 112, Issue 4, Page 491-506, August 2026.ABSTRACT The concept of graph embeddability, initially formalized by Belk and Connelly and later expanded by Sitharam and Willoughby, extends the question of embedding finite metric spaces into a given normed space. A finite simple graph G = ( V , E ) is said to be ( X , Y )‐embeddable if any set of induced edge lengths from an embedding of G into a ...
Sean Dewar +3 more
wiley +1 more source