Results 41 to 50 of about 26,068 (292)
Decidability of All Minimal Models (Revised Version - 2012) [PDF]
, 2012 This unpublished note is an alternate, shorter (and hopefully more readable) proof of the decidability of all minimal models. The decidability follows from a proof of the existence of a cellular term in each observational equivalence class of a minimal ...
Padovani, Vincent
core +3 more sources
Equivalence-Checking on Infinite-State Systems: Techniques and Results
, 2005 The paper presents a selection of recently developed and/or used techniques for equivalence-checking on infinite-state systems, and an up-to-date overview of existing results (as of September 2004)
Jancar, Petr, Kucera, Antonin
core +1 more source
To the 90th anniversary of the birth of A. I. Kokorin. Stages of scientific and pedagogical way
Известия Иркутского государственного университета: Серия "Математика", 2019 The paper is devoted to the scientific and pedagogical activity of A. I. Kokorin, the founder of the Irkutsk algebraic-logical school, whose 90th anniversary is celebrated in November 2019. Five research areas with the most significant contributions made
V. V. Bludov +3 more
doaj +1 more source
A dependent nominal type theory [PDF]
Logical Methods in Computer Science, 2012 Nominal abstract syntax is an approach to representing names and binding pioneered by Gabbay and Pitts. So far nominal techniques have mostly been studied using classical logic or model theory, not type theory. Nominal extensions to simple, dependent and
James Cheney
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background An international Delphi panel of experts developed consensus statements to delineate the circumstances where the risks of dexamethasone as an antiemetic do and do not outweigh its benefits. Procedure Experts in supportive care of pediatric patients were invited to participate.
Negar Shavandi +20 more
wiley +1 more source
On the Path-Width of Integer Linear Programming [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We consider the feasibility problem of integer linear programming (ILP). We show that solutions of any ILP instance can be naturally represented by an FO-definable class of graphs. For each solution there may be many graphs representing it.
Constantin Enea +3 more
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Blinatumomab has been shown to be highly effective for patients with pediatric B‐ALL and has recently become standard of care therapy. Due to its past use in the clinical trial setting, there is limited information available about real‐world administration.
Katelyn Oranges +12 more
wiley +1 more source
Generalized Post Embedding Problems
, 2014 The Regular Post Embedding Problem extended with partial (co)directness is shown decidable. This extends to universal and/or counting versions.
Karandikar, Prateek +1 more
core +1 more source
Trace Refinement in Labelled Markov Decision Processes [PDF]
Logical Methods in Computer Science, 2020 Given two labelled Markov decision processes (MDPs), the trace-refinement problem asks whether for all strategies of the first MDP there exists a strategy of the second MDP such that the induced labelled Markov chains are trace-equivalent.
Nathanaël Fijalkow +2 more
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Objective To evaluate selumetinib exposure using therapeutic drug monitoring (TDM) in pediatric patients with neurofibromatosis type 1 (NF1) and plexiform neurofibromas (PN), assess interpatient pharmacokinetic variability, and explore the relationship between drug exposure, clinical response, and adverse effects.
Janka Kovács +8 more
wiley +1 more source