3 citations · 7 across the 8 of their papers we have counts for
8 papers
Abstract Simulation of Reaction Networks
Marie-Eva Fabri, Joachim Niehren, Sara Riva +1
Reaction networks model reactions between a finite set of species. These networks can be associated with different semantics, depending on the type of analysis and the phenomena un…
Linear Programs with Conjunctive Database Queries
Florent Capelli, Nicolas Crosetti, Joachim Niehren +1
In this paper, we study the problem of optimizing a linear program whose variables are the answers to a conjunctive query. For this we propose the language LP(CQ) for specifying li…
Schema-Based Automata Determinization
Joachim Niehren, Momar Sakho, Antonio Al Serhali
We propose an algorithm for schema-based determinization of finite automata on words and of step-wise hedge automata on nested words. The idea is to integrate schema-based cleaning…
Jumping Evaluation of Nested Regular Path Queries
Joachim Niehren, Sylvain Salvati, Rustam Azimov
Nested regular path queries are used for querying graph databases and RDF triple stores. We propose a new algorithm for evaluating nested regular path queries on a graph from a set…
Proceedings Fifth International Workshop on Rewriting Techniques for Program Transformations and Evaluation
Joachim Niehren, David Sabel
This volume contains the formal proceedings of the 5th International Workshop on Rewriting Techniques for Program Transformations and Evaluation (WPTE 2018), held on 8th of Juli 20…
Solving linear programs on factorized databases
Florent Capelli, Nicolas Crosetti, Joachim Niehren +1
A typical workflow for solving a linear programming problem is to first write a linear program parametrized by the data in a language such as Math GNU Prog or AMPL then call the so…
Deterministic Automata for Unordered Trees
Adrien Boiret, Vincent Hugot, Joachim Niehren +1
Automata for unordered unranked trees are relevant for defining schemas and queries for data trees in Json or Xml format. While the existing notions are well-investigated concernin…
Weak subsumption Constraints for Type Diagnosis: An Incremental Algorithm
Martin Mueller, Joachim Niehren
We introduce constraints necessary for type checking a higher-order concurrent constraint language, and solve them with an incremental algorithm. Our constraint system extends rati…