| Annalisa Bossi, Maurizio Gabbrielli, Giorgio Levi, and Maria Chiara Meo. An Or-Compositional Semantics for Logic Programs. In J.-M. Jacquet, editor, Constructing Logic Programs, chapter 10, pages 215--240. Wiley, 1993. |
....the most general unifier (m.g.u. of those solutions 4 . Calculating the m.g.u. 3 For example, X 4 over the finite domain 0. 10 will give rise to 6 solutions. 4 Composition of the programs themselves, and of non disjoint queries, is more complicated, requiring non standard semantics [9]. of two solutions takes time related to the size of the solutions, and not related to the size of the original programs. Similarly, in constraint logic programming, solving the conjunction of two output sets of constraints will depend on the size of the output, not on the size or complexity of ....
Annalisa Bossi, Maurizio Gabbrielli, Giorgio Levi, and Maria Chiara Meo. An Or-Compositional Semantics for Logic Programs. In J.-M. Jacquet, editor, Constructing Logic Programs, chapter 10, pages 215--240. Wiley, 1993.
....[9] But before we can demonstrate this non compositionality, it is necessary to provide an overview of HCLP. 2 For example, X 4 over the finite domain 0. 10 will give rise to 6 solutions. 3 Composition of the programs themselves is more complicated, requiring non standard semantics [3]. 1.3 Hierarchical Constraint Logic Programming A good introduction to HCLP can be found in Molly Wilson s PhD thesis [11, chapter 4] or in the early reference [2] here is a brief overview. Just as Logic Programming can be extended to CLP, so CLP can be extended to a Hierarchical CLP scheme ....
Annalisa Bossi, Maurizio Gabbrielli, Giorgio Levi, and Maria Chiara Meo. An OrCompositional Semantics for Logic Programs. In J.-M. Jacquet, editor, Constructing Logic Programs, pages 215--240. Wiley, 1993.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC