A technique for creating programs, called programming by induction, is described. The term is used because of the similarity between programming by induction and proving a theorem by induction
This thesis is aimed at simplifying the user-interaction in semi-interactive theorem proving for imp...
In Inductive Logic Programming, predicate invention is the process of introducing a hitherto unknown...
AbstractA basic purpose of transformation systems is the application of ‘correctness-preserving rule...
This paper makes a contribution to the calculational paradigm of program development, a paradigm in ...
A theorem proving system has been programmed for automating mildly complex proofs by structural indu...
Tutorial de 4 horas de duración, aceptado e impartido en: International Conference in Machine Learni...
Mathematical induction is required for reasoning about objects or events containing repe-tition, e.g...
Programming by demonstration is an end-user programming technique that allows people to create progr...
Abstract: Sparkle is a proof assistant designed for the lazy evaluating functional programming langu...
This thesis examines a novel induction-based frameworkfor logic programming. Limiting programs are l...
1 Induction as a Search Procedure This chapter introduces Inductive Logic Programming from the persp...
In the proofs-as-programs methodology, verified programs are developed through theorem-proving in a ...
The use of *proof plans* -- formal patterns of reasoning for theorem proving -- to control the (auto...
Proofs by induction are central to many computer science areas such as data structures, theory of co...
In this paper we propose an approach to skill acquisition which is based on a technique for inductiv...
This thesis is aimed at simplifying the user-interaction in semi-interactive theorem proving for imp...
In Inductive Logic Programming, predicate invention is the process of introducing a hitherto unknown...
AbstractA basic purpose of transformation systems is the application of ‘correctness-preserving rule...
This paper makes a contribution to the calculational paradigm of program development, a paradigm in ...
A theorem proving system has been programmed for automating mildly complex proofs by structural indu...
Tutorial de 4 horas de duración, aceptado e impartido en: International Conference in Machine Learni...
Mathematical induction is required for reasoning about objects or events containing repe-tition, e.g...
Programming by demonstration is an end-user programming technique that allows people to create progr...
Abstract: Sparkle is a proof assistant designed for the lazy evaluating functional programming langu...
This thesis examines a novel induction-based frameworkfor logic programming. Limiting programs are l...
1 Induction as a Search Procedure This chapter introduces Inductive Logic Programming from the persp...
In the proofs-as-programs methodology, verified programs are developed through theorem-proving in a ...
The use of *proof plans* -- formal patterns of reasoning for theorem proving -- to control the (auto...
Proofs by induction are central to many computer science areas such as data structures, theory of co...
In this paper we propose an approach to skill acquisition which is based on a technique for inductiv...
This thesis is aimed at simplifying the user-interaction in semi-interactive theorem proving for imp...
In Inductive Logic Programming, predicate invention is the process of introducing a hitherto unknown...
AbstractA basic purpose of transformation systems is the application of ‘correctness-preserving rule...
.png%3Fwidth%3D300&w=3840&q=75)
Add to ORKG