Complexity in mechanized hypothesis formation
Computational ComplexityMany-Valued LogicPredicate CalculusArtifical IntelligenceGeneralized QuantifiersGuhaMechanized Hypotheses FormationNon-Classical LogicNp- CompleteQuantifiers with Statistical Interpretation
Foundations and philosophical topics in statistics (62A01) Applications of statistics (62P99) Analysis of algorithms and problem complexity (68Q25) Artificial intelligence (68T99) Many-valued logic (03B50) Classical first-order logic (03B10) Complexity of computation (including implicit computational complexity) (03D15) Model theory (03C99)
- 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?)
- A comparison of polynomial time reducibilities
- 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 GUHA method of automatic hypotheses determination
- The complexity of theorem-proving procedures
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)