"Proof complexity of propositional default logic."

Olaf Beyersdorff et al. (2011)

> Home

Details and statistics

DOI: 10.1007/S00153-011-0245-8

access: closed

type: Journal Article

metadata version: 2019-09-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/aml/BeyersdorffMMTV11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/aml/BeyersdorffMMTV11
Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer:
Proof complexity of propositional default logic. Arch. Math. Log. 50(7-8): 727-742 (2011)

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.