Results 41 to 50 of about 471,067 (339)
Decidability of higher-order matching [PDF]
Logical Methods in Computer Science, 2009 We show that the higher-order matching problem is decidable using a game-theoretic argument.
Colin Stirling
doaj +1 more source
Decidability of Intelligent Systems [PDF]
حکمت و فلسفه, 2008 Intelligent systems are designed on the model of the operation of mind; but they come across, at least, the following problems: (a) Can IS solve every problem?
mohammad ali hijjati +1 more
doaj +1 more source
On decidability of pure hybrid logic
Lietuvos Matematikos Rinkinys, 2012 In this paper we study a decidable class of pure Hybrid Logic. To prove decidability we use terminating sequent for formulae of H(@) logic.
Stanislovas Norgėla
doaj +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
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
Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture
Applications and Theory of Petri Nets, 2016 In Petri nets with data, every token carries a data value, and executability of a transition is conditioned by a relation between data values involved. Decidability status of various decision problems for Petri nets with data may depend on the structure ...
S. Lasota
semanticscholar +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Pediatric patients with extracranial solid tumors (ST) receiving chemotherapy are at an increased risk for Pneumocystis jirovecii pneumonia (PJP). However, evidence guiding prophylaxis practices in this population is limited. A PJP‐related fatality at our institution highlighted inconsistent prescribing approaches and concerns about
Kriti Kumar +8 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 The pediatric hematology‐oncology fellowship training curriculum has not substantially changed since its inception. The first year of training is clinically focused, and the second and third years are devoted to scholarship. However, this current structure leaves many fellows less competitive in the current job market, resulting in ...
Scott C. Borinstein +3 more
wiley +1 more source