{"id":"https://openalex.org/W2157356073","doi":"https://doi.org/10.1017/s1471068412000361","title":"Redundant Sudoku rules","display_name":"Redundant Sudoku rules","publication_year":2012,"publication_date":"2012-10-30","ids":{"openalex":"https://openalex.org/W2157356073","doi":"https://doi.org/10.1017/s1471068412000361","mag":"2157356073"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068412000361","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068412000361","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://lirias.kuleuven.be/handle/123456789/353637","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110447732","display_name":"Bart Demoen","orcid":null},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":true,"raw_author_name":"BART DEMOEN","raw_affiliation_strings":["Department of Computer Science, KU Leuven, Belgium (e-mail:","Department of Computer Science, KU Leuven, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, KU Leuven, Belgium (e-mail:","institution_ids":["https://openalex.org/I99464096"]},{"raw_affiliation_string":"Department of Computer Science, KU Leuven, Belgium","institution_ids":["https://openalex.org/I99464096"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083095334","display_name":"Mar\u00eda Garc\u00eda de la Banda","orcid":"https://orcid.org/0000-0002-6666-514X"},"institutions":[{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"MARIA GARCIA DE LA BANDA","raw_affiliation_strings":["Faculty of Information Technology, Monash University, Australia (e-mail:","Faculty of Information Technology, Monash University, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Information Technology, Monash University, Australia (e-mail:","institution_ids":["https://openalex.org/I56590836"]},{"raw_affiliation_string":"Faculty of Information Technology, Monash University, Australia","institution_ids":["https://openalex.org/I56590836"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5110447732"],"corresponding_institution_ids":["https://openalex.org/I99464096"],"apc_list":null,"apc_paid":null,"fwci":2.7767,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.91114392,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"14","issue":"3","first_page":"363","last_page":"377"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11159","display_name":"Manufacturing Process and Optimization","score":0.9164999723434448,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11159","display_name":"Manufacturing Process and Optimization","score":0.9164999723434448,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9024999737739563,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9009000062942505,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7150104641914368},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.7084158658981323},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.680485188961029},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6393811702728271},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4511583745479584},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42122048139572144},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34680742025375366},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.33435744047164917},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26494336128234863},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.13661184906959534}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7150104641914368},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7084158658981323},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.680485188961029},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6393811702728271},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4511583745479584},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42122048139572144},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34680742025375366},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.33435744047164917},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26494336128234863},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.13661184906959534},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1017/s1471068412000361","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068412000361","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:lirias2repo.kuleuven.be:123456789/353637","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/handle/123456789/353637","pdf_url":null,"source":{"id":"https://openalex.org/S4306401954","display_name":"Lirias (KU Leuven)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I99464096","host_organization_name":"KU Leuven","host_organization_lineage":["https://openalex.org/I99464096"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Theory and Practice of Logic Programming, vol. 14 (3)","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:1207.5926","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1207.5926","pdf_url":"https://arxiv.org/pdf/1207.5926","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:lirias2repo.kuleuven.be:123456789/353637","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/handle/123456789/353637","pdf_url":null,"source":{"id":"https://openalex.org/S4306401954","display_name":"Lirias (KU Leuven)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I99464096","host_organization_name":"KU Leuven","host_organization_lineage":["https://openalex.org/I99464096"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Theory and Practice of Logic Programming, vol. 14 (3)","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.5099999904632568,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1972567131","https://openalex.org/W2107082835","https://openalex.org/W2157678272","https://openalex.org/W2404895391","https://openalex.org/W2739325210"],"related_works":["https://openalex.org/W2808944898","https://openalex.org/W4254119641","https://openalex.org/W3196207352","https://openalex.org/W2951724202","https://openalex.org/W3084261076","https://openalex.org/W4387820098","https://openalex.org/W2576399385","https://openalex.org/W2963408011","https://openalex.org/W4236324517","https://openalex.org/W2506223861"],"abstract_inverted_index":{"Abstract":[0],"The":[1,68],"rules":[2],"of":[3,35,37],"Sudoku":[4],"are":[5,41,45],"often":[6],"specified":[7],"using":[8],"27":[9],"all_different":[10],"constraints,":[11,74,80],"referred":[12,75],"to":[13,76],"as":[14,77,83],"the":[15,25,48,78],"big":[16,39],"constraints.":[17],"Using":[18],"graphical":[19],"proofs":[20],"and":[21,28,52],"exploratory":[22],"logic":[23],"programming,":[24],"following":[26],"main":[27],"new":[29],"result":[30,70],"is":[31,54,62,81],"obtained:":[32],"Many":[33],"subsets":[34],"six":[36,53,60],"these":[38],"constraints":[40,61],"redundant":[42],"(i.e.,":[43,56],"they":[44],"entailed":[46],"by":[47],"remaining":[49],"21":[50],"constraints),":[51],"maximal":[55],"removing":[57],"more":[58],"than":[59],"not":[63],"possible":[64],"while":[65],"maintaining":[66],"equivalence).":[67],"corresponding":[69],"for":[71],"binary":[72],"inequality":[73],"small":[79],"stated":[82],"a":[84],"conjecture.":[85]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}