Synthesis of quantifier-free DNF sentences from inconsistent samples of strings with EF games and SAT (Q2003999)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Synthesis of quantifier-free DNF sentences from inconsistent samples of strings with EF games and SAT |
scientific article; zbMATH DE number 7260168
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Synthesis of quantifier-free DNF sentences from inconsistent samples of strings with EF games and SAT |
scientific article; zbMATH DE number 7260168 |
Statements
Synthesis of quantifier-free DNF sentences from inconsistent samples of strings with EF games and SAT (English)
0 references
13 October 2020
0 references
grammatical inference
0 references
Boolean satisfiability
0 references
Ehrenfeucht-Fraïssé games
0 references
0.8960037231445312
0 references
0.684725284576416
0 references
0.6618446111679077
0 references
0.6573324799537659
0 references
0.6568631529808044
0 references
