Results 41 to 50 of about 475,794 (375)
Decidability and Undecidability Results for Propositional Schemata [PDF]
Journal of Artificial Intelligence Research, 2014 We define a logic of propositional formula schemata adding to the syntax of propositional logic indexed propositions (e.g., pi) and iterated connectives ∨ or ∧ ranging over intervals parameterized by arithmetic variables (e.g., ∧i-1n pi, where n is a ...
Vincent Aravantinos +2 more
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
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
Equivalence Problems for Tree Transducers: A Brief Survey [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 The decidability of equivalence for three important classes of tree transducers is discussed. Each class can be obtained as a natural restriction of deterministic macro tree transducers (MTTs): (1) no context parameters, i.e., top-down tree transducers, (
Sebastian Maneth
doaj +1 more source
Decidability of second-order theories and automata on infinite trees
, 1968 Introduction. In this paper we solve the decision problem of a certain secondorder mathematical theory and apply it to obtain a large number of decidability results.
M. Rabin
semanticscholar +1 more source
An analytical method for well-formed workflow/Petri net verification of classical soundness
International Journal of Applied Mathematics and Computer Science, 2014 In this paper we consider workflow nets as dynamical systems governed by ordinary difference equations described by a particular class of Petri nets. Workflow nets are a formal model of business processes.
Clempner Julio
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
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
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
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