Smarter Features, Simpler Learning?

11/15/2019
by   Sarah Winkler, et al.
0

Earlier work on machine learning for automated reasoning mostly relied on simple, syntactic features combined with sophisticated learning techniques. Using ideas adopted in the software verification community, we propose the investigation of more complex, structural features to learn from. These may be exploited to either learn beneficial strategies for tools, or build a portfolio solver that chooses the most suitable tool for a given problem. We present some ideas for features of term rewrite systems and theorem proving problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/27/2018

AsmetaF: A Flattener for the ASMETA Framework

Abstract State Machines (ASMs) have shown to be a suitable high-level sp...
research
10/10/2018

Formalising Filesystems in the ACL2 Theorem Prover: an Application to FAT32

In this work, we present an approach towards constructing executable spe...
research
07/23/2018

Automating Verification of State Machines with Reactive Designs and Isabelle/UTP

State-machine based notations are ubiquitous in the description of compo...
research
05/25/2018

Automated Verification of Neural Networks: Advances, Challenges and Perspectives

Neural networks are one of the most investigated and widely used techniq...
research
03/10/2023

Lemmas: Generation, Selection, Application

Noting that lemmas are a key feature of mathematics, we engage in an inv...
research
05/08/2015

Short Portfolio Training for CSP Solving

Many different approaches for solving Constraint Satisfaction Problems (...
research
03/29/2023

Questions of science: chatting with ChatGPT about complex systems

We present an overview of the complex systems field using ChatGPT as a r...

Please sign up or login with your details

Forgot password? Click here to reset