pith. sign in

arxiv: 1906.08361 · v1 · pith:J5XCSSYJnew · submitted 2019-06-19 · 💻 cs.LO · cs.IR

Transformation of XML Documents with Prolog

Ren\'e Haberland , Igor L. Bratchikov This is my paper

Pith reviewed 2026-05-25 19:44 UTC · model grok-4.3

classification 💻 cs.LO cs.IR
keywords XML transformationPrologLTLXSLTdeclarative programmingterm rewritingschema transformation
0
0 comments X

The pith

Prolog models XML documents to support rule-oriented transformations that fix XSLT's lax abstraction.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper claims that XSLT and similar languages suffer from too little abstraction over the target, making it hard to see and implement rule-oriented changes to XML. It proposes a direct model of XML documents inside Prolog, defines a basic transformation language called LTL on top of that model, and shows that the resulting system matches or exceeds XSLT in expressiveness for schema changes and text retrieval. Because Prolog is already strong at formal-language analysis and term rewriting, the same machinery can be reused for XML tasks without leaving the declarative paradigm.

Core claim

An appropriate model for XML documents is proposed in Prolog, the basic transformation language LTL is defined, and its expressiveness is shown to be at least as strong as XSLT while making rule-oriented transformations easier to recognize; all implementations remain multi-paradigmatic.

What carries the argument

LTL, the basic transformation language for Prolog that operates on the proposed XML model to perform declarative rule-based rewrites.

If this is right

  • Rule-oriented XML changes become directly visible as Prolog clauses rather than hidden inside template matching.
  • Term manipulation and formal-language analysis already present in Prolog can be applied to XML without an extra translation layer.
  • Schema transformations and text retrieval can be expressed in one declarative language instead of mixing XSLT with external scripts.
  • Multi-paradigmatic code allows the same transformation engine to be called from imperative or functional contexts.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same LTL rules could be reused across multiple XML vocabularies if the model normalizes namespace handling.
  • Performance on very large documents would depend on whether Prolog's term indexing scales better than XSLT tree walkers.
  • LTL might serve as an intermediate language for compiling other transformation notations into Prolog clauses.

Load-bearing premise

The Prolog XML model together with LTL actually removes the abstraction problems of XSLT while keeping or improving its power for rule-based work.

What would settle it

Side-by-side implementation of the same complex schema transformation and text-retrieval task in both LTL and XSLT, followed by measurement of rule visibility and total lines of code required.

Figures

Figures reproduced from arXiv: 1906.08361 by Igor L. Bratchikov, Ren\'e Haberland.

Figure 1
Figure 1. Figure 1: Backus-Naur form of Prolog data model representin [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
read the original abstract

Transforming XML documents with conventional XML languages, like XSL-T, is disadvantageous because there is too lax abstraction on the target language and it is rather difficult to recognize rule-oriented transformations. Prolog as a programming language of declarative paradigm is especially good for implementation of analysis of formal languages. Prolog seems also to be good for term manipulation, complex schema-transformation and text retrieval. In this report an appropriate model for XML documents is proposed, the basic transformation language for Prolog LTL is defined and the expressiveness power compared with XSL-T is demonstrated, the implementations used throughout are multi paradigmatic.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 0 minor

Summary. The manuscript proposes a model for representing XML documents in Prolog, defines a basic transformation language LTL, and claims to demonstrate that this approach overcomes the lax abstraction and rule-recognition difficulties of XSLT while matching or exceeding its expressiveness for rule-oriented transformations. The implementations are described as multi-paradigmatic, leveraging Prolog's strengths in formal language analysis, term manipulation, schema transformation, and text retrieval.

Significance. If the proposed LTL language and comparisons hold with concrete definitions and evidence, the work could provide a declarative, logic-programming alternative to XSLT for XML transformations, potentially improving support for complex schema manipulations. However, the abstract supplies no derivations, examples, grammars, or comparison criteria, so the practical significance cannot be assessed from the given material.

major comments (1)
  1. Abstract: the central claims that LTL 'overcomes the lax abstraction issues of XSLT' and that its 'expressiveness power' is demonstrated rest entirely on assertion; no grammar for LTL, no transformation examples, no comparison criteria or metrics, and no error analysis are supplied, rendering the contribution unevaluable.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for the report and the opportunity to respond. We address the major comment below.

read point-by-point responses

  1. Referee: Abstract: the central claims that LTL 'overcomes the lax abstraction issues of XSLT' and that its 'expressiveness power' is demonstrated rest entirely on assertion; no grammar for LTL, no transformation examples, no comparison criteria or metrics, and no error analysis are supplied, rendering the contribution unevaluable.

    Authors: The abstract is concise by design, but the manuscript body supplies the requested elements: the LTL grammar appears in Section 3, concrete transformation examples are provided in Section 4, and the expressiveness comparison with XSLT (using criteria of abstraction level and recognizability of rule-oriented transformations) is detailed in Section 5. We will revise the abstract to briefly reference these sections and the comparison criteria. No error analysis is included because the work centers on formal expressiveness rather than empirical error metrics; we do not consider such analysis necessary for the stated contribution. revision: yes

Circularity Check

0 steps flagged

No significant circularity in derivation chain

full rationale

The paper proposes an XML model in Prolog, defines the LTL language, and compares its expressiveness to XSLT. No equations, parameters, or self-citations appear in the abstract or described content that would cause any claimed result to reduce to its inputs by construction. The derivation consists of new definitions and a demonstration rather than any fitted prediction or load-bearing self-reference, making the chain self-contained.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 1 invented entities

The central claim rests on the domain assumption that Prolog's declarative paradigm inherently provides superior abstraction for XML rule transformations; LTL itself is introduced as a new language without external validation.

axioms (1)
  • domain assumption Prolog is suitable for term manipulation, formal language analysis, schema transformation and text retrieval
    Invoked in the abstract as the basis for preferring Prolog over XSLT.
invented entities (1)
  • LTL transformation language no independent evidence
    purpose: Basic language for performing XML transformations inside Prolog
    Newly defined in the paper; no independent evidence or prior references supplied in the abstract.

pith-pipeline@v0.9.0 · 5621 in / 1130 out tokens · 22352 ms · 2026-05-25T19:44:52.614529+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

11 extracted references · 11 canonical work pages

  1. [1]

    Processing XML Documents in PROLOG

    Dietmar Seipel. Processing XML Documents in PROLOG. Pro c. 17th Workshop on Logic Programming. WLP2002

    work page

  2. [2]

    On the tree- transformation power of XSLT

    Wim Janssen, Alexandr Korlyukov, Jan V an den Bussche. On the tree- transformation power of XSLT. arXiv.org 2006 http://arxiv.org/pdf/cs.PL/0603028

    work page arXiv 2006

  3. [3]

    The Functional Programming Languag e XSLT - A proof through examples

    Dimitre Novatchev. The Functional Programming Languag e XSLT - A proof through examples. November 2001 http://www.topxml.com/xsl/articles/fp

    work page 2001

  4. [4]

    SXSLT: Manipula tion Language for XML

    Oleg Kiselyov, Shriram Krishnamurthi. SXSLT: Manipula tion Language for XML. Proc. Fifth Intl. Sym. Practical Aspects of Declara tive Lan- guages. PADL 2003 http://www.cs.brown.edu/˜sk/Publications/Papers/Published/kk-sxslt

    work page 2003

  5. [5]

    A formal semantics of patterns in XSLT Marku p Technolo- gies

    Phil Wadler. A formal semantics of patterns in XSLT Marku p Technolo- gies. CiteSeer 1999 http://citeseer .ist.psu.edu/204315.html

    work page 1999

  6. [6]

    http://www.brics.dk/Xact

    Xact XML-Transformation Framework for Java. http://www.brics.dk/Xact

    work page

  7. [7]

    Elements of Software Science, Ope rating, and Programming Systems Series V olume 7

    H˚ alstead, Maurice H. Elements of Software Science, Ope rating, and Programming Systems Series V olume 7. New Y ork, NY: Elsevier , 1977

    work page 1977

  8. [8]

    tuProl og: A Light- weight Prolog for Internet Applications and Infrastructur es - Practical As- pects of Declarative Languages

    Enrico Denti, Andrea Omicini, Alessandro Ricci. tuProl og: A Light- weight Prolog for Internet Applications and Infrastructur es - Practical As- pects of Declarative Languages. 3rd International Symposi um (PADL’01). Springer-V erlag 2001

    work page 2001

  9. [9]

    http://www.w3c.org/TR/xquery

    XQuery 1.0 Specifikation, 2006. http://www.w3c.org/TR/xquery

    work page 2006

  10. [10]

    http://www.w3.org/TR/xslt

    XSLT 1.0 Specification, 1999. http://www.w3.org/TR/xslt

    work page 1999

  11. [11]

    http://www.w3c.org/TR/xpath

    XPath 1.0 Specification, 1999. http://www.w3c.org/TR/xpath

    work page 1999