Zobrazeno 1 - 10
of 40
pro vyhledávání: '"Boigelot, Bernard"'
Deciding formulas mixing arithmetic and uninterpreted predicates is of practical interest, notably for applications in verification. Some decision procedures consist in building by structural induction an automaton that recognizes the set of models o
Externí odkaz:
http://arxiv.org/abs/2306.04210
First-order logic fragments mixing quantifiers, arithmetic, and uninterpreted predicates are often undecidable, as is, for instance, Presburger arithmetic extended with a single uninterpreted unary predicate. In the SMT world, difference logic is a q
Externí odkaz:
http://arxiv.org/abs/2305.15059
Given an integer base $b>1$, a set of integers is represented in base $b$ by a language over $\{0,1,...,b-1\}$. The set is said to be $b$-recognisable if its representation is a regular language. It is known that eventually periodic sets are $b$-reco
Externí odkaz:
http://arxiv.org/abs/1702.03715
Autor:
Lens, Stéphane, Boigelot, Bernard
This work studies path planning in two-dimensional space, in the presence of polygonal obstacles. We specifically address the problem of building a roadmap graph, that is, an abstract representation of all the paths that can potentially be followed a
Externí odkaz:
http://arxiv.org/abs/1606.02055
Autor:
Lens, Stéphane, Boigelot, Bernard
This paper studies path synthesis for nonholonomic mobile robots moving in two-dimensional space. We first address the problem of interpolating paths expressed as sequences of straight line segments, such as those produced by some planning algorithms
Externí odkaz:
http://arxiv.org/abs/1508.02608
We study the minmax optimization problem introduced in [22] for computing policies for batch mode reinforcement learning in a deterministic setting. First, we show that this problem is NP-hard. In the two-stage case, we provide two relaxation schemes
Externí odkaz:
http://arxiv.org/abs/1202.5298
Publikováno v:
EPTCS 39, 2010, pp. 63-76
This paper addresses the symbolic representation of non-convex real polyhedra, i.e., sets of real vectors satisfying arbitrary Boolean combinations of linear constraints. We develop an original data structure for representing such sets, based on an i
Externí odkaz:
http://arxiv.org/abs/1011.0221
Publikováno v:
Logical Methods in Computer Science, Volume 6, Issue 1 (February 24, 2010) lmcs:818
This article studies the expressive power of finite automata recognizing sets of real numbers encoded in positional notation. We consider Muller automata as well as the restricted class of weak deterministic automata, used as symbolic set representat
Externí odkaz:
http://arxiv.org/abs/1001.2508
This paper considers finite-automata based algorithms for handling linear arithmetic with both real and integer variables. Previous work has shown that this theory can be dealt with by using finite automata on infinite words, but this involves some d
Externí odkaz:
http://arxiv.org/abs/cs/0303019
Autor:
Boigelot, Bernard, Brusten, Julien
Publikováno v:
In Theoretical Computer Science 2009 410(18):1694-1703