"Complexity of Propositional Abduction for Restricted Sets of Boolean ..."

Nadia Creignou, Johannes Schmidt, Michael Thomas (2010)

> Home

Details and statistics

DOI: —

access: closed

type: Conference or Workshop Paper

metadata version: 2025-12-10

- view
  - electronic edition @ aaai.org
- export record
  dblp key:
  - conf/kr/CreignouST10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/kr/CreignouST10
Nadia Creignou, Johannes Schmidt, Michael Thomas:
Complexity of Propositional Abduction for Restricted Sets of Boolean Functions. KR 2010

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.