English
Related papers

Related papers: On Explicit Solutions to Fixed-Point Equations in …

200 papers

Dynamic Epistemic Logic (DEL) is a family of multimodal logics that has proved to be very successful for epistemic reasoning in planning tasks. In this logic, the agent's knowledge is captured by modal epistemic operators whereas the system…

Artificial Intelligence · Computer Science 2019-05-28 Pedro Cabalar , Jorge Fandinno , Luis Fariñas del Cerro

Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Expressive role constructors are important in many applications, but can…

Logic in Computer Science · Computer Science 2007-05-23 Ian Horrocks , Ulrike Sattler , Stephan Tobies

We introduce Visibly Linear Dynamic Logic (VLDL), which extends Linear Temporal Logic (LTL) by temporal operators that are guarded by visibly pushdown languages over finite words. In VLDL one can, e.g., express that a function resets a…

Logic in Computer Science · Computer Science 2017-05-18 Alexander Weinert , Martin Zimmermann

Variations of loading level and changes in system topological property may cause the operating point of an electric power systems to move gradually towards the verge of its transmission capability, which can lead to catastrophic outcomes…

Systems and Control · Computer Science 2019-04-19 Bai Cui , Xu Andy Sun

We prove the well-posedness results, i.e. existence, uniqueness, and stability, of the solutions to a class of nonlocal fully nonlinear parabolic partial differential equations (PDEs), where there is an external time parameter $t$ on top of…

Analysis of PDEs · Mathematics 2021-10-11 Qian Lei , Chi Seng Pun

We introduce Parametric Linear Dynamic Logic (PLDL), which extends Linear Dynamic Logic (LDL) by temporal operators equipped with parameters that bound their scope. LDL was proposed as an extension of Linear Temporal Logic (LTL) that is…

Logic in Computer Science · Computer Science 2014-08-27 Peter Faymonville , Martin Zimmermann

Recursive definitions of predicates are usually interpreted either inductively or coinductively. Recently, a more powerful approach has been proposed, called flexible coinduction, to express a variety of intermediate interpretations,…

Programming Languages · Computer Science 2020-09-23 Francesco Dagnino , Davide Ancona , Elena Zucca

In this article, we address a class of non convex, integer, non linear mathematical programs using dynamic programming. The mathematical program considered, whose properties are studied in this article, may be used to model the optimal…

Discrete Mathematics · Computer Science 2021-12-28 David Nizard , Nicolas Dupin , Dominique Quadri

Exact self-consistent particle-like solutions with spherical and/or cylindrical symmetry to the equations governing the interacting system of scalar, electromagnetic and gravitational fields have been obtained. As a particular case it is…

General Relativity and Quantum Cosmology · Physics 2010-05-27 Yu. P. Rybakov , B. Saha , G. N. Shikin

Defeasible rules are used in providing computable representations of legal documents and, more recently, have been suggested as a basis for explainable AI. Such applications draw attention to the scalability of implementations. The…

Artificial Intelligence · Computer Science 2021-08-12 Michael J. Maher

Using an adelic approach we simultaneously consider real and p-adic aspects of dynamical systems whose states are mapped by linear fractional transformations isomorphic to some subgroups of GL (2, Q), SL (2, Q) and SL (2, Z) groups. In…

Mathematical Physics · Physics 2009-11-11 Branko Dragovich , Andrei Khrennikov , Dusan Mihajlovic

In this thesis we introduce the concept of a guided dynamical system, and exploit this idea to solve various problems in functional equations and PDE's. Our main results are 1) a necessary and sufficient condition for unique-solvability of…

Dynamical Systems · Mathematics 2007-05-23 Orr Shalit

We consider the hardness of approximation of optimization problems from the point of view of definability. For many NP-hard optimization problems it is known that, unless P = NP, no polynomial-time algorithm can give an approximate solution…

Logic in Computer Science · Computer Science 2019-08-30 Albert Atserias , Anuj Dawar

Stable Logic Programming (SLP) is an emergent, alternative style of logic programming: each solution to a problem is represented by a stable model of a deductive database/function-free logic program encoding the problem itself. Several…

Artificial Intelligence · Computer Science 2014-02-25 Gianpaolo Brignoli , Stefania Costantini , Ottavio D'Antona , Alessandro Provetti

Let $f$ be a continuous real function defined in a subset of the real line. The standard definition of continuity at a point $x$ allow us to correlate any given epsilon with a (possibly depending of $x$) delta value. This pairing is known…

General Topology · Mathematics 2017-10-13 Paulo M. de Carvalho-Neto , Paulo A. Liboni Filho

This two-part paper details a theory of solvability for the power flow equations in lossless power networks. In Part I, we derive a new formulation of the lossless power flow equations, which we term the fixed-point power flow. The model is…

Optimization and Control · Mathematics 2017-09-21 John W. Simpson-Porco

For performance and verification in machine learning, new methods have recently been proposed that optimise learning systems to satisfy formally expressed logical properties. Among these methods, differentiable logics (DLs) are used to…

Logic in Computer Science · Computer Science 2024-07-08 Reynald Affeldt , Alessandro Bruni , Ekaterina Komendantskaya , Natalia Ślusarz , Kathrin Stark

This article demonstrates how variation of parameters can be successfully implemented in combination with other classical techniques, such as the method of characteristics, to derive novel classes of solutions to nonlinear partial…

Analysis of PDEs · Mathematics 2025-05-13 Noureddine Mhadhbi , Sameh Gana , Mazen Fawaz Alsaeedi

The power flow (PF) problem is a fundamental problem in power system engineering. Many popular solvers face challenges, such as convergence issues. One can try to rewrite the PF problem into a fixed point equation, which can be solved…

Optimization and Control · Mathematics 2019-09-17 Kishan Prudhvi Guddanti , Yang Weng , Baosen Zhang

Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed \lambda-calculus and the modal \lambda-calculus. This makes it a highly expressive temporal logic that is capable of expressing various interesting correctness properties of…

Logic in Computer Science · Computer Science 2015-07-01 Roland Axelsson , Martin Lange , Rafal Somla
‹ Prev 1 4 5 6 7 8 10 Next ›