Programs with universally quantified embedded implications

Petukhin, Vyacheslav

doi:10.1007/3-540-63255-7_23

Cited by 3 publications

(2 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the database area, despite extensive work on efficient implementation of high-level queries, efficient implementation of quantification has only been studied in limited scope or for extremely restricted query forms, e.g., [9][10][11]20]. In logic programming, handling of universal quantification is based on variants of brute-force Lloyd-Topor transformations, e.g., [28,66]; even state-of-the-art logic programming systems, e.g., [80], do not support universal quantification. Our method is the first general and systematic method for incrementalizing arbitrary quantifications.…”

Section: Related Work and Conclusionmentioning

confidence: 99%

From clarity to efficiency for distributed algorithms

Liu

Stoller

Lin

et al. 2012

Proceedings of the ACM International Conference on Object Oriented Programming Systems Languages and Applications

View full text Add to dashboard Cite

This article describes a very high-level language for clear description of distributed algorithms and optimizations necessary for generating efficient implementations. The language supports high-level control flows where complex synchronization conditions can be expressed using high-level queries, especially logic quantifications, over message history sequences. Unfortunately, the programs would be extremely inefficient, including consuming unbounded memory, if executed straightforwardly.We present new optimizations that automatically transform complex synchronization conditions into incremental updates of necessary auxiliary values as messages are sent and received. The core of the optimizations is the first general method for efficient implementation of logic quantifications. We have developed an operational semantics of the language, implemented a prototype of the compiler and the optimizations, and successfully used the language and implementation on a variety of important distributed algorithms.

show abstract

Section: Related Work and Conclusionmentioning

confidence: 99%

From clarity to efficiency for distributed algorithms

Liu

Stoller

Lin

et al. 2012

Proceedings of the ACM International Conference on Object Oriented Programming Systems Languages and Applications

View full text Add to dashboard Cite

show abstract

“…In databases, despite extensive work on efficient implementation of high-level queries, efficient implementation of universal quantification has only been studied in limited scope or for extremely restricted query forms, e.g., [5][6][7]12]. In logic programming, implementations of universal quantification are all based on variants of brute-force Lloyd-Topor transformations, e.g., [18,52]; even state-of-the-art logic programming systems [62,69] do not support universal quantification. Our method is the first general and system-atic method for incrementalizing arbitrary quantifications.…”

Section: Related Workmentioning

confidence: 99%

From clarity to efficiency for distributed algorithms

et al. 2012

View full text Add to dashboard Cite

This paper describes a very high-level language for clear description of distributed algorithms and optimizations necessary for generating efficient implementations. The language supports high-level control flows where complex synchronization conditions can be expressed using high-level queries, especially logic quantifications, over message history sequences. Unfortunately, the programs would be extremely inefficient, including consuming unbounded memory, if executed straightforwardly. We present new optimizations that automatically transform complex synchronization conditions into incremental updates of necessary auxiliary values as messages are sent and received. The core of the optimizations is the first general method for efficient implementation of logic quantifications. We have developed an operational semantics of the language, implemented a prototype of the compiler and the optimizations, and successfully used the language and implementation on a variety of important distributed algorithms.

show abstract

Integrating the Completion and the Well Founded Semantics

Osorio¹,

Jayaraman

1998

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Programs with universally quantified embedded implications

Cited by 3 publications

References 8 publications

From clarity to efficiency for distributed algorithms

From clarity to efficiency for distributed algorithms

From clarity to efficiency for distributed algorithms

Integrating the Completion and the Well Founded Semantics

Contact Info

Product

Resources

About