Results 71 to 80 of about 2,591 (261)

Termination of Graph Rewriting is Undecidable

Fundamenta Informaticae, 1998
It is shown that it is undecidable in general whether a graph rewriting system (in the “double pushout approach”) is terminating. The proof is by a reduction of the Post Correspondence Problem. It is also argued that there is no straightforward reduction of the halting problem for Turing machines or of the termination problem for string rewriting ...
openaire   +4 more sources

Evaluating GenAI‐produced feedback on undergraduate bioscience essays against good higher education feedback practice

FEBS Open Bio, EarlyView.
This pilot study investigates the potential of Generative AI to provide formative feedback to students. ChatGPT was prompted to provide feedback on Year 1 Bioscience essays, which were evaluated against established good feedback practices. GenAI‐authored feedback had useful elements, but was limited in scope. GenAI may have potential to provide instant,
Annabel Court, Nigel Francis, Andrew Shore, Stephen Rutherford   +3 more
wiley   +1 more source

The contractum in algebraic graph rewriting [PDF]

, 1996
Algebraic graph rewriting, which works by first removing the part of the graph to be regarded as garbage, and then gluing in the new part of the graph, is contrasted with term graph rewriting, which works by first gluing in the new part of the graph (the contractum) and performing redirections, and then removing garbage.
openaire   +3 more sources

A Strategy Language for Graph Rewriting [PDF]

, 2012
We give a formal semantics for a graph-based programming language, where a program consists of a collection of graph rewriting rules, a user-defined strategy to control the application of rules, and an initial graph to be rewritten. The traditional operators found in strategy languages for term rewriting have been adapted to deal with the more general ...
Kirchner, Helene, Namet, Olivier, Fernandez, Maribel   +2 more
openaire   +2 more sources

Matching and Rewriting Rules in Object-Oriented Databases

Mathematics
Graph query languages such as Cypher are widely adopted to match and retrieve data in a graph representation, due to their ability to retrieve and transform information.
Giacomo Bergami, Oliver Robert Fox, Graham Morgan   +2 more
doaj   +1 more source

Compiling Process Networks to Interaction Nets [PDF]

Electronic Proceedings in Theoretical Computer Science, 2016
Kahn process networks are a model of computation based on a collection of sequential, deterministic processes that communicate by sending messages through unbounded channels. They are well suited for modelling stream-based computations, but are in no way
Ian Mackie
doaj   +1 more source

Relationship Between Neurologic Symptoms and Signs and FMR1 Genotype in Premutation Carriers

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Background and Objectives Fragile X‐associated Tremor/Ataxia Syndrome (FXTAS) is the most severe late‐onset condition caused by a premutation in the FMR1 gene, characterized by expanded CGG triplet repeats of 55–200. Clinical presentations of FXTAS, including gait ataxia, kinetic tremor, cognitive decline, and rare Parkinsonism, are linked to ...
Flora Tassone, Freddy Chafota, Miguel E. Rentería, Randi J. Hagerman, Ellery Santos, Anna Atkinson, Nicholas G. Martin, Elsdon Storey, Danuta Z. Loesch   +8 more
wiley   +1 more source

Prodromal Lewy Body Disorder Features in REM Sleep Behavior Disorder With Biomarker‐Defined Synucleinopathy

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Isolated rapid eye movement sleep behavior disorder (iRBD) is a prodromal state for Lewy body disorders and exhibits biological heterogeneity that may influence clinical expression and progression. We examined clinical features in individuals with iRBD and biomarker‐defined synucleinopathy.
Daniel Weintraub, Michele K. York, Roseanne Dobkin, Anuprita R. Nair, Ryan Kurth, David‐Erick Lafontant, Chelsea Caspell‐Garcia, Roy N. Alcalay, Ethan G. Brown, Lana M. Chahine, Christopher Coffey, Tatiana Foroud, Douglas Galasko, Karl Kieburtz, Kenneth Marek, Kalpana Merchant, Brit Mollenhauer, Kathleen L. Poston, Andrew Siderowf, Cristina Simonet, Tanya Simuni, Caroline M. Tanner, Thomas F. Tropea, Aleksandar Videnovic, The Parkinson's Progression Markers Initiative   +24 more
wiley   +1 more source

On termination of graph rewriting

, 1995
A necessary and sufficient condition for termination of graph rewriting systems is established. Termination is equivalent to the finiteness of all forward closures, being certain minimal derivations in which each step depends on previous steps. This characterization differs from corresponding results for term rewriting in that the latter hold only for ...
openaire   +3 more sources

Set-theoretic graph rewriting [PDF]

, 1994
Considering graphs as sets of vertices and arcs, we define their rewritings as simple set-theoretic rewritings : applying a rule consists of removing the left-hand side and adding the right-hand side. This point of view is explored through some instances.
Raoult, Jean-Claude, Voisin, Frédéric
openaire   +2 more sources