{"id":"https://openalex.org/W2264172999","doi":"https://doi.org/10.1017/s1471068415000198","title":"Learning weak constraints in answer set programming","display_name":"Learning weak constraints in answer set programming","publication_year":2015,"publication_date":"2015-07-01","ids":{"openalex":"https://openalex.org/W2264172999","doi":"https://doi.org/10.1017/s1471068415000198","mag":"2264172999"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068415000198","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068415000198","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/1507.06566","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"MARK LAW","orcid":null},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"MARK LAW","raw_affiliation_strings":["Department of Computing, Imperial College London, SW7 2AZ (e-mail:"],"affiliations":[{"raw_affiliation_string":"Department of Computing, Imperial College London, SW7 2AZ (e-mail:","institution_ids":["https://openalex.org/I47508984"]}]},{"author_position":"middle","author":{"id":null,"display_name":"ALESSANDRA RUSSO","orcid":null},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"ALESSANDRA RUSSO","raw_affiliation_strings":["Department of Computing, Imperial College London, SW7 2AZ (e-mail:"],"affiliations":[{"raw_affiliation_string":"Department of Computing, Imperial College London, SW7 2AZ (e-mail:","institution_ids":["https://openalex.org/I47508984"]}]},{"author_position":"last","author":{"id":null,"display_name":"KRYSIA BRODA","orcid":null},"institutions":[{"id":"https://openalex.org/I47508984","display_name":"Imperial College London","ror":"https://ror.org/041kmwe10","country_code":"GB","type":"education","lineage":["https://openalex.org/I47508984"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"KRYSIA BRODA","raw_affiliation_strings":["Department of Computing, Imperial College London, SW7 2AZ (e-mail:"],"affiliations":[{"raw_affiliation_string":"Department of Computing, Imperial College London, SW7 2AZ (e-mail:","institution_ids":["https://openalex.org/I47508984"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I47508984"],"apc_list":null,"apc_paid":null,"fwci":2.6797,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.9207699,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"15","issue":"4-5","first_page":"511","last_page":"525"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9876999855041504,"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.9876999855041504,"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.003599999938160181,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.0015999999595806003,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.8402000069618225},{"id":"https://openalex.org/keywords/inductive-logic-programming","display_name":"Inductive logic programming","score":0.8019999861717224},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5507000088691711},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5385000109672546},{"id":"https://openalex.org/keywords/multi-task-learning","display_name":"Multi-task learning","score":0.5382000207901001},{"id":"https://openalex.org/keywords/inductive-reasoning","display_name":"Inductive reasoning","score":0.5138000249862671},{"id":"https://openalex.org/keywords/logic-program","display_name":"Logic program","score":0.5116000175476074},{"id":"https://openalex.org/keywords/inductive-bias","display_name":"Inductive bias","score":0.4909999966621399}],"concepts":[{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.8402000069618225},{"id":"https://openalex.org/C2779382394","wikidata":"https://www.wikidata.org/wiki/Q1464197","display_name":"Inductive logic programming","level":2,"score":0.8019999861717224},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7663999795913696},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5507000088691711},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5385000109672546},{"id":"https://openalex.org/C28006648","wikidata":"https://www.wikidata.org/wiki/Q6934509","display_name":"Multi-task learning","level":3,"score":0.5382000207901001},{"id":"https://openalex.org/C21563000","wikidata":"https://www.wikidata.org/wiki/Q484511","display_name":"Inductive reasoning","level":2,"score":0.5138000249862671},{"id":"https://openalex.org/C2987117450","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic program","level":3,"score":0.5116000175476074},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4932999908924103},{"id":"https://openalex.org/C197352929","wikidata":"https://www.wikidata.org/wiki/Q1074074","display_name":"Inductive bias","level":4,"score":0.4909999966621399},{"id":"https://openalex.org/C50033165","wikidata":"https://www.wikidata.org/wiki/Q15712089","display_name":"Inductive programming","level":3,"score":0.48890000581741333},{"id":"https://openalex.org/C2986563244","wikidata":"https://www.wikidata.org/wiki/Q6822310","display_name":"Learning to learn","level":2,"score":0.46160000562667847},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42329999804496765},{"id":"https://openalex.org/C77967617","wikidata":"https://www.wikidata.org/wiki/Q4677561","display_name":"Active learning (machine learning)","level":2,"score":0.41920000314712524},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.39410001039505005},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.39160001277923584},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.3449999988079071},{"id":"https://openalex.org/C96315309","wikidata":"https://www.wikidata.org/wiki/Q5508829","display_name":"Functional logic programming","level":4,"score":0.30869999527931213},{"id":"https://openalex.org/C24138899","wikidata":"https://www.wikidata.org/wiki/Q17141258","display_name":"Instance-based learning","level":3,"score":0.30090001225471497},{"id":"https://openalex.org/C127001435","wikidata":"https://www.wikidata.org/wiki/Q7595770","display_name":"Stable model semantics","level":4,"score":0.3003999888896942},{"id":"https://openalex.org/C32254414","wikidata":"https://www.wikidata.org/wiki/Q4724364","display_name":"Algorithmic learning theory","level":3,"score":0.2994999885559082},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.2892000079154968},{"id":"https://openalex.org/C189790780","wikidata":"https://www.wikidata.org/wiki/Q933932","display_name":"Horn clause","level":3,"score":0.2777000069618225},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.26109999418258667}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s1471068415000198","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068415000198","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:1507.06566","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1507.06566","pdf_url":"https://arxiv.org/pdf/1507.06566","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"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1507.06566","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1507.06566","pdf_url":"https://arxiv.org/pdf/1507.06566","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":[{"id":"https://openalex.org/G4622081998","display_name":null,"funder_award_id":"EP/K033425/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G4987128381","display_name":null,"funder_award_id":"EP/K033522/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W149611507","https://openalex.org/W228104253","https://openalex.org/W1431464475","https://openalex.org/W1482532598","https://openalex.org/W1499053674","https://openalex.org/W1515481220","https://openalex.org/W1897158219","https://openalex.org/W1924767599","https://openalex.org/W2009605580","https://openalex.org/W2033072307","https://openalex.org/W2051783972","https://openalex.org/W2059310502","https://openalex.org/W2086827285","https://openalex.org/W2129247335","https://openalex.org/W2149253903","https://openalex.org/W2150097634","https://openalex.org/W2151808420","https://openalex.org/W2162404496","https://openalex.org/W2520858206"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"This":[1],"paper":[2],"contributes":[3],"to":[4,80,118,127,141],"the":[5,19,142],"area":[6],"of":[7,21,54,59,68,95,144],"inductive":[8,87],"logic":[9],"programming":[10],"by":[11,49],"presenting":[12],"a":[13,51,69,74,92,107],"new":[14,52,84,108,120],"learning":[15,20,43,85,121,128,145],"framework":[16],"that":[17,63,138],"allows":[18],"weak":[22,47,103,149],"constraints":[23],"in":[24,130],"Answer":[25,35],"Set":[26],"Programming":[27],"(ASP).":[28],"The":[29],"framework,":[30],"called":[31],"Learning":[32],"from":[33],"Ordered":[34],"Sets":[36],",":[37],"generalises":[38],"our":[39,119,158],"previous":[40],"work":[41],"on":[42],"ASP":[44,146],"programs":[45,147],"without":[46,148],"constraints,":[48,150],"considering":[50],"notion":[53],"examples":[55],"as":[56],"ordered":[57],"pairs":[58],"partial":[60],"answer":[61,66],"sets":[62,67],"exemplify":[64],"which":[65,111],"learned":[70],"hypothesis":[71,93],"(together":[72],"with":[73,116],"given":[75],"background":[76],"knowledge)":[77],"are":[78,89],"preferred":[79],"others.":[81],"In":[82],"this":[83],"task":[86,143],"solutions":[88],"searched":[90],"within":[91],"space":[94],"normal":[96],"rules,":[97,99],"choice":[98],"and":[100,102,114,135],"hard":[101],"constraints.":[104],"We":[105,123],"propose":[106],"algorithm,":[109],"ILASP2,":[110],"is":[112],"sound":[113],"complete":[115],"respect":[117],"framework.":[122],"investigate":[124],"its":[125],"applicability":[126],"preferences":[129],"an":[131],"interview":[132],"scheduling":[133],"problem":[134],"also":[136],"demonstrate":[137],"when":[139],"restricted":[140],"ILASP2":[151],"can":[152],"be":[153],"much":[154],"more":[155],"efficient":[156],"than":[157],"previously":[159],"proposed":[160],"system.":[161]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2016-06-24T00:00:00"}