Document Open Access Logo

Declarative Output by Ordering Text Pieces

Author Stefan Brass

PDF

File

Thumbnail PDF
PDF
LIPIcs.ICLP.2011.151.pdf
  • Filesize: 414 kB
  • 11 pages

Document Identifiers

Subject Classification

Keywords
  • Deductive Databases
  • Logic Programming
  • Declarative Output
  • Bottom-Up Evaluation
  • Order
  • Sorting
  • Implementation

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

Most real-world programs must produce output. If a deductive database is used to implement database application programs, it should be possible to specify the output declaratively. There is no generally accepted, completely satisfying solution for this. In this paper we propose to specify an output document by defining the position of text pieces (building blocks of the document). These text pieces are then ordered by their position and concatenated. This way of specifying output fits well to the bottom-up way of thinking about rules (from right to left) which is common in deductive databases. Of course, when evaluating such programs, one wants to avoid sorting operations as far as possible. We show how rules involving ordering can be efficiently implemented.

Cite As Get BibTex

Stefan Brass. Declarative Output by Ordering Text Pieces. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 151-161, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011) https://doi.org/10.4230/LIPIcs.ICLP.2011.151

Author Details

Stefan Brass
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact