Search results for "ustice"

showing 10 items of 1381 documents

Testing Grammars for Parsability

1990

In the preceding chapters we have studied in detail the major methods of deterministic context-free parsing: strong LL(k) parsing (Chapter 5), simple precedence parsing (Chapter 5), canonical LR(k) parsing, LALR(k) parsing, and SLR(k) parsing (Chapters 6 and 7), and canonical LL(k) parsing (Chapter 8). Each of these methods induces a class of grammars that are “parsable” using that method, that is, a class of grammars for which a deterministic parser employing that method can be constructed. For example, the LL(k) grammars constitute the class of grammars parsable by the LL(k) parsing method. By definition, a context-free grammar is an LL(k) grammar if and only if its canonical LL(k) parser…

Discrete mathematicsClass (set theory)ParsingFinite-state machineGrammarComputer sciencemedia_common.quotation_subject16. Peace & justicecomputer.software_genreTuring machinesymbols.namesakeRule-based machine translationsymbolsRegular expressionLALR parsercomputermedia_common
researchProduct

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.

Discrete mathematicsClass (set theory)Transitive relationTrace (linear algebra)0102 computer and information sciences02 engineering and technology16. Peace & justice01 natural sciencesDecidabilityUndecidable problemTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESDescription logicFragment (logic)010201 computation theory & mathematics0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingConjunctive queryMathematicsAutomata, Languages, and Programming
researchProduct

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 …

Discrete mathematicsConnected componentMathematical optimization[ INFO ] Computer Science [cs]Numerical algorithmsComputer scienceComputationNumerical analysisSystem FSolution setBinary constraint[INFO] Computer Science [cs]16. Peace & justiceGeometric constraint solvingWitnessSimplex algorithmWitness computation[INFO]Computer Science [cs]
researchProduct

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.

Discrete mathematicsEmpty stringParsingRelation (database)Binary relationTransitive closure0102 computer and information sciences02 engineering and technology16. Peace & justicecomputer.software_genre01 natural sciencesExpression (mathematics)TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESClosure (mathematics)010201 computation theory & mathematics020204 information systems0202 electrical engineering electronic engineering information engineeringTable (database)computerMathematics
researchProduct

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.

Discrete mathematicsFactorial010102 general mathematics[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]Symbolic dynamicsComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS]0102 computer and information sciencesInvariant (physics)16. Peace & justice01 natural sciencesCombinatorics010201 computation theory & mathematicsTheoryofComputation_LOGICSANDMEANINGSOFPROGRAMSInformation complexityFormal language0101 mathematicsComputer Science::Formal Languages and Automata TheoryComputingMilieux_MISCELLANEOUSMathematicsofComputing_DISCRETEMATHEMATICSMathematics
researchProduct

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.

Discrete mathematicsMathematics::CombinatoricsBinary treeHigh Energy Physics::LatticeApplied Mathematics010102 general mathematics0102 computer and information sciences16. Peace & justice01 natural sciencesConstructivelanguage.human_languageComputer Science ApplicationsCatalan numberCombinatoricsComputational Theory and Mathematics010201 computation theory & mathematicsLattice (order)[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]languageCatalan0101 mathematicsComputingMilieux_MISCELLANEOUSMathematics
researchProduct

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

Discrete mathematicsProperty (philosophy)BLD-mappings010102 general mathematicsMetric Geometry (math.MG)30L10 30C65 57M1216. Peace & justice01 natural sciences010101 applied mathematicsSet (abstract data type)Mathematics - Metric GeometryPath (graph theory)FOS: MathematicsGeometry and Topologygeometria0101 mathematicsMathematics
researchProduct

Droit et philosophie à la lumière de l'Encyclopédie

2015

International audience; Quelle place occupe le droit dans l’Encyclopédie de Diderot et de D’Alembert ? Quels rap­ports le mou­ve­ment ency­clo­pé­di­que et l’esprit de la Déclaration des droits de 1789 entre­tien­nent-ils ? Dans cette étude nova­trice, Luigi Delia explore les enjeux du droit dans l’entre­prise emblé­ma­ti­que des Lumières.Encadrée par la publi­ca­tion de deux ouvra­ges fon­da­men­taux – L’Esprit des lois de Montesquieu (1748) et le Traité des délits et des pei­nes de Beccaria (1765) –, l’Encyclopédie pro­pose une nou­velle concep­tion de la jus­tice en fai­sant dia­lo­guer des cultu­res juri­di­ques dif­fé­ren­tes, celle des juris­tes et celle des phi­lo­so­phes. À par­tir …

Droit[ SHS.HIST ] Humanities and Social Sciences/History[SHS.DROIT] Humanities and Social Sciences/LawEncyclopédie[SHS.PHIL]Humanities and Social Sciences/PhilosophyDroit naturel[ SHS.DROIT ] Humanities and Social Sciences/LawCode de l'Humanité[ SHS.PHIL ] Humanities and Social Sciences/Philosophy[SHS.PHIL] Humanities and Social Sciences/PhilosophyBeccariaPhilosophie des Lumières[SHS.DROIT]Humanities and Social Sciences/Law[SHS.HIST] Humanities and Social Sciences/HistoryJustice pénale[SHS.HIST]Humanities and Social Sciences/HistoryMontesquieu
researchProduct

L'accès au droit et à la justice des citoyens en République centrafricaine

2013

Located at the center of Africa, Oubangui Chari, ex French colony reached independence August 13th, 1960 and became the Central Africa Republic. The applicable duty and the legal organization remained strongly influenced by the legal culture of France, some not hesitating to speak about true imitation. Apart from a trend use the technique of “copy-sticking”, it is important to stress that the French right remains applicable on the Central Africa territory under the terms of the PLANTEY ordinance of October 6th, 1958 which granted survival, in the new States having reached independence, with the colonial texts as long as the local legislative power would not have had which in differently…It …

Droit[SHS.DROIT]Humanities and Social Sciences/Law[SHS.DROIT] Humanities and Social Sciences/LawAccèsCitizensJustice[ SHS.DROIT ] Humanities and Social Sciences/LawCitoyensRight (law)
researchProduct

PELIGROSIDAD, ALGORITMOS Y DUE PROCESS: EL CASO STATE vs. LOOMIS

2020

El movimiento contemporáneo tendente a la sustitución de la noción de peligrosidad por el enfoque de la valoración del riesgo (risk assessment), que se inició en el ámbito del derecho penitenciario y de ejecución de las penas, está llegando a otras fases del proceso penal, como la de sentencia. Presentándose como una práctica «basada en la evidencia» (evidence-based sentencing), propugna tomar en consideración las valoraciones estructuradas del riesgo de reincidencia a la hora de determinar la clase y cuantía de la pena a imponer, para adecuarla mejor a las necesidades de prevención especial. El presente trabajo analiza críticamente una de las primeras sentencias de un tribunal supremo esta…

Due processState supreme courtRecidivismOrder (exchange)Face (sociological concept)General MedicineRisk assessmentPsychologySentenceLaw and economicsCriminal justiceRevista de Derecho Penal y Criminología
researchProduct