About: Automatic reordering for dataflow safety of Datalog

Not logged in : Login

(Sponging disallowed)

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Automatic reordering for dataflow safety of Datalog Goto Sponge NotDistinct Permalink

An Entity of Type : bibo:AcademicArticle, within Data Space : demo.openlinksw.com associated with source document(s)

Attributes	Values
type	http://eprints.org/ontology/ArticleEPrint http://eprints.org/ontology/EPrint Article Academic Article
seeAlso	HTML Summary of #68499 Automatic reordering for dataflow safety of Datalog
sameAs	Automatic reordering for dataflow safety of Datalog
http://eprints.org/ontology/hasAccepted	Automatic reordering for dataflow safety of Datalog (PDF)
http://eprints.org/ontology/hasDocument	Automatic reordering for dataflow safety of Datalog (PDF) Automatic reordering for dataflow safety of Datalog (Other)
dc:hasVersion	Automatic reordering for dataflow safety of Datalog (PDF)
Title	Automatic reordering for dataflow safety of Datalog
described by	https://demo.openlinksw.com/about/id/entity/https/www.cs.kent.ac.uk/people/staff/akj22/materials/CO644/export_kar_RDFN3.n3 https://demo.openlinksw.com/about/id/entity/https/raw.githubusercontent.com/annajordanous/CO644Files/main/export_kar_RDFN3.n3
Date	2018-09-03
Creator	Andrew C. Rice Dominic A. Orchard Mistral Contrastin
status	peer reviewed published
Publisher	ACM
abstract	Clauses and subgoals in a Datalog program can be given in any order without affecting program meaning. However, practical applications of the language require the use of built-in or external predicates with particular dataflow requirements. These can be expressed as input or output “modes” on arguments. We describe a static analysis of moding for Datalog which calculates how to transform an ill-moded program into a well-moded program by reordering clause subgoals to satisfy dataflow requirements. We de- scribe an incremental algorithm which efficiently finds a reordering if it exists. This frees the programmer to focus on the declarative specification of a program rather than implementation details of external predicates. We prove that our computed reorderings yield well-moded programs (soundness) and if a program can be made well-moded, then we compute a reordering to do so (completeness).
Is Part Of	Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming https://kar.kent.ac.uk/id/repository
Subject	QA 75 Electronic computers. Computer science
list of authors	https://kar.kent.ac.uk/id/eprint/68499#authors
presented at	20th International Symposium on Principles and Practice of Declarative Programming
is topic of	https://www.cs.kent.ac.uk/people/staff/akj22/materials/CO644/export_kar_RDFN3.n3 https://raw.githubusercontent.com/annajordanous/CO644Files/main/export_kar_RDFN3.n3
is primary topic of	HTML Summary of #68499 Automatic reordering for dataflow safety of Datalog

Faceted Search & Find service v1.17_git149 as of Dec 03 2024

Alternative Linked Data Documents: iSPARQL | ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3332 as of Jan 29 2025, on Linux (x86_64-generic-linux-glibc25), Single-Server Edition (378 GB total memory, 20 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software