Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Complexity of Rule Redundancy in Non-ground Answer-Set Programming over ..."

Michael Fink et al. (2007)

> Home

Details and statistics

DOI: 10.1007/978-3-540-72200-7_12

access: closed

type: Conference or Workshop Paper

metadata version: 2017-11-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/lpnmr/FinkPTW07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/lpnmr/FinkPTW07
Michael Fink, Reinhard Pichler, Hans Tompits, Stefan Woltran:
Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains. LPNMR 2007: 123-135

a service of

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.