Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic

Clavel, Manuel; Meseguer, José; Palomino, Miguel

doi:10.1016/j.tcs.2006.12.009

Cited by 32 publications

(24 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Using these features, it is possible to study how our system behaves, to check whether it is possible to reach a certain state from an initial one, and to analyze whether our system verifies some temporal properties. Moreover, since rewriting logic is reflexive [35], a key distinguishing feature of Maude is its metalevel, which allows users to manipulate Maude modules and terms as standard data [36]. …”

Section: Symbolic Systems Biologymentioning

confidence: 99%

Epidermal Growth Factor Signaling towards Proliferation: Modeling and Logic Inference Using Forward and Backward Search

Riesco

Santos-Buitrago

Rivas

et al. 2017

BioMed Research International

View full text Add to dashboard Cite

In biological systems, pathways define complex interaction networks where multiple molecular elements are involved in a series of controlled reactions producing responses to specific biomolecular signals. These biosystems are dynamic and there is a need for mathematical and computational methods able to analyze the symbolic elements and the interactions between them and produce adequate readouts of such systems. In this work, we use rewriting logic to analyze the cellular signaling of epidermal growth factor (EGF) and its cell surface receptor (EGFR) in order to induce cellular proliferation. Signaling is initiated by binding the ligand protein EGF to the membrane-bound receptor EGFR so as to trigger a reactions path which have several linked elements through the cell from the membrane till the nucleus. We present two different types of search for analyzing the EGF/proliferation system with the help of Pathway Logic tool, which provides a knowledge-based development environment to carry out the modeling of the signaling. The first one is a standard (forward) search. The second one is a novel approach based on narrowing, which allows us to trace backwards the causes of a given final state. The analysis allows the identification of critical elements that have to be activated to provoke proliferation.

show abstract

Section: Symbolic Systems Biologymentioning

confidence: 99%

Epidermal Growth Factor Signaling towards Proliferation: Modeling and Logic Inference Using Forward and Backward Search

Riesco

Santos-Buitrago

Rivas

et al. 2017

BioMed Research International

View full text Add to dashboard Cite

show abstract

“…Exploiting the fact that rewriting logic is reflective [7], an important feature of Maude is its systematic and efficient use of reflection through its predefined META-LEVEL module [6,Chapter 14], a characteristic that allows many advanced metaprogramming and metalanguage applications. This powerful feature allows access to metalevel entities such as specifications or computations as usual data.…”

Section: Implementation Notesmentioning

confidence: 99%

Lifting Term Rewriting Derivations in Constructor Systems by Using Generators

Riesco

Rodríguez-Hortalá²

2015

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

Narrowing is a procedure that was first studied in the context of equational E-unification and that has been used in a wide range of applications. The classic completeness result due to Hullot states that any term rewriting derivation starting from an instance of an expression can be 'lifted' to a narrowing derivation, whenever the substitution employed is normalized. In this paper we adapt the generatorbased extra-variables-elimination transformation used in functional-logic programming to overcome that limitation, so we are able to lift term rewriting derivations starting from arbitrary instances of expressions. The proposed technique is limited to left-linear constructor systems and to derivations reaching a ground expression. We also present a Maude-based implementation of the technique, using natural rewriting for the on-demand evaluation strategy.

show abstract

“…Reflection is a very important property of rewriting logic [102,113,115,116]. Intuitively, a logic is reflective if it can faithfully represent its metalevel at the object level.…”

Section: Reflectionmentioning

confidence: 99%

Twenty years of rewriting logic

Meseguer

2012

The Journal of Logic and Algebraic Programming

Self Cite

162

View full text Add to dashboard Cite

Rewriting logic is a simple computational logic that can naturally express both concurrent computation and logical deduction with great generality. This paper provides a gentle, intuitive introduction to its main ideas, as well as a survey of the work that many researchers have carried out over the last twenty years in advancing: (i) its foundations; (ii) its semantic framework and logical framework uses; (iii) its language implementations and its formal tools; and (iv) its many applications to automated deduction, software and hardware specification and verification, security, real-time and cyber-physical systems, probabilistic systems, bioinformatics and chemical systems.

show abstract

Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic

Cited by 32 publications

References 30 publications

Epidermal Growth Factor Signaling towards Proliferation: Modeling and Logic Inference Using Forward and Backward Search

Epidermal Growth Factor Signaling towards Proliferation: Modeling and Logic Inference Using Forward and Backward Search

Lifting Term Rewriting Derivations in Constructor Systems by Using Generators

Twenty years of rewriting logic

Contact Info

Product

Resources

About