Propositional default logics made easier: computational complexity of model checking. (Q1853549): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:11, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Propositional default logics made easier: computational complexity of model checking. |
scientific article |
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
