Results 51 to 60 of about 26,068 (292)
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
Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages [PDF]
, 2007 The purpose of this paper is to provide efficient algorithms that decide membership for classes of several Boolean hierarchies for which efficiency (or even decidability) were previously not known. We develop new forbidden-chain characterizations for the
Glasser, Christian +2 more
core +7 more sources
Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories [PDF]
Logical Methods in Computer Science, 2013 We define a class of ranked tree automata TABG generalizing both the tree automata with local tests between brothers of Bogaert and Tison (1992) and with global equality and disequality constraints (TAGED) of Filiot et al. (2007).
Luis Barguñó +4 more
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background and Aims Wilms tumour (WT) has excellent event‐free and overall survival (OS). However, small differences exist between countries participating in the same international study. This led us to examine variation in adherence to protocol recommendations as a potential contributing factor.
Suzanne Tugnait +23 more
wiley +1 more source
, 2016 This is a companion to a paper by the authors entitled "G\"odel's natural deduction", which presented and made comments about the natural deduction system in G\"odel's unpublished notes for the elementary logic course he gave at the University of Notre ...
Adzic, Milos, Dosen, Kosta
core +1 more source
On computing fixpoints in well-structured regular model checking, with applications to lossy channel systems [PDF]
, 2006 We prove a general finite convergence theorem for "upward-guarded" fixpoint expressions over a well-quasi-ordered set. This has immediate applications in regular model checking of well-structured systems, where a main issue is the eventual convergence of
A. Arnold +25 more
core +2 more sources
Decidability of Multi-agent Logic of Computation Trees $\mathcal{CTLK}^{Rel}$
Известия Иркутского государственного университета: Серия "Математика"We continue to explore the multi-agent logic of computational trees relative to the relational Kripke semantics of possible worlds: we investigate the question of logical solvability, the complexity of model construction, feasibility testing, and ...
S.I. Bashmakov, K. A. Smelykh
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Objective To evaluate the diagnostic yield and utility of universal paired tumor–normal multigene panel sequencing in newly diagnosed pediatric solid and central nervous system (CNS) tumor patients and to compare the detection of germline pathogenic/likely pathogenic variants (PV/LPVs) against established clinical referral criteria for cancer ...
Natalie Waligorski +9 more
wiley +1 more source
Disjunctive ASP with Functions: Decidable Queries and Effective Computation [PDF]
, 2010 Querying over disjunctive ASP with functions is a highly undecidable task in general. In this paper we focus on disjunctive logic programs with stratified negation and functions under the stable model semantics (ASP^{fs}). We show that query answering in
Bonatti +10 more
core +3 more sources
The logical strength of B\"uchi's decidability theorem [PDF]
Logical Methods in Computer Science, 2019 We study the strength of axioms needed to prove various results related to automata on infinite words and B\"uchi's theorem on the decidability of the MSO theory of $(N, {\le})$.
Leszek Kołodziejczyk +3 more
doaj +1 more source