Search results for " pea"
showing 10 items of 887 documents
Querying the Guarded Fragment with Transitivity
2016
We study the problem of answering a union of Boolean conjunctive queries q against a database Δ, and a logical theory φ which falls in the guarded fragment with transitive guards (GF + TG). We trace the frontier between decidability and undecidability of the problem under consideration. Surprisingly, we show that query answering under GF2 + TG, i.e., the two-variable fragment of GF + TG, is already undecidable (even without equality), whereas its monadic fragment is decidable; in fact, it is 2exptime-complete in combined complexity and coNP-complete in data complexity. We also show that for a restricted class of queries, query answering under GF+TG is decidable. © 2013 Springer-Verlag.
Witness computation for solving geometric constraint systems
2014
International audience; In geometric constraint solving, the constraints are represented with an equation system F(U, X) = 0, where X denotes the unknowns and U denotes a set of parameters. The target solution for X is noted XT. A witness is a couple (U_W, X_W) such that F(U_W, X_W) = 0. The witness is not the target solution, but they share the same combinatorial features, even when the witness and the target lie on two distinct connected components of the solution set of F(U, X) = 0. Thus a witness enables the qualitative study of the system: the detection of over- and under-constrained systems, the decomposition into irreducible subsystems, the computation of subsystems boundaries. This …
On the use of relational expressions in the design of efficient algorithms
2005
Relational expressions have finite binary relations as arguments and the operations are composition (·), closure (*), inverse (−1), and union (U). The efficient computation of the relation denoted by a relational expression is considered, and a tight bound is established on the complexity of the algorithm suggested by Hunt, Szymanski and Ullman. The result implies a unified method for deriving efficient algorithms for many problems in parsing. For example, optimal algorithms are derived for strong LL(1) and strong LL(2) parser construction and an efficient polynomialtime algorithm is derived for determining the inessential error entries in an LR(1) parsing table.
Minimal forbidden words and symbolic dynamics
1996
We introduce a new complexity measure of a factorial formal language L: the growth rate of the set of minimal forbidden words. We prove some combinatorial properties of minimal forbidden words. As main result we prove that the growth rate of the set of minimal forbidden words for L is a topological invariant of the dynamical system defined by L.
Matchings in three Catalan lattices
2003
In this note we consider a series of lattices that are enumerated by the well-known Catalan numbers. For each of these lattices, we exhibit a matching in a constructive way.
A Newman property for BLD-mappings
2019
We define a Newman property for BLD-mappings and prove that for a BLD-mapping between generalized manifolds equipped with complete path-metrics, this property is equivalent to the branch set being porous when the codomain is LLC. peerReviewed
Analytical properties of horizontal visibility graphs in the Feigenbaum scenario
2012
Time series are proficiently converted into graphs via the horizontal visibility (HV) algorithm, which prompts interest in its capability for capturing the nature of different classes of series in a network context. We have recently shown [1] that dynamical systems can be studied from a novel perspective via the use of this method. Specifically, the period-doubling and band-splitting attractor cascades that characterize unimodal maps transform into families of graphs that turn out to be independent of map nonlinearity or other particulars. Here we provide an in depth description of the HV treatment of the Feigenbaum scenario, together with analytical derivations that relate to the degree di…
Les partis politiques en Grande-Bretagne
2013
National audience; La vie politique en Grande-Bretagne est marquée par l’une des histoires les plus riches et anciennes d’Europe, mais son originalité reste largement méconnue – surtout par le public francophone, qui la réduit trop souvent à l’affrontement des deux grands partis dominants : Labour et Tories.D’où le présent ouvrage qui analyse l’ensemble des partis politiques, en soulignant la force des changements intervenus récemment en Grande-Bretagne. Fondé sur une définition précise du parti politique, il tient compte des multiples dimensions des organisations partisanes (idéologie-valeurs, ressources, soutiens). Il insiste aussi sur la modernisation des grands partis majoritaires (New …
This time it’s different? Effects of the Eurovision Debate on young citizens’ and its consequence for EU democracy – evidence from a quasi-experiment…
2017
For the very first time in EU history, the 2014 EP elections provided citizens with the opportunity to influence the nomination of the Commission President by casting a vote for the main Europarties’ ‘lead candidates’. By subjecting the position of the Commission President to an open political contest, many experts have formulated the expectation that heightened political competition would strengthen the weak electoral connection between EU citizens and EU legislators, which some consider a root cause for the EU’s lack of public support. In particular, this contest was on display in the so-called ‘Eurovision Debate’, a televised debate between the main contenders for the Commission Presiden…
Documenting Napping: The Agentic Force of Documents and Human Action
2015
The article examines the question of the agentic force of documents in institutional practices and proposes a conceptual model of the agentic relation between documentation and human actors. For this aim, it presents an empirical case study of Finnish early childhood education and care. The study deals with individual education plans (IEPs), which are an example of child documentation that aims at an individualised and participatory pedagogy. The analytical focus is on a single topic of an IEP, the child’s afternoon naps, and how these are negotiated in the three-party encounter between a parent, a practitioner and the IEP document. The theoretical framework draws on the theories of documen…