Genetic programming \(+\) proof search \(=\) automatic improvement
From MaRDI portal
Publication:682376
DOI10.1007/s10817-017-9409-5zbMath1425.68076OpenAlexW2594171547WikidataQ64956725 ScholiaQ64956725MaRDI QIDQ682376
Publication date: 2 February 2018
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10817-017-9409-5
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Uses Software
Cites Work
- Cut-elimination and a permutation-free sequent calculus for intuitionistic logic
- Categories for Software Engineering
- Finger trees: a simple general-purpose data structure
- Dependently Typed Programming in Agda
- Provable isomorphisms of types
- A Methodology for LISP Program Construction from Examples
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Genetic programming \(+\) proof search \(=\) automatic improvement