{"id":"https://openalex.org/W2617154907","doi":"https://doi.org/10.29007/jvdj","title":"Formally Proving the Boolean Triples Conjecture","display_name":"Formally Proving the Boolean Triples Conjecture","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2617154907","doi":"https://doi.org/10.29007/jvdj","mag":"2617154907"},"language":"en","primary_location":{"id":"pmh:oai:sdu.dk:openaire/e51a8ddd-9752-469b-8270-a08eb90cc8dc","is_oa":true,"landing_page_url":"https://portal.findresearcher.sdu.dk/da/publications/e51a8ddd-9752-469b-8270-a08eb90cc8dc","pdf_url":"https://findresearcher.sdu.dk/ws/files/146531374/Formally_Proving_the_Boolean_Triples_Conjecture.pdf","source":{"id":"https://openalex.org/S4306400423","display_name":"University of Southern Denmark Research Portal (University of Southern Denmark)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177969490","host_organization_name":"University of Southern Denmark","host_organization_lineage":["https://openalex.org/I177969490"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Cruz-Filipe, L & Schneider-Kamp, P 2017, Formally Proving the Boolean Triples Conjecture. in T Eiter & D Sands (eds), Proceedings of LPAR-21 : 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning. EasyChair Publications, EPiC Series in Computing, vol. 46, pp. 509-522, 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Maun, Botswana, 07/05/2017. https://doi.org/10.29007/jvdj","raw_type":"info:eu-repo/semantics/conferenceObject"},"type":"conference-paper","indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://findresearcher.sdu.dk/ws/files/146531374/Formally_Proving_the_Boolean_Triples_Conjecture.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082561369","display_name":"Lu\u0131\u0301s Cruz-Filipe","orcid":"https://orcid.org/0000-0002-7866-7484"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lu\u00eds Cruz-Filipe","raw_affiliation_strings":["Department of Mathematics and Computer Science (IMADA), Computer Science"],"raw_orcid":"https://orcid.org/0000-0002-7866-7484","affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science (IMADA), Computer Science","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058200123","display_name":"Peter Schneider\u2013Kamp","orcid":"https://orcid.org/0000-0003-4000-5570"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Peter Schneider\u2013Kamp","raw_affiliation_strings":["Department of Mathematics and Computer Science (IMADA), Computer Science"],"raw_orcid":"https://orcid.org/0000-0003-4000-5570","affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science (IMADA), Computer Science","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"509","last_page":"522"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9812999963760376,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11567","display_name":"semigroups and automata theory","score":0.9812999963760376,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9807999730110168,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.9761999845504761,"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/conjecture","display_name":"Conjecture","score":0.7120441198348999},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.5705119967460632},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5093196630477905},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.4834076464176178},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42946091294288635},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.4160436689853668},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40793099999427795},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3941271901130676},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.36227843165397644},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3501928448677063},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.1423051357269287}],"concepts":[{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.7120441198348999},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.5705119967460632},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5093196630477905},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.4834076464176178},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42946091294288635},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.4160436689853668},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40793099999427795},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3941271901130676},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.36227843165397644},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3501928448677063},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.1423051357269287}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:sdu.dk:openaire/e51a8ddd-9752-469b-8270-a08eb90cc8dc","is_oa":true,"landing_page_url":"https://portal.findresearcher.sdu.dk/da/publications/e51a8ddd-9752-469b-8270-a08eb90cc8dc","pdf_url":"https://findresearcher.sdu.dk/ws/files/146531374/Formally_Proving_the_Boolean_Triples_Conjecture.pdf","source":{"id":"https://openalex.org/S4306400423","display_name":"University of Southern Denmark Research Portal (University of Southern Denmark)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177969490","host_organization_name":"University of Southern Denmark","host_organization_lineage":["https://openalex.org/I177969490"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Cruz-Filipe, L & Schneider-Kamp, P 2017, Formally Proving the Boolean Triples Conjecture. in T Eiter & D Sands (eds), Proceedings of LPAR-21 : 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning. EasyChair Publications, EPiC Series in Computing, vol. 46, pp. 509-522, 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Maun, Botswana, 07/05/2017. https://doi.org/10.29007/jvdj","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"mag:2617154907","is_oa":false,"landing_page_url":"http://findresearcher.sdu.dk/portal/en/publications/formally-proving-the-boolean-triples-conjecture(e51a8ddd-9752-469b-8270-a08eb90cc8dc).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306419642","display_name":"International Conference on Logic Programming","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"International Conference on Logic Programming","raw_type":null}],"best_oa_location":{"id":"pmh:oai:sdu.dk:openaire/e51a8ddd-9752-469b-8270-a08eb90cc8dc","is_oa":true,"landing_page_url":"https://portal.findresearcher.sdu.dk/da/publications/e51a8ddd-9752-469b-8270-a08eb90cc8dc","pdf_url":"https://findresearcher.sdu.dk/ws/files/146531374/Formally_Proving_the_Boolean_Triples_Conjecture.pdf","source":{"id":"https://openalex.org/S4306400423","display_name":"University of Southern Denmark Research Portal (University of Southern Denmark)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177969490","host_organization_name":"University of Southern Denmark","host_organization_lineage":["https://openalex.org/I177969490"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Cruz-Filipe, L & Schneider-Kamp, P 2017, Formally Proving the Boolean Triples Conjecture. in T Eiter & D Sands (eds), Proceedings of LPAR-21 : 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning. EasyChair Publications, EPiC Series in Computing, vol. 46, pp. 509-522, 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Maun, Botswana, 07/05/2017. https://doi.org/10.29007/jvdj","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2617154907.pdf","grobid_xml":"https://content.openalex.org/works/W2617154907.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2951766895","https://openalex.org/W2469120227","https://openalex.org/W2358247313","https://openalex.org/W2032914202","https://openalex.org/W254959529","https://openalex.org/W2058511598","https://openalex.org/W2066939736","https://openalex.org/W1491504645","https://openalex.org/W2357249222","https://openalex.org/W2302518702","https://openalex.org/W2144626043","https://openalex.org/W1990605856","https://openalex.org/W1983722008","https://openalex.org/W2030362615","https://openalex.org/W2385346565","https://openalex.org/W1832808784","https://openalex.org/W2783511033","https://openalex.org/W1977763297","https://openalex.org/W2043185612","https://openalex.org/W1979519099"],"abstract_inverted_index":{"In":[0,105],"2016,":[1],"Heule,":[2],"Kullmann":[3],"and":[4,44,99,131,169],"Marek":[5],"solved":[6],"the":[7,18,76,85,90,93,100,110,151,156,160,164,170],"Boolean":[8,111],"Pythagorean":[9,24,112],"Triples":[10,113],"problem:":[11],"is":[12],"there":[13,144],"a":[14,34,41,52,63,68,120,127,148,176],"binary":[15],"coloring":[16,53],"of":[17,29,37,81,87,122,135,167,179],"natural":[19,128],"numbers":[20],"such":[21,51],"that":[22,50,96,133,143],"every":[23],"triple":[25],"contains":[26],"an":[27],"element":[28],"each":[30],"color?":[31],"By":[32],"encoding":[33],"finite":[35],"portion":[36],"this":[38,58,106,136],"problem":[39,102,114],"as":[40],"propositional":[42,94,123],"formula":[43,95,137],"showing":[45],"its":[46],"unsatisfiability,":[47],"they":[48],"established":[49],"does":[54,145],"not":[55,146],"exist.":[56],"Subsequently,":[57],"answer":[59],"was":[60,72,97],"verified":[61,177],"by":[62],"correct-by-construction":[64],"checker":[65],"extracted":[66],"from":[67],"Coq":[69],"formalization,":[70],"which":[71],"able":[73],"to":[74,150],"reproduce":[75],"original":[77,165],"proof.":[78],"However,":[79],"none":[80],"these":[82],"works":[83],"address":[84],"question":[86],"formally":[88],"addressing":[89],"relationship":[91],"between":[92],"constructed":[98],"mathematical":[101,157],"being":[103],"considered.":[104],"work,":[107],"we":[108],"formalize":[109,155],"in":[115,163],"Coq.":[116],"We":[117,153],"recursively":[118],"define":[119],"family":[121],"formulas,":[124],"parameterized":[125],"on":[126],"number":[129],"n,":[130],"show":[132],"unsatisfiability":[134,168],"for":[138],"any":[139],"particular":[140],"n":[141],"implies":[142],"exist":[147],"solution":[149],"problem.":[152],"then":[154],"argument":[158,172],"behind":[159],"simplification":[161],"step":[162],"proof":[166,178],"logical":[171],"underlying":[173],"cube-and-conquer,":[174],"obtaining":[175],"Heule":[180],"et":[181],"al.\u2019s":[182],"solution.":[183]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2}],"updated_date":"2026-07-14T23:32:53.992493","created_date":"2025-10-10T00:00:00"}