{"id":"https://openalex.org/W1598890912","doi":"https://doi.org/10.7551/mitpress/4301.003.0048","title":"An Algorithm of Generalization in Positive Supercompilation","display_name":"An Algorithm of Generalization in Positive Supercompilation","publication_year":1995,"publication_date":"1995-01-01","ids":{"openalex":"https://openalex.org/W1598890912","doi":"https://doi.org/10.7551/mitpress/4301.003.0048","mag":"1598890912"},"language":"en","primary_location":{"id":"doi:10.7551/mitpress/4301.003.0048","doi":"https://doi.org/10.7551/mitpress/4301.003.0048","is_oa":false,"landing_page_url":"https://doi.org/10.7551/mitpress/4301.003.0048","pdf_url":null,"source":{"id":"https://openalex.org/S4306463997","display_name":"The MIT Press eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718","https://openalex.org/P4310316440"],"host_organization_lineage_names":["The MIT Press","Massachusetts Institute of Technology"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logic Programming","raw_type":"book-chapter"},"volume":{"id":"https://openalex.org/W4252968429","display_name":"Logic Programming"},"type":"book-chapter","is_traditional":true,"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/A5037366569","display_name":"Morten Heine S\u00f8rensen","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Morten H. S\u00f8rensen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5027112594","display_name":"Robert Gl\u00fcck","orcid":"https://orcid.org/0000-0001-6990-3935","observed_orcids":["https://orcid.org/0000-0001-6990-3935"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Robert Gl\u00fcck","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":26.2695,"has_fulltext":false,"cited_by_count":141,"citation_normalized_percentile":{"value":0.99675676,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":100},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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":9.999999747378752e-05,"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/T11567","display_name":"semigroups and automata theory","score":9.999999747378752e-05,"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/termination-analysis","display_name":"termination analysis","score":0.5950000286102295},{"id":"https://openalex.org/keywords/term-algebras","display_name":"term algebras","score":0.7620000243186951},{"id":"https://openalex.org/keywords/deforestation","display_name":"deforestation","score":0.621999979019165},{"id":"https://openalex.org/keywords/partial-evaluation","display_name":"partial evaluation","score":0.996999979019165},{"id":"https://openalex.org/keywords/partial-deduction","display_name":"partial deduction","score":0.9959999918937683},{"id":"https://openalex.org/keywords/well-quasi-orders","display_name":"well-quasi-ordering","score":0.9819999933242798},{"id":"https://openalex.org/keywords/program-transformation","display_name":"program transformation","score":0.5580000281333923}],"concepts":[{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.7230582237243652},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49038195610046387},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44683602452278137},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29525434970855713},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.03360337018966675}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.7551/mitpress/4301.003.0048","doi":"https://doi.org/10.7551/mitpress/4301.003.0048","is_oa":false,"landing_page_url":"https://doi.org/10.7551/mitpress/4301.003.0048","pdf_url":null,"source":{"id":"https://openalex.org/S4306463997","display_name":"The MIT Press eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718","https://openalex.org/P4310316440"],"host_organization_lineage_names":["The MIT Press","Massachusetts Institute of Technology"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logic Programming","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.49.1869","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.1869","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.diku.dk/diku/semantics/papers/D-254.ps.gz","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/cbf05b85-5ee8-4fd7-9ab9-27ec31932e90","doi":null,"is_oa":false,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/cbf05b85-5ee8-4fd7-9ab9-27ec31932e90","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"S\u00f8rensen , M H & Gl\u00fcck , R 1995 , An algorithm of generalization in positive supercompilation . in J W Lloyd (ed.) , Logic Programming: Proceedings of the 1995 International Symposium . MIT Press , pp. 465-479 .","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2403057537","https://openalex.org/W7098675012","https://openalex.org/W2889271207","https://openalex.org/W2950248991","https://openalex.org/W2125977928","https://openalex.org/W7096715824","https://openalex.org/W7061839639","https://openalex.org/W2399504880","https://openalex.org/W1804417282","https://openalex.org/W2112108083"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3],"termination":[4,69],"technique":[5,16,43,53],"for":[6,27,38,67],"positive":[7,22],"supercompilation,":[8,23],"based":[9],"on":[10,95],"notions":[11],"from":[12],"term":[13],"algebra.":[14],"The":[15,42],"is":[17,48,75],"not":[18,49],"particularily":[19],"biased":[20],"towards":[21],"but":[24,73],"also":[25],"works":[26],"deforestation":[28],"and":[29,63],"partial":[30,39,71],"evaluation.":[31],"It":[32],"appears":[33],"to":[34],"be":[35,55],"well":[36],"suited":[37],"deduction":[40],"too.":[41],"guarantees":[44],"termination,":[45],"yet":[46],"it":[47,74,83],"overly":[50],"conservative.":[51],"Our":[52],"can":[54],"viewed":[56],"as":[57],"an":[58],"instance":[59],"of":[60,70],"Martens":[61],"'":[62],"Gallagher's":[64],"recent":[65],"framework":[66],"global":[68],"deduction,":[72],"more":[76],"general":[77],"in":[78],"some":[79],"important":[80],"respects,":[81],"e.g.":[82],"uses":[84],"well-quasi":[85],"orderings":[86],"rather":[87],"than":[88],"well-founded":[89],"orderings.":[90],"Its":[91],"merits":[92],"are":[93],"illustrated":[94],"several":[96],"examples.":[97]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":14}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}