Automatic acquisition of search control knowledge from multiple proof attempts.
From MaRDI portal
Publication:1854367
DOI10.1006/INCO.1999.2857zbMATH Open1045.68602OpenAlexW2063042596MaRDI QIDQ1854367FDOQ1854367
Authors: Jörg Denzinger, Stephan Schulz 
Publication date: 14 January 2003
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/1815984bb4e462d8d51a09b1e77fd4c2bfbc5c6b
Recommendations
- scientific article; zbMATH DE number 1882060
- Automatic Learning of Proof Methods in Proof Planning
- Learning search control-knowledge for equational deduction
- Human-centered automated proof search
- scientific article; zbMATH DE number 1737186
- scientific article; zbMATH DE number 2101984
- Automata theoretic account of proof search
- Automating the search for elegant proofs
- Acquiring search-control knowledge via static analysis
Cites Work
- Title not available (Why is that?)
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Recording and analysing knowledge-based distributed deduction processes
- Learning domain knowledge to improve theorem proving
- Title not available (Why is that?)
- The TPTP problem library
- Experiments in the heuristic use of past proof experience
- Distributing equational theorem proving
Cited In (8)
- Acquiring search-control knowledge via static analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Experiments in the heuristic use of past proof experience
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Uses Software
This page was built for publication: Automatic acquisition of search control knowledge from multiple proof attempts.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854367)
