A theory of formal synthesis via inductive learning
From MaRDI portal
Publication:1674868
DOI10.1007/s00236-017-0294-5zbMath1380.68124arXiv1505.03953OpenAlexW258469679MaRDI QIDQ1674868
Publication date: 26 October 2017
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.03953
Learning and adaptive systems in artificial intelligence (68T05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (12)
Satisfiability and synthesis modulo oracles ⋮ A theory of formal synthesis via inductive learning ⋮ Intrinsic complexity of partial learning ⋮ Machine learning and logic: a new frontier in artificial intelligence ⋮ Invariant inference with provable complexity from the monotone theory ⋮ SAT-based invariant inference and its relation to concept learning ⋮ Counterexample-guided inductive synthesis for probabilistic systems ⋮ TeLEx: learning signal temporal logic from positive examples using tightness metric ⋮ Automatic learning from positive data and negative counterexamples ⋮ Programming by predicates: a formal model for interactive synthesis ⋮ Explaining AI decisions using efficient methods for learning sparse Boolean formulae ⋮ Certified DQBF solving by definition extraction
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Teachability in computational learning
- Learning indexed families of recursive languages from positive data: A survey
- Learning regular sets from queries and counterexamples
- An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
- Queries revisited.
- A theory of formal synthesis via inductive learning
- Queries and concept learning
- Formal language identification: query learning vs. gold-style learning
- Iterative learning from positive data and negative counterexamples
- Mining requirements from closed-loop control models
- Learning Binary Relations and Total Orders
- Context-Bounded Analysis For Concurrent Programs With Dynamic Creation of Threads
- Learnability and the Vapnik-Chervonenkis dimension
- Satisfiability Modulo Theories: An Appetizer
- A theory of the learnable
- Graph-Based Algorithms for Boolean Function Manipulation
- Inductive inference of formal languages from positive data
- A Deductive Approach to Program Synthesis
- A Methodology for LISP Program Construction from Examples
- Toward a mathematical theory of inductive inference
- Applied Linear Regression
- From program verification to program synthesis
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Language identification in the limit
This page was built for publication: A theory of formal synthesis via inductive learning
