Tractable and intractable classes of propositional schemata (Q5498869)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6400835
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tractable and intractable classes of propositional schemata |
scientific article; zbMATH DE number 6400835 |
Statements
Tractable and intractable classes of propositional schemata (English)
0 references
11 February 2015
0 references
propositional logic
0 references
iterated schemata
0 references
satisfiability problem
0 references
complexity
0 references
bounded quantifiers
0 references
0.8780299425125122
0 references
0.8298720121383667
0 references
0.8234479427337646
0 references
0.820225179195404
0 references
0.8028185367584229
0 references
