Hypothesis finding with proof theoretical appropriateness criteria
DOI10.1016/J.TCS.2005.10.020zbMATH Open1086.68112OpenAlexW1990145222MaRDI QIDQ817840FDOQ817840
Authors: Bertram Fronhöfer, Akihiro Yamamoto
Publication date: 20 March 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.10.020
Recommendations
relevance logicinductive logicconnection methodabduction and knowledge discoveryhypothesis findingresidue hypotheses
Learning and adaptive systems in artificial intelligence (68T05) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Logic in artificial intelligence (68T27)
Cites Work
- Linear resolution for consequence finding
- Title not available (Why is that?)
- Title not available (Why is that?)
- Abductive Logic Programming
- Title not available (Why is that?)
- A study of relevance for learning in deductive databases
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Inductive inference of monotonic formal systems from positive data
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (5)
This page was built for publication: Hypothesis finding with proof theoretical appropriateness criteria
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817840)