Results 41 to 50 of about 324,410 (283)
Knuth-Bendix algorithm and the conjugacy problems in monoids
, 2010 We present an algorithmic approach to the conjugacy problems in monoids, using rewriting systems. We extend the classical theory of rewriting developed by Knuth and Bendix to a rewriting that takes into account the cyclic conjugates.Comment: This is a ...
C. Choffrut +13 more
core +1 more source
Computability Closure: Ten Years Later [PDF]
, 2007 The notion of computability closure has been introduced for proving the termination of higher-order rewriting with first-order matching by Jean-Pierre Jouannaud and Mitsuhiro Okada in a 1997 draft which later served as a basis for the author's PhD.
Blanqui, Frédéric
core +4 more sources
On Constructing Constrained Tree Automata Recognizing Ground Instances of Constrained Terms [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 An inductive theorem proving method for constrained term rewriting systems, which is based on rewriting induction, needs a decision procedure for reduction-completeness of constrained terms.
Naoki Nishida +2 more
doaj +1 more source
A coherence theorem for pseudonatural transformations [PDF]
, 2016 We prove coherence theorems for bicategories, pseudofunctors and pseudonatural transformations. These theorems boil down to proving the coherence of some free $(4,2)$-categories.
Lucas, Maxime
core +6 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Purpose Although not always achieved, complete chemotherapy‐induced nausea and vomiting (CINV) control is the conventional goal of CINV prophylaxis. In this two‐center, mixed‐methods study, we sought to understand the preferences of adolescent patients and family caregivers for CINV control endpoints.
Haley Newman +8 more
wiley +1 more source
Combining typing and size constraints for checking the termination of higher-order conditional rewrite systems [PDF]
, 2006 In a previous work, the first author extended to higher-order rewriting and dependent types the use of size annotations in types, a termination proof technique called type or size based termination and initially developed for ML-like programs.
Blanqui, Frédéric, Riba, Colin
core +4 more sources
Outcomes of Live Virus Vaccination in Patients With Vascular Anomalies Being Treated With Sirolimus
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Live vaccination in patients with vascular anomalies (VA) receiving sirolimus remains controversial due to immunosuppressive effects and theoretical risks. Procedure This single‐center retrospective study included patients with VA less than 4 years old at the start of sirolimus therapy who were incompletely vaccinated.
Svatava Merkle +5 more
wiley +1 more source
Cahiers d’Études RomanesFar from condemning the matrix-text to remain frozen in its anteriority, the primacy of the origin authorizes us, according to Walter Benjamin, to traverse history along a trail of rewritings.
Alexis Nuselovici (Nouss)
doaj +1 more source
Secure Querying of Recursive XML Views: A Standard XPath-based Technique [PDF]
, 2011 Most state-of-the art approaches for securing XML documents allow users to access data only through authorized views defined by annotating an XML grammar (e.g. DTD) with a collection of XPath expressions.
Imine, Abdessamad, Mahfoud, Houari
core +6 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Families of children with cancer experience significant financial strain, even with universal healthcare. Indirect costs, such as productivity losses and non‐medical expenses, are rarely included in economic evaluations, and little is known about how effectively financial aid programmes alleviate this burden. Childhood brain tumours
Megumi Lim +8 more
wiley +1 more source