Related papers: Algebraic and model theoretic methods in constrain…
This is an annotated bibliography on estimation and inference results for queues and related stochastic models. The purpose of this document is to collect and categorise works in the field, allowing for researchers and practitioners to…
We consider qualitative simulation involving a finite set of qualitative relations in presence of complete knowledge about their interrelationship. We show how it can be naturally captured by means of constraints expressed in temporal logic…
We present an exactly solvable random-subcube model inspired by the structure of hard constraint satisfaction and optimization problems. Our model reproduces the structure of the solution space of the random k-satisfiability and k-coloring…
We propose to leverage epistemic uncertainty about constraint satisfaction of a reinforcement learner in safety critical domains. We introduce a framework for specification of requirements for reinforcement learners in constrained settings,…
These notes derive a number of technical results on nonlinear contraction theory, a comparatively recent tool for system stability analysis. In particular, they provide new results on the preservation of contraction through system…
These notes contain a survey of some aspects of the theory of differential modules and complexes as well as of their generalization, that is, the theory of $N$-differential modules and $N$-complexes. Several applications and examples coming…
This is a companion piece to my paper on "Example-Based Procedural Modeling Using Graph Grammars." This paper examines some of the theoretical issues in more detail. This paper discusses some more complex parts of the implementation, why…
We study threshold properties of random constraint satisfaction problems under a probabilistic model due to Molloy. We give a sufficient condition for the existence of a sharp threshold that leads (for boolean constraints) to a necessary…
We derive sufficient conditions for theories consisting of multiple vector fields, which could also couple to external fields, to be multi-field generalised Proca theories. The conditions are derived by demanding that the theories have the…
We present a comprehensive programme analysing the decomposition of proof systems for non-classical logics into proof systems for other logics, especially classical logic, using an algebra of constraints. That is, one recovers a proof…
We propose an algorithm for tabular episodic reinforcement learning with constraints. We provide a modular analysis with strong theoretical guarantees for settings with concave rewards and convex constraints, and for settings with hard…
This is a work in progress, far from being in its final form whose purpose is to investigate thoroughly the structure of Berkovich analytic curves and its relation with the semi-stable reduction theorem (of which a new proof is given here,…
Model reduction is a central topic in systems biology and dynamical systems theory, for reducing the complexity of detailed models, finding important parameters, and developing multi-scale models for instance. While perturbation theory is a…
We determine under which conditions certain natural models of random constraint satisfaction problems have sharp thresholds of satisfiability. These models include graph and hypergraph homomorphism, the $(d,k,t)$-model, and binary…
We present a number of questions in commutative algebra posed on the problem solving seminar in algebra at Stockholm University during the period Fall 2014 - Spring 2017.
Many logic programming based approaches can be used to describe and solve combinatorial search problems. On the one hand there is constraint logic programming which computes a solution as an answer substitution to a query containing the…
We introduce MTT, a dependent type theory which supports multiple modalities. MTT is parametrized by a mode theory which specifies a collection of modes, modalities, and transformations between them. We show that different choices of mode…
The text is based on notes from a class entitled {\em Model Theory of Berkovich Spaces}, given at the Hebrew University in the fall term of 2009, and retains the flavor of class notes. It includes an exposition of material from…
We study constraint satisfaction problems (CSPs) where the constraint languages are defined by finite automata, giving rise to automata-based CSPs. The key notion is the concept of Automatic Constraint Satisfaction Problem ($AutCSP$), where…
Many problems in operations research require that constraints be specified in the model. Determining the right constraints is a hard and laborsome task. We propose an approach to automate this process using artificial intelligence and…