NDLI: An approach to automatic deductive synthesis of functional programs

Content Provider	Springer Nature Link
Author	Korukhova, Yulia
Copyright Year	2007
Abstract	The work deals with automatic deductive synthesis of functional programs. Formal specification of a program is taken as a mathematical existence theorem and while proving it, we derive a program and simultaneously prove that this program corresponds to given specification. Several problems have to be resolved for automatic synthesis: the choice of synthesis rules that allows us to derive the basic constructions of a functional program, order of rule application and choice of a particular induction rule. The method proposed here is based on the deductive tableau method. The basic method gives rules for functional program construction. To determine the proof strategy we use some external heuristics, including rippling. And for the induction hypothesis formation the combination of rippling and the deductive tableau method became very useful. The proposed techniques are implemented in the system ALISA (Automatic Lisp Synthesizer) and used for automatic synthesis of several functions in the Lisp language.
Ending Page	271
Page Count	17
Starting Page	255
File Format	PDF
ISSN	10122443
e-ISSN	15737470
Journal	Annals of Mathematics and Artificial Intelligence
Issue Number	3-4
Volume Number	50
Language	English
Publisher	Springer Netherlands
Publisher Date	2007-08-08
Publisher Place	Dordrecht
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Deductive program synthesis Automated reasoning Induction Problem solving (heuristics, search strategies, etc.) Rippling Computer Science Artificial Intelligence (incl. Robotics) Mathematics Proof planning Complexity
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics Artificial Intelligence

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Bagging strategies for learning planning policies

Set-structured and cost-sharing heuristics for classical planning

On look-ahead heuristics in disjunctive logic programming

Planning in domains with derived predicates through rule-action graphs and local search

Argumentation frameworks as constraint satisfaction problems

Mixed deterministic and probabilistic networks

Learning parallel portfolios of algorithms

Heuristics as Markov chains

Fast strong planning for fully observable nondeterministic planning problems

An approach to automatic deductive synthesis of functional programs

Similar Documents

Bagging strategies for learning planning policies

Set-structured and cost-sharing heuristics for classical planning

On look-ahead heuristics in disjunctive logic programming

Planning in domains with derived predicates through rule-action graphs and local search

Argumentation frameworks as constraint satisfaction problems

Mixed deterministic and probabilistic networks

Learning parallel portfolios of algorithms

Heuristics as Markov chains

Fast strong planning for fully observable nondeterministic planning problems

An approach to automatic deductive synthesis of functional programs