"Canonical Logic Programs are Succinctly Incomparable with Propositional ..."

Yuping Shen, Xishun Zhao (2014)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2021-02-09

- view
  - electronic edition @ aaai.org (open access)
- export record
  dblp key:
  - conf/kr/ShenZ14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/kr/ShenZ14
Yuping Shen, Xishun Zhao:
Canonical Logic Programs are Succinctly Incomparable with Propositional Formulas. KR 2014

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.