On the Termination Problem for Declarative XML Message Processing

Abstract. We define a formal syntax and semantics for the Rule Definition Language (RDL) of DemaqLite, which is a fragment of the declarative XML message processing system Demaq. Based on this definition, we prove that the termination problem for any practically useful sublanguage of DemaqLiteRDL is undecidable, as any such language can emulate a Single Register Machine—a Turing-complete model of computation proposed by Shepherdson and Sturgis.

• Type: Conference
• Year: 2009
• Where: DEXA
• Authors: Tadeusz Litak, Sven Helmer
• Keywords: Database, Declarative Xml Message, DEXA 2009, Machine—a Turing-complete Model, Rule Definition Language