Analyzing logic programs with dynamic scheduling

Kim Marriott; Maria Lose Garcia de la Banda; Manuel Hermenegildo

Analyzing logic programs with dynamic scheduling

Kim Marriott, Maria Lose Garcia de la Banda, Manuel Hermenegildo

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

Abstract

Traditional logic programming languages, such as Prolog, use a fixed left-to-right atom scheduling rule. Recent logic programming languages, however, usually provide more flexible scheduling in which computation generally proceeds left-to-right but in which some calls are dynamically 'delayed' until their arguments are sufficiently instantiated to allow the call to run efficiently. Such dynamic scheduling has a significant cost. We give a framework for the global analysis of logic programming languages with dynamic scheduling and show that program analysis based on this framework supports optimizations which remove much of the overhead of dynamic scheduling.

Original language	English
Title of host publication	Conference Record of the Annual ACM Symposium on Principles of Programming Languages
Publisher	Association for Computing Machinery (ACM)
Pages	240-253
Number of pages	14
ISBN (Print)	0897916360
Publication status	Published - 1 Jan 1994
Event	Proceedings of the 21st Annual ACM Symposium on Principles of Programming Languages - Portland, OR, USA Duration: 17 Jan 1994 → 21 Jan 1994

Conference

Conference	Proceedings of the 21st Annual ACM Symposium on Principles of Programming Languages
City	Portland, OR, USA
Period	17/01/94 → 21/01/94

Cite this

@inproceedings{f1e4d8a49e034a71b41c935ec337f637,

title = "Analyzing logic programs with dynamic scheduling",

abstract = "Traditional logic programming languages, such as Prolog, use a fixed left-to-right atom scheduling rule. Recent logic programming languages, however, usually provide more flexible scheduling in which computation generally proceeds left-to-right but in which some calls are dynamically 'delayed' until their arguments are sufficiently instantiated to allow the call to run efficiently. Such dynamic scheduling has a significant cost. We give a framework for the global analysis of logic programming languages with dynamic scheduling and show that program analysis based on this framework supports optimizations which remove much of the overhead of dynamic scheduling.",

author = "Kim Marriott and \{de la Banda\}, \{Maria Lose Garcia\} and Manuel Hermenegildo",

year = "1994",

month = jan,

day = "1",

language = "English",

isbn = "0897916360",

pages = "240--253",

booktitle = "Conference Record of the Annual ACM Symposium on Principles of Programming Languages",

publisher = "Association for Computing Machinery (ACM)",

address = "United States of America",

note = "Proceedings of the 21st Annual ACM Symposium on Principles of Programming Languages ; Conference date: 17-01-1994 Through 21-01-1994",

}

Analyzing logic programs with dynamic scheduling. / Marriott, Kim ; de la Banda, Maria Lose Garcia; Hermenegildo, Manuel.
Conference Record of the Annual ACM Symposium on Principles of Programming Languages. Association for Computing Machinery (ACM), 1994. p. 240-253.

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

TY - GEN

T1 - Analyzing logic programs with dynamic scheduling

AU - Marriott, Kim

AU - de la Banda, Maria Lose Garcia

AU - Hermenegildo, Manuel

PY - 1994/1/1

Y1 - 1994/1/1

N2 - Traditional logic programming languages, such as Prolog, use a fixed left-to-right atom scheduling rule. Recent logic programming languages, however, usually provide more flexible scheduling in which computation generally proceeds left-to-right but in which some calls are dynamically 'delayed' until their arguments are sufficiently instantiated to allow the call to run efficiently. Such dynamic scheduling has a significant cost. We give a framework for the global analysis of logic programming languages with dynamic scheduling and show that program analysis based on this framework supports optimizations which remove much of the overhead of dynamic scheduling.

AB - Traditional logic programming languages, such as Prolog, use a fixed left-to-right atom scheduling rule. Recent logic programming languages, however, usually provide more flexible scheduling in which computation generally proceeds left-to-right but in which some calls are dynamically 'delayed' until their arguments are sufficiently instantiated to allow the call to run efficiently. Such dynamic scheduling has a significant cost. We give a framework for the global analysis of logic programming languages with dynamic scheduling and show that program analysis based on this framework supports optimizations which remove much of the overhead of dynamic scheduling.

UR - https://www.scopus.com/pages/publications/0028096385

M3 - Conference Paper

AN - SCOPUS:0028096385

SN - 0897916360

SP - 240

EP - 253

BT - Conference Record of the Annual ACM Symposium on Principles of Programming Languages

PB - Association for Computing Machinery (ACM)

T2 - Proceedings of the 21st Annual ACM Symposium on Principles of Programming Languages

Y2 - 17 January 1994 through 21 January 1994

ER -

Analyzing logic programs with dynamic scheduling

Abstract

Conference

Other files and links

Cite this