The complexity of model checking for circumscriptive formulae (Q1205713)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of model checking for circumscriptive formulae |
scientific article |
Statements
The complexity of model checking for circumscriptive formulae (English)
0 references
1 April 1993
0 references
The paper provides complexity results for the model checking problem for the circumscription of a propositional formula. It classifies propositional formulae and shows corresponding complexity results for some of the classes.
0 references
nonmonotonic logic
0 references
model checking problem
0 references
circumscription of a propositional formula
0 references
