Results 1 
3 of
3
Algebra of logic programming
 International Conference on Logic Programming
, 1999
"... At present, the field of declarative programming is split into two main areas based on different formalisms; namely, functional programming, which is based on lambda calculus, and logic programming, which is based on firstorder logic. There are currently several language proposals for integrating th ..."
Abstract

Cited by 20 (3 self)
 Add to MetaCart
At present, the field of declarative programming is split into two main areas based on different formalisms; namely, functional programming, which is based on lambda calculus, and logic programming, which is based on firstorder logic. There are currently several language proposals for integrating the expressiveness of these two models of computation. In this thesis we work towards an integration of the methodology from the two research areas. To this end, we propose an algebraic approach to reasoning about logic programs, corresponding to the approach taken in functional programming. In the first half of the thesis we develop and discuss a framework which forms the basis for our algebraic analysis and transformation methods. The framework is based on an embedding of definite logic programs into lazy functional programs in Haskell, such that both the declarative and the operational semantics of the logic programs are preserved. In spite of its conciseness and apparent simplicity, the embedding proves to have many interesting properties and it gives rise to an algebraic semantics of logic programming. It also allows us to reason about logic programs in a simple calculational style, using rewriting and the algebraic laws of combinators. In the embedding, the meaning of a logic program arises compositionally from the meaning of its constituent subprograms and the combinators that connect them. In the second half of the thesis we explore applications of the embedding to the algebraic transformation of logic programs. A series of examples covers simple program derivations, where our techniques simplify some of the current techniques. Another set of examples explores applications of the more advanced program development techniques from the Algebra of Programming by Bird and de Moor [18], where we expand the techniques currently available for logic program derivation and optimisation. To my parents, Sandor and Erzsebet. And the end of all our exploring Will be to arrive where we started And know the place for the first time.
Inductive Logic Programming with WellModedness Constraints
 Proc. Eighth International Workshop on Functional and Logic Programming 1999, Rapport de recherche, RR 1021I, Laboratoire Leibniz, Institut IMAG
, 1999
"... This paper presents an approach to induction of logic programs from examples using a problem decomposition and reduction approach. This is in contrast to the prevailing logic program induction paradigm which relies on generalization of programs from examples. Our induction scheme applies a combin ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This paper presents an approach to induction of logic programs from examples using a problem decomposition and reduction approach. This is in contrast to the prevailing logic program induction paradigm which relies on generalization of programs from examples. Our induction scheme applies a combinatory form of logic programs which is conducive to a topdown inductive synthesis process by its compositional nature. The induction process is subjected to various constraints, notably wellmodedness constraints, which ensure synthesis of wellmoded procedurally acceptable programs. Keywords: logical combinators, recursion combinators, synthesis by composition and specialization, inductive synthesis, program schemata. 1 Introduction Inductive Logic Programming (ILP) is concerned with the construction of logic programs from sample program results and possibly also counterexamples [10, 11]. ILP appeals to the formal logical view on induction according to which induction consists in ge...
Logic Program Synthesis as Problem Reduction Using Combining Forms
, 2001
"... This paper presents an approach to inductive synthesis of logic programs from examples using problem decomposition and problem reduction principles. This is in contrast to the prevailing logic program induction paradigm, which relies on generalization of programs from examples. The problem reduction ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This paper presents an approach to inductive synthesis of logic programs from examples using problem decomposition and problem reduction principles. This is in contrast to the prevailing logic program induction paradigm, which relies on generalization of programs from examples. The problem reduction is accomplished as a constrained topdown search process, which eventually is to reach trivial problems.