On finding a first-order sentence consistent with a sample of strings
From MaRDI portal
Recommendations
- Synthesis of a DNF formula from a sample of strings using Ehrenfeucht-Fraïssé games
- On distinguishing sets of structures by first-order sentences of minimal quantifier rank
- Synthesis of quantifier-free DNF sentences from inconsistent samples of strings with EF games and SAT
- Games on Strings with a Limited Order Relation
- Expressive power of existential first-order sentences of Büchi's sequential calculus
Cites work
- An Algorithmic Account of Ehrenfeucht Games on Labeled Successor Structures
- An application of games to the completeness problem for formalized theories
- Classifying regular events in symbolic logic
- Cognitive and sub-regular complexity
- Experiments with reduction finding
- Grammatical inference. Learning automata and grammars.
- scientific article; zbMATH DE number 1342211 (Why is no real title available?)
- scientific article; zbMATH DE number 6999908 (Why is no real title available?)
- scientific article; zbMATH DE number 803291 (Why is no real title available?)
- Inductive logic programming
- Learning first-order definable concepts over structures of small degree
- Logical and Relational Learning
- On separation by locally testable and locally threshold testable languages
- Weak Second‐Order Arithmetic and Finite Automata
Cited in
(3)
This page was built for publication: On finding a first-order sentence consistent with a sample of strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3384892)
