Results 31 to 40 of about 49,212 (323)
Recent Developments on Insertion-Deletion Systems [PDF]
Computer Science Journal of Moldova, 2010 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
Trees over Infinite Structures and Path Logics with Synchronization [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 We provide decidability and undecidability results on the model-checking problem for infinite tree structures. These tree structures are built from sequences of elements of infinite relational structures.
Alex Spelten +2 more
doaj +1 more source
The Complexity of Combinations of Qualitative Constraint Satisfaction Problems [PDF]
Logical Methods in Computer Science, 2020 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
On the (un)decidability of a near-unanimity term [PDF]
, 2007 We investigate the near-unanimity problem: given a finite algebra, decide if it has a near-unanimity term of finite arity. We prove that it is undecidable of a finite algebra if it has a partial near-unanimity term on its underlying set excluding two ...
Maróti, Miklós
core +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
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
Variations of Checking Stack Automata: Obtaining Unexpected Decidability Properties
, 2018 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
Axioms and Decidability for Type Isomorphism in the Presence of Sums [PDF]
, 2014 We consider the problem of characterizing isomorphisms of types, or, equivalently, constructive cardinality of sets, in the simultaneous presence of disjoint unions, Cartesian products, and exponentials.
Ilik, Danko
core +5 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background The HIT network was established in 2000 to create a population‐based structure aiming to improve survival rates and reduce late effects for children with central nervous system (CNS) tumors by conducting comprehensive clinical trials.
Stefan Rutkowski +59 more
wiley +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