"The Complexity of Circumscriptive Inference in Post's Lattice."

Michael Thomas (2012)

> Home

Details and statistics

DOI: 10.1007/S00224-010-9311-6

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mst/Thomas12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mst/Thomas12
Michael Thomas:
The Complexity of Circumscriptive Inference in Post's Lattice. Theory Comput. Syst. 50(3): 401-419 (2012)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.