Complexity in mechanized hypothesis formation

DOI10.1016/0304-3975(79)90045-8zbMath0404.68097OpenAlexW2058392968MaRDI QIDQ1256867

Pavel Pudlák, Frederick Neil Springsteel

Publication date: 1979

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(79)90045-8

zbMATH Keywords

Computational ComplexityPredicate CalculusMany-Valued LogicArtifical IntelligenceGeneralized QuantifiersGuhaMechanized Hypotheses FormationNon-Classical LogicNp- CompleteQuantifiers with Statistical Interpretation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Foundations and philosophical topics in statistics (62A01) Applications of statistics (62P99) Model theory (03C99) Artificial intelligence (68T99) Classical first-order logic (03B10) Complexity of computation (including implicit computational complexity) (03D15) Many-valued logic (03B50)

Related Items (3)

Mathematical aspects of concept analysis ⋮ The GUHA method and its meaning for data mining ⋮ Formal logics of discovery and hypothesis formation by machine

Cites Work

• Statistical quantifiers in observational calculi: An application in GUHA- methods
• A comparison of polynomial time reducibilities
• Mechanizing hypothesis formation. Mathematical foundations for a general theory
• The GUHA method of automatic hypotheses determination
• On the Structure of Polynomial Time Reducibility
• The complexity of theorem-proving procedures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity in mechanized hypothesis formation