"The computational complexity of ideal semantics."

Paul E. Dunne (2009)

> Home

Details and statistics

DOI: 10.1016/J.ARTINT.2009.09.001

access: closed

type: Journal Article

metadata version: 2020-10-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ai/Dunne09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ai/Dunne09
Paul E. Dunne:
The computational complexity of ideal semantics. Artif. Intell. 173(18): 1559-1591 (2009)

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.