Semantic analysis of inductive reasoning

DOI10.1016/0304-3975(86)90167-2zbMath0601.68059OpenAlexW2095441424MaRDI QIDQ1081317

Ewa S. Orłowska

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0304-3975(86)90167-2

zbMATH Keywords

background knowledgeconcept inferencelearning from examples and counterexamplessemantic model of inductive reasoning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (20)

ON DOMINANCE RELATIONS IN DISJUNCTIVE SET-VALUED ORDERED INFORMATION SYSTEMS ⋮ Generalized rough sets based on neighborhood systems and topological spaces ⋮ Set-valued ordered information systems ⋮ European Summer Meeting of the Association for Symbolic Logic, (Logic Colloquium '87), Granada, Spain, 1987 ⋮ Properties of approximation operators over 1-neighborhood systems from the perspective of special granules ⋮ CHOICE FUNCTIONS AND UPPER CHOICE FUNCTIONS ⋮ Rough sets based matrix approaches with dynamic attribute variation in set-valued information systems ⋮ Algebraic properties of \(L\)-fuzzy finite automata ⋮ Characterizations of fuzzy finite automata. ⋮ Data analysis based on discernibility and indiscernibility ⋮ Logic and linguistics meeting, Stanford, 1987 ⋮ Rough fuzzy approximations on two universes of discourse ⋮ Attribute reduction based on evidence theory in incomplete decision systems ⋮ Covering based rough set approximations ⋮ Rough set theory applied to (fuzzy) ideal theory ⋮ A HISTORICAL OVERVIEW OF FUZZY MATHEMATICS ⋮ Set-valued information systems ⋮ Feature selection and approximate reasoning of large-scale set-valued decision tables based on \(\alpha\)-dominance-based quantitative rough sets ⋮ Relational interpretations of neighborhood operators and rough set approximation operators ⋮ Neighborhood operator systems and approximations

Cites Work

• Information systems theoretical foundations
• The logical foundations of statistical inference
• Mechanizing hypothesis formation. Mathematical foundations for a general theory
• Some natural properties of strong-identification in inductive inference
• The semantics of induction and the possibility of complete systems of inductive inference
• Rough sets
• An interference matching technique for inducing abstractions
• A relational model of data for large shared data banks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Semantic analysis of inductive reasoning