Now showing items 1-11 of 11

    • A logic of graph conditions extended with paths 

      Navarro Gomez, Marisa; Orejas Valdés, Fernando; Pino Blanco, Elvira; Lambers, Leen (2016)
      Conference report
      Open Access
      In this paper we tackle the problem of extending the logic of nested graph conditions with paths. This means, for instance, that we may state properties about the existence of paths between some given nodes. As a main ...
    • A logic of graph conditions extended with paths 

      Navarro Gomez, Marisa; Orejas Valdés, Fernando; Pino Blanco, Elvira; Lambers, Leen (2016)
      Conference report
      Open Access
      In this paper we tackle the problem of extending the logic of nested graph conditions with paths. This means, for instance, that we may state properties about the existence of paths between some given nodes. As a main ...
    • A logic-based incremental approach to graph repair featuring delta preservation 

      Schneider, Sven; Lambers, Leen; Orejas Valdés, Fernando (Springer Nature, 2021-07-07)
      Article
      Open Access
      We introduce a logic-based incremental approach to graph repair, generating a sound and complete (upon termination) overview of least-changing graph repairs from which a user may select a graph repair based on non-formalized ...
    • A navigational logic for reasoning about graph properties 

      Navarro Gómez, Marisa; Orejas Valdés, Fernando; Pino Blanco, Elvira; Lambers, Leen (2021-01)
      Article
      Open Access
      Graphs play an important role in many areas of Computer Science. In particular, our work is motivated by model-driven software development and by graph databases. For this reason, it is very important to have the means to ...
    • Automated reasoning for attributed graph properties 

      Schneider, Sven; Lambers, Leen; Orejas Valdés, Fernando (2018-11)
      Article
      Open Access
      Graphs are ubiquitous in computer science. Moreover, in various application fields, graphs are equipped with attributes to express additional information such as names of entities or weights of relationships. Due to the ...
    • Institutions for navigational logics for graphical structures 

      Orejas Valdés, Fernando; Pino Blanco, Elvira; Navarro Gómez, Marisa; Lambers, Leen (2018-03-05)
      Article
      Open Access
      We show that a Navigational Logic, i.e., a logic to express properties about graphs and about paths in graphs is a semi-exact institution. In this way, we can use a number of operations to structure and modularize our ...
    • M-adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation 

      Ehrig, Hartmut; Golas, Ulrike; Habel, Annegret; Lambers, Leen; Orejas Valdés, Fernando (2014-08-01)
      Article
      Open Access
      Nested application conditions generalise the well-known negative application conditions and are important for several application domains. In this paper, we present Local Church-Rosser, Parallelism, Concurrency and ...
    • Symbolic model generation for graph properties 

      Schneider, Sven; Lambers, Leen; Orejas Valdés, Fernando (Springer, 2017)
      Conference report
      Open Access
      Graphs are ubiquitous in Computer Science. For this reason, in many areas, it is very important to have the means to express and reason about graph properties. In particular, we want to be able to check automatically if a ...
    • Tableau-based reasoning for graph properties 

      Lambers, Leen; Orejas Valdés, Fernando (Springer, 2014)
      Conference report
      Restricted access - publisher's policy
      Graphs are ubiquitous in Computer Science. For this reason, in many areas, it is very important to have the means to express and reason about graph properties. A simple way is based on defining an appropriate encoding of ...
    • Towards a navigational logic for graphical structures 

      Lambers, Leen; Navarro Gomez, Marisa; Orejas Valdés, Fernando; Pino Blanco, Elvira (Springer, 2018)
      Conference report
      Open Access
      One of the main advantages of the Logic of Nested Conditions, defined by Habel and Pennemann, for reasoning about graphs, is its generality: this logic can be used in the framework of many classes of graphs and graphical ...
    • Transformation rules with nested application conditions: Critical pairs, initial conflicts & minimality 

      Lambers, Leen; Orejas Valdés, Fernando (2021-09-07)
      Article
      Open Access
      Recently, initial conflicts were introduced in the framework of M-adhesive categories as an important optimization of critical pairs. In particular, they represent a proper subset such that each conflict is represented in ...