{"id":"https://openalex.org/W2478163681","doi":"https://doi.org/10.1017/s1471068416000338","title":"The power of non-ground rules in Answer Set Programming","display_name":"The power of non-ground rules in Answer Set Programming","publication_year":2016,"publication_date":"2016-09-01","ids":{"openalex":"https://openalex.org/W2478163681","doi":"https://doi.org/10.1017/s1471068416000338","mag":"2478163681"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068416000338","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068416000338","pdf_url":null,"source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1608.01856","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109482747","display_name":"M. Bichler","orcid":null},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"MANUEL BICHLER","raw_affiliation_strings":["TU Wien, Vienna, Austria (e-mails:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Wien, Vienna, Austria (e-mails:","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050387054","display_name":"Michael Morak","orcid":"https://orcid.org/0000-0002-2077-7672"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"MICHAEL MORAK","raw_affiliation_strings":["TU Wien, Vienna, Austria (e-mails:"],"raw_orcid":"https://orcid.org/0000-0002-2077-7672","affiliations":[{"raw_affiliation_string":"TU Wien, Vienna, Austria (e-mails:","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006053030","display_name":"Stefan Woltran","orcid":"https://orcid.org/0000-0003-1594-8972"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"STEFAN WOLTRAN","raw_affiliation_strings":["TU Wien, Vienna, Austria (e-mails:"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Wien, Vienna, Austria (e-mails:","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I145847075"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.03886981,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"16","issue":"5-6","first_page":"552","last_page":"569"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10456","display_name":"Multi-Agent Systems and Negotiation","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9828000068664551,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/answer-set-programming","display_name":"Answer set programming","score":0.79571533203125},{"id":"https://openalex.org/keywords/arity","display_name":"Arity","score":0.7932758331298828},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7538577318191528},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6081857681274414},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.5929078459739685},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5773738622665405},{"id":"https://openalex.org/keywords/syntax","display_name":"Syntax","score":0.5740776658058167},{"id":"https://openalex.org/keywords/expressive-power","display_name":"Expressive power","score":0.5480773448944092},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4971311390399933},{"id":"https://openalex.org/keywords/combinatory-logic","display_name":"Combinatory logic","score":0.4853276312351227},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.4694891571998596},{"id":"https://openalex.org/keywords/declarative-programming","display_name":"Declarative programming","score":0.45456650853157043},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.43374183773994446},{"id":"https://openalex.org/keywords/programming-paradigm","display_name":"Programming paradigm","score":0.30209624767303467},{"id":"https://openalex.org/keywords/inductive-programming","display_name":"Inductive programming","score":0.25000977516174316},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24887722730636597},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23236235976219177},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18225017189979553}],"concepts":[{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.79571533203125},{"id":"https://openalex.org/C110546421","wikidata":"https://www.wikidata.org/wiki/Q1315869","display_name":"Arity","level":2,"score":0.7932758331298828},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7538577318191528},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6081857681274414},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.5929078459739685},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5773738622665405},{"id":"https://openalex.org/C60048249","wikidata":"https://www.wikidata.org/wiki/Q37437","display_name":"Syntax","level":2,"score":0.5740776658058167},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.5480773448944092},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4971311390399933},{"id":"https://openalex.org/C79678938","wikidata":"https://www.wikidata.org/wiki/Q1481571","display_name":"Combinatory logic","level":2,"score":0.4853276312351227},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.4694891571998596},{"id":"https://openalex.org/C146206909","wikidata":"https://www.wikidata.org/wiki/Q531152","display_name":"Declarative programming","level":4,"score":0.45456650853157043},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.43374183773994446},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.30209624767303467},{"id":"https://openalex.org/C50033165","wikidata":"https://www.wikidata.org/wiki/Q15712089","display_name":"Inductive programming","level":3,"score":0.25000977516174316},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24887722730636597},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23236235976219177},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18225017189979553},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1017/s1471068416000338","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068416000338","pdf_url":null,"source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1608.01856","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1608.01856","pdf_url":"https://arxiv.org/pdf/1608.01856","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"mag:2478163681","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1608.01856.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.1608.01856","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1608.01856","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1608.01856","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1608.01856","pdf_url":"https://arxiv.org/pdf/1608.01856","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3060162913","display_name":"Extending the Answer-Set Programming Paradigm to Decomposed Problem Solving","funder_award_id":"P 25607","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2478163681.pdf","grobid_xml":"https://content.openalex.org/works/W2478163681.grobid-xml"},"referenced_works_count":32,"referenced_works":["https://openalex.org/W165019675","https://openalex.org/W1554763210","https://openalex.org/W1568597838","https://openalex.org/W1639901403","https://openalex.org/W1672891595","https://openalex.org/W1784178627","https://openalex.org/W1804601140","https://openalex.org/W1969965298","https://openalex.org/W1979514837","https://openalex.org/W2039887949","https://openalex.org/W2049791401","https://openalex.org/W2056850725","https://openalex.org/W2059372025","https://openalex.org/W2065023965","https://openalex.org/W2071784417","https://openalex.org/W2073845305","https://openalex.org/W2085550081","https://openalex.org/W2087432892","https://openalex.org/W2088175080","https://openalex.org/W2091138122","https://openalex.org/W2113211405","https://openalex.org/W2117888397","https://openalex.org/W2121444716","https://openalex.org/W2155378065","https://openalex.org/W2157334516","https://openalex.org/W2169808787","https://openalex.org/W2255903435","https://openalex.org/W2269949982","https://openalex.org/W2294843272","https://openalex.org/W4211177236","https://openalex.org/W6629756183","https://openalex.org/W6677291216"],"related_works":["https://openalex.org/W2964023786","https://openalex.org/W2510852717","https://openalex.org/W2776804019","https://openalex.org/W3036025663","https://openalex.org/W2289854974","https://openalex.org/W3103165021","https://openalex.org/W1550020009","https://openalex.org/W2052553211","https://openalex.org/W2112856950","https://openalex.org/W2011124182","https://openalex.org/W637774","https://openalex.org/W2296197518","https://openalex.org/W2521372713","https://openalex.org/W2539027192","https://openalex.org/W12807312","https://openalex.org/W2963222651","https://openalex.org/W1572150856","https://openalex.org/W2365330911","https://openalex.org/W3211219023","https://openalex.org/W2010266648"],"abstract_inverted_index":{"Abstract":[0],"Answer":[1],"set":[2,48],"programming":[3,9],"(ASP)":[4],"is":[5,32,41,65,172],"a":[6,24,29,47,88,99,102,111,173,199,205],"well-established":[7],"logic":[8],"language":[10],"that":[11,96,191],"offers":[12],"an":[13,71,81],"intuitive,":[14],"declarative":[15],"syntax":[16],"for":[17,28,114],"problem":[18,31,40],"solving.":[19],"In":[20],"its":[21],"traditional":[22],"application,":[23],"fixed":[25,200],"ASP":[26,119],"program":[27,45,201],"given":[30],"designed":[33],"and":[34,60,101,154],"the":[35,39,44,74,105,130,134,151,159,177,194],"actual":[36,131],"instance":[37,132],"of":[38,49,77,93,124,133,148,158,180,197],"fed":[42],"into":[43,87],"as":[46,64],"facts.":[50],"This":[51],"approach":[52,72],"typically":[53],"results":[54],"in":[55,79,118,176],"programs":[56],"with":[57],"comparably":[58],"short":[59,168],"simple":[61],"rules.":[62],"However,":[63],"known":[66],"from":[67,150],"complexity":[68],"analysis,":[69],"such":[70],"limits":[73],"expressive":[75],"power":[76],"ASP;":[78],"fact,":[80],"entire":[82],"NP-check":[83],"can":[84,143,202],"be":[85,144],"encoded":[86],"single":[89],"large":[90,125],"rule":[91,170],"body":[92],"bounded":[94],"arity":[95],"performs":[97],"both":[98],"guess":[100],"check":[103],"within":[104],"same":[106],"rule.":[107],"Here,":[108],"we":[109],"propose":[110],"novel":[112],"paradigm":[113,142],"encoding":[115,141],"hard":[116],"problems":[117,149],"by":[120],"making":[121],"explicit":[122],"use":[123],"rules":[126],"which":[127,189],"depend":[128],"on":[129],"problem.":[135],"We":[136,183],"illustrate":[137],"how":[138],"this":[139],"new":[140],"used,":[145],"providing":[146],"examples":[147],"first,":[152],"second,":[153],"even":[155],"third":[156],"level":[157],"polynomial":[160],"hierarchy.":[161],"As":[162],"state-of-the-art":[163],"solvers":[164],"are":[165],"tuned":[166],"towards":[167],"rules,":[169],"decomposition":[171],"key":[174],"technique":[175],"practical":[178],"realization":[179],"our":[181],"approach.":[182],"also":[184],"provide":[185],"some":[186],"preliminary":[187],"benchmarks":[188],"indicate":[190],"giving":[192],"up":[193],"convenient":[195],"way":[196],"specifying":[198],"lead":[203],"to":[204],"significant":[206],"speed-up.":[207]},"counts_by_year":[],"updated_date":"2026-08-11T07:18:39.950985","created_date":"2025-10-10T00:00:00"}