"Complexity results for answer set programming with bounded predicate ..."

Thomas Eiter et al. (2007)

> Home

Details and statistics

DOI: 10.1007/S10472-008-9086-5

access: closed

type: Journal Article

metadata version: 2017-11-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/amai/EiterFFW07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/amai/EiterFFW07
Thomas Eiter, Wolfgang Faber, Michael Fink, Stefan Woltran:
Complexity results for answer set programming with bounded predicate arities and implications. Ann. Math. Artif. Intell. 51(2-4): 123-165 (2007)

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.