Source: OpenCitations

• E-unification by means of tree tuple synchronized grammars

  Lecture notes in computer science

  Authors : Sébastien Limet, Pierre Réty

  Journal reference : Volume , 1997, pp. 429-440

  DOI : 10.1007/bfb0030616

• Basic Syntactic Mutation

  Lecture notes in computer science

  Authors : Christopher Lynch , Barbara Morawska

  Journal reference : Volume , 2002, pp. 471-485

  DOI : 10.1007/3-540-45620-1_37

• Manipulating Tree Tuple Languages by Transforming Logic Programs1 1Extended abstract; see http://www.logic.at/css/ftp03.pdf for the proofs.

  Electronic Notes in Theoretical Computer Science

  Authors : Sébastien Limet, Gernot Salzer

  Journal reference : Volume 86, 2003, pp. 76-90

  DOI : 10.1016/s1571-0661(04)80654-6

• Solving First Order Formulae of Pseudo-Regular Theory

  Lecture notes in computer science

  Authors : Sébastien Limet, Pierre Pillot

  Journal reference : Volume , 2005, pp. 110-124

  DOI : 10.1007/11560647_7

• Tree Tuple Languages from the Logic Programming Point of View

  Journal of Automated Reasoning

  Authors : Sébastien Limet, Gernot Salzer

  Journal reference : Volume 37, 2007, pp. 323-349

  DOI : 10.1007/s10817-006-9064-8

• A Unified Framework to Compute over Tree Synchronized Grammars and Primal Grammars

  Discrete Mathematics & Theoretical Computer Science

  Authors : Frédéric Saubion , Igor Stéphan

  Journal reference : Volume Vol. 5, 2002, pp.

  DOI : 10.46298/dmtcs.300

• On Implementation of Tree Synchronized Languages

  Lecture notes in computer science

  Authors : Frédéric Saubion , Igor Stéphan

  Journal reference : Volume , 1999, pp. 382-396

  DOI : 10.1007/3-540-48685-2_30

• Proving Properties of Term Rewrite Systems via Logic Programs

  Lecture notes in computer science

  Authors : Sébastien Limet, Gernot Salzer

  Journal reference : Volume , 2004, pp. 170-184

  DOI : 10.1007/978-3-540-25979-4_12