Inductive inference of monotonic formal systems from positive data
type: Item
instance of: scholarly article
title: Inductive inference of monotonic formal systems from positive data
zbMATH Open document ID: 0712.68062
DOI: 10.1007/BF03037094
author: Takeshi Shinohara
published in: New Generation Computing
publication date: 1991-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 03B48
zbMATH DE Number: 4172402
zbMATH Keywords: inductive inference
zbMATH Keywords: formal languages
zbMATH Keywords: logic programs
zbMATH Keywords: monotonicity
zbMATH Keywords: formal systems
MaRDI profile type: Publication
cites work: Inductive inference of formal languages from positive data
cites work: ELEMENTARY FORMAL SYSTEMS AND FORMAL LANGUAGES-SIMPLE FORMAL SYSTEMS
cites work: Q4013548
cites work: Language identification in the limit
cites work: Alternation and the computational complexity of logic programs
cites work: Q4749224
cites work: Q3664455
cites work: Q3746876
cites work: Theory of Formal Systems. (AM-47)
cites work: Q4013550
full work available at URL: https://doi.org/10.1007/bf03037094
OpenAlex ID: W2002663765
Recommended article: Q3746876
Recommended article: Algorithmic Learning Theory
Recommended article: Q3126924
Recommended article: Monotonic and non-monotonic inductive inference
Recommended article: Monotonicity inference for higher-order formulas
Recommended article: Monotonicity Inference for Higher-Order Formulas
Recommended article: Q4282558
Recommended article: Mapping monotonic restrictions in inductive inference
Recommended article: Q3126922
description: scientific article; zbMATH DE number 4172402