Results 51 to 60 of about 494,097 (364)
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
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
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
Decidability in Intuitionistic Type Theory is Functionally Decidable [PDF]
Mathematical Logic Quarterly, 1996 AbstractIn this paper we show that the usual intuitionistic characterization of the decidability of the propositional function B(x) prop [x : A], i. e. to require that the predicate (∀x ∈ A) (B(x) ∨ ¬ B(x)) is provable, is equivalent, when working within the framework of Martin‐Löf's Intuitionistic Type Theory, to require that there exists a decision ...
openaire +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
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
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
Organoids in pediatric cancer research
FEBS Letters, EarlyView.Organoid technology has revolutionized cancer research, yet its application in pediatric oncology remains limited. Recent advances have enabled the development of pediatric tumor organoids, offering new insights into disease biology, treatment response, and interactions with the tumor microenvironment.
Carla Ríos Arceo, Jarno Drost
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
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