Complexity in mechanized hypothesis formation
Artifical IntelligenceComputational ComplexityGeneralized QuantifiersGuhaMany-Valued LogicMechanized Hypotheses FormationNon-Classical LogicNp- CompletePredicate CalculusQuantifiers with Statistical Interpretation
Classical first-order logic (03B10) Many-valued logic (03B50) Model theory (03C99) Complexity of computation (including implicit computational complexity) (03D15) Foundations and philosophical topics in statistics (62A01) Applications of statistics (62P99) Analysis of algorithms and problem complexity (68Q25) Artificial intelligence (68T99)
- A comparison of polynomial time reducibilities
- scientific article; zbMATH DE number 3454824 (Why is no real title available?)
- scientific article; zbMATH DE number 3499250 (Why is no real title available?)
- scientific article; zbMATH DE number 3507789 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3550205 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3368175 (Why is no real title available?)
- Mechanizing hypothesis formation. Mathematical foundations for a general theory
- On the Structure of Polynomial Time Reducibility
- Statistical quantifiers in observational calculi: An application in GUHA- methods
- The complexity of theorem-proving procedures
- The GUHA method of automatic hypotheses determination
This page was built for publication: Complexity in mechanized hypothesis formation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1256867)