Propositional default logics made easier: computational complexity of model checking. (Q1853549)
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 1857081
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Propositional default logics made easier: computational complexity of model checking. |
scientific article; zbMATH DE number 1857081 |
Statements
Propositional default logics made easier: computational complexity of model checking. (English)
0 references
21 January 2003
0 references
Reiter's default logic
0 references
Normal default theories
0 references
Computational complexity
0 references
Model checking
0 references
EHNF default theories
0 references
Weak extensions
0 references
0.8221495747566223
0 references
0.8200873732566833
0 references
0.8200871348381042
0 references
