Results 31 to 40 of about 26,068 (292)
Recent Developments on Insertion-Deletion Systems [PDF]
This article gives an overview of the recent developments in the study of the operations of insertion and deletion. It presents the origin of these operations, their formal definition and a series of results concerning language properties, decidability ...
Sergey Verlan
doaj
The Complexity of Combinations of Qualitative Constraint Satisfaction Problems [PDF]
The CSP of a first-order theory $T$ is the problem of deciding for a given finite set $S$ of atomic formulas whether $T \cup S$ is satisfiable. Let $T_1$ and $T_2$ be two theories with countably infinite models and disjoint signatures.
Manuel Bodirsky, Johannes Greiner
doaj +1 more source
The Polyhedron-Hitting Problem [PDF]
We consider polyhedral versions of Kannan and Lipton's Orbit Problem (STOC '80 and JACM '86)---determining whether a target polyhedron V may be reached from a starting point x under repeated applications of a linear transformation A in an ambient vector ...
Chonev, Ventsislav +2 more
core +2 more sources
Decidability of Intelligent Systems [PDF]
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
Decidability of higher-order matching [PDF]
We show that the higher-order matching problem is decidable using a game-theoretic argument.
Colin Stirling
doaj +1 more source
Expansions of MSO by cardinality relations [PDF]
We study expansions of the Weak Monadic Second Order theory of (N,
Bès, Alexis
core +2 more sources
ABSTRACT Pediatric gastroenteropancreatic neuroendocrine neoplasms (GEP‐NENs) are extremely rare and clinically heterogeneous. Management has largely been extrapolated from adult practice. This European Standard Clinical Practice Guideline (ESCP), developed by the EXPeRT network in collaboration with adult NEN experts, provides (adult) evidence ...
Michaela Kuhlen +23 more
wiley +1 more source
Variations of Checking Stack Automata: Obtaining Unexpected Decidability Properties
We introduce a model of one-way language acceptors (a variant of a checking stack automaton) and show the following decidability properties: (1) The deterministic version has a decidable membership problem but has an undecidable emptiness problem.
Ibarra, Oscar H., McQuillan, Ian
core +1 more source
On decidability of pure hybrid logic
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
ABSTRACT Background Oral mucositis is a common and debilitating side effect of childhood cancer and stem cell transplant treatments. It affects the quality of life of children and young people (CYP) and places a strain on services. Photobiomodulation is recommended for oral mucositis prevention in international guidance but is poorly implemented in UK ...
Claudia Heggie +4 more
wiley +1 more source

