{"id":"https://openalex.org/W2137485986","doi":"https://doi.org/10.1017/s147106840300190x","title":"Speedup of logic programs by binarization and partial deduction","display_name":"Speedup of logic programs by binarization and partial deduction","publication_year":2004,"publication_date":"2004-04-16","ids":{"openalex":"https://openalex.org/W2137485986","doi":"https://doi.org/10.1017/s147106840300190x","mag":"2137485986"},"language":"en","primary_location":{"id":"doi:10.1017/s147106840300190x","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s147106840300190x","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":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5091830970","display_name":"Jan Hr\u016fza","orcid":null},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"JAN HR\u016eZA","raw_affiliation_strings":["Department of Theoretical Computer Science and Mathematical Logic, Charles University, Malostransk\u00e9 n\u00e1m\u011bst\u00ed 25, 118 00 Praha 1, Czech Republic (e-mail:","Department of Theoretical Computer Science and Mathematical Logic, Charles University, Malostransk\u00e9 n\u00e1m\u011bst\u00ed 25, 118 00 Praha 1, Czech Republic (e-mail: hruza@kti.mff.cuni.cz)#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Theoretical Computer Science and Mathematical Logic, Charles University, Malostransk\u00e9 n\u00e1m\u011bst\u00ed 25, 118 00 Praha 1, Czech Republic (e-mail:","institution_ids":["https://openalex.org/I21250087"]},{"raw_affiliation_string":"Department of Theoretical Computer Science and Mathematical Logic, Charles University, Malostransk\u00e9 n\u00e1m\u011bst\u00ed 25, 118 00 Praha 1, Czech Republic (e-mail: hruza@kti.mff.cuni.cz)#TAB#","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090896394","display_name":"PETER \u0161T\u011aP\u00c1NEK","orcid":null},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"PETER \u0161T\u011aP\u00c1NEK","raw_affiliation_strings":["Department of Theoretical Computer Science and Mathematical Logic, Charles University, Malostransk\u00e9 n\u00e1m\u011bst\u00ed 25, 118 00 Praha 1, Czech Republic (e-mail:","Department of Theoretical Computer Science and Mathematical Logic, Charles University, Malostransk\u00e9 n\u00e1m\u011bst\u00ed 25, 118 00 Praha 1, Czech Republic (e-mail: petr.stepanek@mff.cuni.c ...#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Theoretical Computer Science and Mathematical Logic, Charles University, Malostransk\u00e9 n\u00e1m\u011bst\u00ed 25, 118 00 Praha 1, Czech Republic (e-mail:","institution_ids":["https://openalex.org/I21250087"]},{"raw_affiliation_string":"Department of Theoretical Computer Science and Mathematical Logic, Charles University, Malostransk\u00e9 n\u00e1m\u011bst\u00ed 25, 118 00 Praha 1, Czech Republic (e-mail: petr.stepanek@mff.cuni.c ...#TAB#","institution_ids":["https://openalex.org/I21250087"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5091830970"],"corresponding_institution_ids":["https://openalex.org/I21250087"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.12846879,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"4","issue":"3","first_page":"355","last_page":"369"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9983999729156494,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9983999729156494,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9969000220298767,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9948999881744385,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7675111889839172},{"id":"https://openalex.org/keywords/logic-program","display_name":"Logic program","score":0.6972291469573975},{"id":"https://openalex.org/keywords/partial-evaluation","display_name":"Partial evaluation","score":0.6848974227905273},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5942631959915161},{"id":"https://openalex.org/keywords/transformation","display_name":"Transformation (genetics)","score":0.5906069278717041},{"id":"https://openalex.org/keywords/program-transformation","display_name":"Program transformation","score":0.4987027645111084},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4758985936641693},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.47059619426727295},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.39132553339004517},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36639559268951416},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21617501974105835},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.17952677607536316}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7675111889839172},{"id":"https://openalex.org/C2987117450","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic program","level":3,"score":0.6972291469573975},{"id":"https://openalex.org/C195701839","wikidata":"https://www.wikidata.org/wiki/Q4008398","display_name":"Partial evaluation","level":2,"score":0.6848974227905273},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5942631959915161},{"id":"https://openalex.org/C204241405","wikidata":"https://www.wikidata.org/wiki/Q461499","display_name":"Transformation (genetics)","level":3,"score":0.5906069278717041},{"id":"https://openalex.org/C2778361913","wikidata":"https://www.wikidata.org/wiki/Q7248437","display_name":"Program transformation","level":2,"score":0.4987027645111084},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4758985936641693},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.47059619426727295},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.39132553339004517},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36639559268951416},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21617501974105835},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.17952677607536316},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s147106840300190x","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s147106840300190x","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W41900915","https://openalex.org/W105881516","https://openalex.org/W1529317038","https://openalex.org/W1580941221","https://openalex.org/W1827617761","https://openalex.org/W1982644528","https://openalex.org/W1985933047","https://openalex.org/W2037035101","https://openalex.org/W2050584095","https://openalex.org/W2056410280","https://openalex.org/W2151897509","https://openalex.org/W2522304419","https://openalex.org/W2911927583","https://openalex.org/W4210897223"],"related_works":["https://openalex.org/W1577610794","https://openalex.org/W1504985935","https://openalex.org/W4451720","https://openalex.org/W1526063741","https://openalex.org/W2077436409","https://openalex.org/W1853535856","https://openalex.org/W2059554996","https://openalex.org/W1587984401","https://openalex.org/W1580941221","https://openalex.org/W35302340"],"abstract_inverted_index":{"Binary":[0],"logic":[1,8,37,62,73],"programs":[2,9,18,63,95],"can":[3,111],"be":[4,112],"obtained":[5,19],"from":[6],"ordinary":[7],"by":[10,55,92],"a":[11,36,49,81,98],"binarizing":[12],"transformation.":[13],"In":[14],"most":[15],"cases,":[16],"binary":[17,50,82],"this":[20],"way":[21],"are":[22],"less":[23],"efficient":[24],"than":[25,102],"the":[26,103],"original":[27,104],"programs.":[28],"(Demoen,":[29],"1992)":[30],"showed":[31],"an":[32],"interesting":[33],"example":[34],"of":[35,60],"program":[38,51,83,122],"whose":[39],"computational":[40,100],"behaviour":[41,101],"was":[42,46],"improved":[43],"when":[44],"it":[45],"transformed":[47],"to":[48,121],"and":[52,76,108],"then":[53],"specialized":[54],"partial":[56,78,109],"deduction.":[57],"The":[58],"class":[59],"B-stratifiable":[61,72],"is":[64,67,124],"defined.":[65],"It":[66],"shown":[68],"that":[69],"for":[70,89],"every":[71],"program,":[74],"binarization":[75,107],"subsequent":[77],"deduction":[79,110],"produce":[80],"which":[84],"does":[85],"not":[86],"contain":[87],"variables":[88],"continuations":[90],"introduced":[91],"binarization.":[93],"Such":[94],"usually":[96],"have":[97],"better":[99],"ones.":[105],"Both":[106],"easily":[113],"automated.":[114],"A":[115],"comparison":[116],"with":[117],"other":[118],"related":[119],"approaches":[120],"transformation":[123],"given.":[125]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}