"The Complexity of Theorem Proving in Circumscription and Minimal Entailment."

Olaf Beyersdorff, Leroy Chew (2014)

> Home

Details and statistics

DOI: 10.1007/978-3-319-08587-6_32

access: closed

type: Conference or Workshop Paper

metadata version: 2024-02-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cade/BeyersdorffC14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cade/BeyersdorffC14
Olaf Beyersdorff, Leroy Chew:
The Complexity of Theorem Proving in Circumscription and Minimal Entailment. IJCAR 2014: 403-417

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.