This paper shows the use of partial-order program clauses and lattice domains for declarative programming. This paradigm is particularly useful for expressing concise solutions to problems from graph theory, program analysis, and database querying. These applications are characterized by a need to solve circular constraints and perform aggregate operations, a capability that is very clearly and efficiently provided by partial-order clauses. We present a novel approach to their declarative and...
%0 Journal Article
%1 Osorio99
%A Osorio, Mauricio
%A Jayaraman, Bharat
%A Plaisted, David A.
%D 1999
%J Science of Computer Programming
%K logic-programming, partial-order, partial-order-programming
%N 3
%P 207--238
%T Theory of partial-order programming
%U http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.1544
%V 34
%X This paper shows the use of partial-order program clauses and lattice domains for declarative programming. This paradigm is particularly useful for expressing concise solutions to problems from graph theory, program analysis, and database querying. These applications are characterized by a need to solve circular constraints and perform aggregate operations, a capability that is very clearly and efficiently provided by partial-order clauses. We present a novel approach to their declarative and...
@article{Osorio99,
abstract = {{This paper shows the use of partial-order program clauses and lattice domains for declarative programming. This paradigm is particularly useful for expressing concise solutions to problems from graph theory, program analysis, and database querying. These applications are characterized by a need to solve circular constraints and perform aggregate operations, a capability that is very clearly and efficiently provided by partial-order clauses. We present a novel approach to their declarative and...}},
added-at = {2011-05-04T16:04:17.000+0200},
author = {Osorio, Mauricio and Jayaraman, Bharat and Plaisted, David A.},
biburl = {https://www.bibsonomy.org/bibtex/22f041979544ca7df98b5930204413cda/baisemain},
citeulike-article-id = {989464},
citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.1544},
interhash = {742abc25ca94efe829bbb817246b4faa},
intrahash = {2f041979544ca7df98b5930204413cda},
journal = {Science of Computer Programming},
keywords = {logic-programming, partial-order, partial-order-programming},
number = 3,
pages = {207--238},
posted-at = {2007-11-01 18:47:33},
priority = {2},
timestamp = {2011-05-04T16:04:37.000+0200},
title = {{Theory of partial-order programming}},
url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.1544},
volume = 34,
year = 1999
}