Theory revision with queries: Horn, read-once, and parity formulas
type: Item
instance of: scholarly article
title: Theory revision with queries: Horn, read-once, and parity formulas
zbMATH Open document ID: 1085.68071
author: J. Goldsmith
author: R. H. Sloan
author: Balázs Szörényi
author: Gy. Turán
published in: Artificial Intelligence
publication date: 2006-02-07T00:00:00Z
Mathematics Subject Classification ID: 68Q32
zbMATH DE Number: 5003958
zbMATH Keywords: Theory revision
zbMATH Keywords: Knowledge revision
zbMATH Keywords: Horn formulas
zbMATH Keywords: Query learning
zbMATH Keywords: Computational learning theory
zbMATH Keywords: Boolean function learning
MaRDI profile type: Publication
full work available at URL: j.artint.2004.01.002
OpenAlex ID: W1970275339
cites work: Complexity theoretic hardness results for query learning
cites work: Q4230377
cites work: Learning regular sets from queries and counterexamples
cites work: Queries and concept learning
cites work: Learning conjunctions of Horn clauses
cites work: Learning read-once formulas with queries
cites work: When won't membership queries help?
cites work: Q4386976
cites work: Structural results about on-line learning models with and without queries
cites work: Fast learning of \(k\)-term DNF formulas with queries.
cites work: Exact learning Boolean functions via the monotone theory
cites work: Attribute-efficient learning in query and mistake-bound models
cites work: Q4230376
cites work: Asking questions to minimize errors
cites work: Effective and efficient knowledge base refinement
cites work: Adaptive versus nonadaptive attribute-efficient learning
cites work: Logical settings for concept-learning
cites work: Structure identification in relational data
cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae
cites work: Q3729902
cites work: More theory revision with queries (extended abstract)
cites work: Theory revision with queries: DNF formulas
cites work: The complexity of revising logic programs
cites work: The complexity of theory revision
cites work: Q4120519
cites work: On sentences which are true of direct unions of algebras
cites work: Combinatorial characterization of read-once formulae
cites work: Cryptographic limitations on learning Boolean formulae and finite automata
cites work: Q4488342
cites work: Q5606985
cites work: Q4386956
cites work: Lower bound methods and separation results for on-line learning models
cites work: Q4023825
cites work: The decision problem for some classes of sentences without quantifiers
cites work: Functions computed by monotone Boolean formulas with no repeated variables
cites work: Theory refinement combining analytical and empirical methods
cites work: Read-twice DNF formulas are properly learnable
cites work: Learning Theory and Kernel Machines
cites work: Knowledge-based artificial neural networks
cites work: Projection learning
cites work: The Semantics of Predicate Logic as a Programming Language
cites work: On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
cites work: Q3762226
cites work: Q4315832
DOI: 10.1016/J.ARTINT.2004.01.002
description: scientific article; zbMATH DE number 5003958