"Proof Complexity of Propositional Default Logic."

Olaf Beyersdorff et al. (2010)

> Home

Details and statistics

DOI: 10.1007/978-3-642-14186-7_5

access: closed

type: Conference or Workshop Paper

metadata version: 2019-09-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/sat/BeyersdorffMMTV10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sat/BeyersdorffMMTV10
Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer:
Proof Complexity of Propositional Default Logic. SAT 2010: 30-43

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.