Stop the war!
Остановите войну!
for scientists:
default search action
"Complexity of Answer Set Checking and Bounded Predicate Arities for ..."
Thomas Eiter et al. (2003)
- Thomas Eiter, Wolfgang Faber, Michael Fink, Gerald Pfeifer, Stefan Woltran:
Complexity of Answer Set Checking and Bounded Predicate Arities for Non-ground Answer Set Programming. Answer Set Programming 2003
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.