"Proof-complexity results for nonmonotonic reasoning."

Uwe Egly, Hans Tompits (2001)

> Home

Details and statistics

DOI: 10.1145/377978.377987

access: closed

type: Journal Article

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tocl/EglyT01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tocl/EglyT01
Uwe Egly, Hans Tompits:
Proof-complexity results for nonmonotonic reasoning. ACM Trans. Comput. Log. 2(3): 340-387 (2001)

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.