Abstract
Partial-order programming is introduced in [JOM95] where it is shown how partial-order clauses help render clear and concise formulations to a different kind of problems, in particular optimization problems. In this paper we present some more examples that we can model using partial-order clauses and we also introduce its Fix-Point semantics. We show that this paradigm and standard logic programming can be naturally integrated in one paradigm. We also discuss WFSCOMP, a new semantics for normal programs, that can be used to give the meaning of general normal+partial-order programs via a translation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
G*87. G. Levi, C. Palamidessi, P.G. Bosco, E. Giovannetti, and C. Moiso, “A Complete Semantic Characterization of K-Leaf: A Logic Language with Functions,” Proc. 5th Intl. Conf. on Logic Programming, Seattle, pp. 993–1005, MIT Press, August 1988.
Hol89. S. Hölldobler, Foundations of Equational Logic Programming, LNAI 353, Springer-Verlag, 1989.
Jan94. D. Jana, Semantics of Subset Logic Languages, Ph.D. dissertation, Department of Computer Science, SUNY-Buffalo, August 1994.
JJ97. D. Jana and B. Jayaraman, “Set Constructors, Finite Sets, and Logical Semantics,” accepted for publication in Journal of Logic Programming.
JO98a. B. Jayaraman and M. Osorio “Theory of Partial-Order Programming”, accepted for publication in Science of computer programming journal.
JO98b. B. Jayaraman and M. Osorio “Relating Aggregation and Negation-as-Failure”, accepted for publication in New Generation Computing.
JOM95. B. Jayaraman, M. Osorio and K. Moon, “Partial Order Programming (revisited)”, Proc. Algebraic Methodology and Software Technology, pp. 561–575. Springer-Verlag, July 1995.
Llo87. J.W. Lloyd, Foundations of Logic Programming (2 ed.), Springer-Verlag, 1987.
Man74. Z. Manna, A Mathematical Theory of Computation, McGraw-Hill Publishers, 1974.
Men87. E. Mendelson, Introduction to Mathematical Logic, 3nd ed., Wadsworth, 1987.
OJ97. M. Osorio and B. Jayaraman, “Aggregation and Well-Founded Semantics+,” Proc. 5th Intl. Workshop on Non-Monotonic Extensions of Logic Programming, pp. 71–90, LNAI 1216, J. Dix, L. Pereira and T. Przymusinski (eds.), Springer-Verlag, 1997.
Prz88. T. Przymusinski, “On the Declarative Semantics of Stratified Deductive Databases and Logic Programs,” Proc. Foundations of Deductive Databases and Logic Programming, J. Minker (ed.), pp. 193–216, Morgan-Kaufmann, 1988.
Sti87. D.R. Stinson, “An introduction to the Design and Analysis of Algorithms”, Winnipeg, Manitoba, Ca., 1987.
Van92. A. Van Gelder, “The Well-Founded Semantics of Aggregation”, Proc. 9th ACM Symp. on Principles of Database Systems, 1990, pp. 205–217.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Osorio, M. (1998). Semantics of Partial-Order Programs. In: Dix, J., del Cerro, L.F., Furbach, U. (eds) Logics in Artificial Intelligence. JELIA 1998. Lecture Notes in Computer Science(), vol 1489. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49545-2_4
Download citation
DOI: https://doi.org/10.1007/3-540-49545-2_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65141-3
Online ISBN: 978-3-540-49545-1
eBook Packages: Springer Book Archive