Now showing items 1-4 of 4

    • The branching-time transformation technique for Chain Datalog programs 

      Γεργατσούλης, Μανώλης; Ροντογιάννης, Παναγιώτης; Gergatsoulis, Manolis; Rondogiannis, Panos (2001)
      The branching-time transformation technique has proven to be an efficient approach for implementing functional programming languages. In this paper we demonstrate that such a technique can also be defined for logic programming ...
    • Implementing enhanced OAI-PMH requirements for Europeana 

      Γαρουφάλλου, Εμμανουήλ; Χούσος, Νίκος; Σταμάτης, Κωνσταντίνος; Μπάνος, Ευάγγελος; Καπιδάκης, Σαράντος; Κουλούρης, Αλέξανδρος; Garoufallou, Emmanouel; Kapidakis, Sarantos; Koulouris, Alexandros; Banos, Vangelis; Houssos, Nikos; Stamatis, Kostas (2011)
      Europeana has put in a stretch many known procedures in digital libraries, imposing requirements difficult to be implemented in many small institutions, often without dedicated systems support personnel. Although there are ...
    • Linearisability on datalog programs 

      Γεργατσούλης, Μανώλης; Αφράτη, Φώτο; Toni, F.; Gergatsoulis, Manolis; Afrati, Foto (2003)
      Linear Datalog programs are programs whose clauses have at most one intensional atom in their bodies. We explore syntactic classes of Datalog programs (syntactically non-linear) which turn out to express no more than the ...
    • A transformation technique for datalog programs based on non-deterministic constructs 

      Γεργατσούλης, Μανώλης; Ροντογιάννης, Παναγιώτης; Ποτίκας, Πέτρος; Gergatsoulis, Manolis; Rondogiannis, Panos; Potikas, Petros (2001)
      Recently, a novel transformation technique for Datalog programs, called the branching-time transformation, was introduced by the authors. In this paper we propose a significant extension of the branching-time transformation ...