Computing in Horn clause theories
Computing in Horn clause theories
Equivalences of logic programs
Foundations of deductive databases and logic programming
Declarative modeling of the operational behavior of logic languages
Theoretical Computer Science
Foundations of Equational Logic Programming
Foundations of Equational Logic Programming
Kernel-LEAF: a logic plus functional language
Journal of Computer and System Sciences
Logic programming with functions and predicates: the language Babel
Journal of Logic Programming
Deductive and inductive synthesis of equational programs
Journal of Symbolic Computation - Special issue on automatic programming
Handbook of logic in computer science (vol. 2)
Term rewriting and all that
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Context-sensitive rewriting strategies
Information and Computation
Specialization of Recursive Predicates
ECML '95 Proceedings of the 8th European Conference on Machine Learning
A Transformation System for Lazy Functional Logic Programs
FLOPS '99 Proceedings of the 4th Fuji International Symposium on Functional and Logic Programming
Termination of (Canonical) Context-Sensitive Rewriting
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Safe Folding/Unfolding with Conditional Narrowing
ALP '97-HOA '97 Proceedings of the 6th International Joint Conference on Algebraic and Logic Programming
A logic programming approach to the verification of functional-logic programs
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
An integrated framework for the diagnosis and correction of rule-based programs
Theoretical Computer Science
Transformation and debugging of functional logic programs
A 25-year perspective on logic programming
Deciding satisfiability of positive second order joinability formulae
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Hi-index | 0.00 |
We propose a new methodology for synthesizing correct functional logic programs. We aim to create an integrated development environment in which it is possible to debug a program and correct it automatically. We start from a declarative diagnoser that we have developed previously which allows us to identify wrong program rules w.r.t. an intended specification. Then a bug-correction, program synthesis methodology tries to correct the erroneous components of the wrong code. We propose a hybrid, top-down (unfolding-based) as well as bottom-up (induction-based), approach for the automatic correction of functional logic programs which is driven by a set of evidence examples which are automatically produced as an outcome by the diagnoser. The resulting program is proven to be correct and complete w.r.t. the considered example sets. Finally, we also provide a prototypical implementation which we use for an experimental evaluation of our system.