{"id":"https://openalex.org/W2031579642","doi":"https://doi.org/10.1017/s1471068413000094","title":"A multi-engine approach to answer-set programming","display_name":"A multi-engine approach to answer-set programming","publication_year":2013,"publication_date":"2013-08-15","ids":{"openalex":"https://openalex.org/W2031579642","doi":"https://doi.org/10.1017/s1471068413000094","mag":"2031579642"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068413000094","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068413000094","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"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1306.4925","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"MARCO MARATEA","orcid":null},"institutions":[{"id":"https://openalex.org/I83816512","display_name":"University of Genoa","ror":"https://ror.org/0107c5v14","country_code":"IT","type":"education","lineage":["https://openalex.org/I83816512"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"MARCO MARATEA","raw_affiliation_strings":["DIBRIS, Universit\u00e0 degli Studi di Genova, Viale F. Causa 15, 16145 Genova, Italy (e-mail:"],"affiliations":[{"raw_affiliation_string":"DIBRIS, Universit\u00e0 degli Studi di Genova, Viale F. Causa 15, 16145 Genova, Italy (e-mail:","institution_ids":["https://openalex.org/I83816512"]}]},{"author_position":"middle","author":{"id":null,"display_name":"LUCA PULINA","orcid":null},"institutions":[{"id":"https://openalex.org/I159650629","display_name":"University of Sassari","ror":"https://ror.org/01bnjbv91","country_code":"IT","type":"education","lineage":["https://openalex.org/I159650629"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"LUCA PULINA","raw_affiliation_strings":["POLCOMING, Universit\u00e0 degli Studi di Sassari, Viale Mancini 5, 07100 Sassari, Italy (e-mail:"],"affiliations":[{"raw_affiliation_string":"POLCOMING, Universit\u00e0 degli Studi di Sassari, Viale Mancini 5, 07100 Sassari, Italy (e-mail:","institution_ids":["https://openalex.org/I159650629"]}]},{"author_position":"last","author":{"id":null,"display_name":"FRANCESCO RICCA","orcid":null},"institutions":[{"id":"https://openalex.org/I45204951","display_name":"University of Calabria","ror":"https://ror.org/02rc97e94","country_code":"IT","type":"education","lineage":["https://openalex.org/I45204951"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"FRANCESCO RICCA","raw_affiliation_strings":["Dipartimento di Matematica, Universit\u00e0 della Calabria, Via P. Bucci, 87030 Rende, Italy (e-mail:"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica, Universit\u00e0 della Calabria, Via P. Bucci, 87030 Rende, Italy (e-mail:","institution_ids":["https://openalex.org/I45204951"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I83816512"],"apc_list":null,"apc_paid":null,"fwci":1.9926,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.88473754,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"14","issue":"6","first_page":"841","last_page":"868"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9848999977111816,"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.9848999977111816,"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.004000000189989805,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.002099999925121665,"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.8901000022888184},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.7768999934196472},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5724999904632568},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5170000195503235},{"id":"https://openalex.org/keywords/inductive-programming","display_name":"Inductive programming","score":0.43619999289512634},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.4000000059604645}],"concepts":[{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.8901000022888184},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.886900007724762},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7768999934196472},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6345000267028809},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5724999904632568},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5170000195503235},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4659999907016754},{"id":"https://openalex.org/C50033165","wikidata":"https://www.wikidata.org/wiki/Q15712089","display_name":"Inductive programming","level":3,"score":0.43619999289512634},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.4000000059604645},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.3587000072002411},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35040000081062317},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.33959999680519104},{"id":"https://openalex.org/C3019612716","wikidata":"https://www.wikidata.org/wiki/Q730920","display_name":"Problem solver","level":2,"score":0.3068000078201294},{"id":"https://openalex.org/C2779382394","wikidata":"https://www.wikidata.org/wiki/Q1464197","display_name":"Inductive logic programming","level":2,"score":0.30489999055862427},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.29179999232292175},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.2896000146865845},{"id":"https://openalex.org/C146206909","wikidata":"https://www.wikidata.org/wiki/Q531152","display_name":"Declarative programming","level":4,"score":0.2612000107765198}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1017/s1471068413000094","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068413000094","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:1306.4925","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1306.4925","pdf_url":"https://arxiv.org/pdf/1306.4925","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"pmh:oai:iris.unige.it:11567/823199","is_oa":false,"landing_page_url":"http://hdl.handle.net/11567/823199","pdf_url":null,"source":{"id":"https://openalex.org/S4377196291","display_name":"CINECA IRIS Institutial Research Information System (University of Genoa)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I83816512","host_organization_name":"University of Genoa","host_organization_lineage":["https://openalex.org/I83816512"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1306.4925","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1306.4925","pdf_url":"https://arxiv.org/pdf/1306.4925","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W1491267207","https://openalex.org/W1495775210","https://openalex.org/W1495983216","https://openalex.org/W1498722751","https://openalex.org/W1502948544","https://openalex.org/W1505818550","https://openalex.org/W1540443495","https://openalex.org/W1571472016","https://openalex.org/W1587265115","https://openalex.org/W1606891084","https://openalex.org/W1639901403","https://openalex.org/W1766332311","https://openalex.org/W1964680470","https://openalex.org/W1976055110","https://openalex.org/W1997780525","https://openalex.org/W2011124182","https://openalex.org/W2013951121","https://openalex.org/W2043673291","https://openalex.org/W2047003964","https://openalex.org/W2050842068","https://openalex.org/W2076698873","https://openalex.org/W2100699693","https://openalex.org/W2101666345","https://openalex.org/W2106393550","https://openalex.org/W2135514714","https://openalex.org/W2147148915","https://openalex.org/W2150256526","https://openalex.org/W2154996176","https://openalex.org/W2164400088","https://openalex.org/W2295882966","https://openalex.org/W2546238836","https://openalex.org/W2914775474","https://openalex.org/W2950680102","https://openalex.org/W4239510810","https://openalex.org/W4244238212","https://openalex.org/W6636444186","https://openalex.org/W6653586194","https://openalex.org/W6675114216"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"Answer-set":[1],"programming":[2,8],"(ASP)":[3],"is":[4,79,209],"a":[5,68,101,115,141,160,168],"truly":[6],"declarative":[7],"paradigm":[9],"proposed":[10],"in":[11,25,38,140],"the":[12,40,44,96,135,138,145,165,184,188,192,228],"area":[13],"of":[14,30,42,84,117,125,137,167,170,180,191],"non-monotonic":[15],"reasoning":[16],"and":[17,62,87,144,174,177],"logic":[18],"programming,":[19],"which":[20],"has":[21],"been":[22],"recently":[23],"employed":[24],"many":[26],"applications.":[27],"The":[28],"development":[29],"efficient":[31],"ASP":[32,63,70,126,194,206,230],"systems":[33],"is,":[34],"thus,":[35],"crucial.":[36],"Having":[37],"mind":[39],"task":[41],"improving":[43],"solving":[45],"methods":[46,132],"for":[47,93],"ASP,":[48],"there":[49],"are":[50],"two":[51],"usual":[52],"ways":[53],"to":[54,76,80,88,156,159,187,205,211],"reach":[55],"this":[56,105,109],"goal:":[57],"(i)":[58],"extending":[59],"state-of-the-art":[60,85],"techniques":[61,92,204],"solvers":[64,173],"or":[65],"(ii)":[66],"designing":[67],"new":[69],"solver":[71,99,225],"from":[72,183],"scratch.":[73],"An":[74],"alternative":[75],"these":[77,149],"trends":[78],"build":[81],"on":[82,100,148],"top":[83],"solvers,":[86],"apply":[89,130],"machine":[90,202],"learning":[91,203],"choosing":[94],"automatically":[95],"\u201cbest\u201d":[97],"available":[98],"per-instance":[102],"basis.":[103],"In":[104],"paper,":[106],"we":[107,129],"pursue":[108],"latter":[110],"direction.":[111],"We":[112,163],"first":[113],"define":[114],"set":[116,143],"cheap-to-compute":[118],"syntactic":[119],"features":[120,136],"that":[121,199,226],"characterize":[122],"several":[123],"aspects":[124],"programs.":[127],"Then,":[128],"classification":[131],"that,":[133],"given":[134],"instances":[139,181,221],"training":[142,176],"solvers'":[146],"performance":[147],"instances,":[150],"inductively":[151],"learn":[152],"algorithm":[153],"selection":[154],"strategies":[155],"be":[157],"applied":[158],"test":[161,178],"set.":[162],"report":[164],"results":[166],"number":[169],"experiments":[171],"considering":[172],"different":[175],"sets":[179],"taken":[182],"ones":[185],"submitted":[186],"\u201cSystem":[189],"Track\u201d":[190],"Third":[193,229],"Competition.":[195,231],"Our":[196],"analysis":[197],"shows":[198],"by":[200],"applying":[201],"solving,":[207],"it":[208],"possible":[210],"obtain":[212],"very":[213],"robust":[214],"performance:":[215],"our":[216],"approach":[217],"can":[218],"solve":[219],"more":[220],"compared":[222],"with":[223],"any":[224],"entered":[227]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2016-06-24T00:00:00"}