{"id":"https://openalex.org/W7052663638","doi":null,"title":"Specialization of prolog programs with partially static goals and binarization","display_name":"Specialization of prolog programs with partially static goals and binarization","publication_year":1992,"publication_date":"1992-01-01","ids":{"openalex":"https://openalex.org/W7052663638"},"language":"en","primary_location":{"id":"pmh:oai:repositum.tuwien.ac.at:1562980","doi":null,"is_oa":true,"landing_page_url":"http://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-11974","pdf_url":"http://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-11974","source":{"id":"https://openalex.org/S4306400493","display_name":"reposiTUm (TU Wien)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I145847075","host_organization_name":"TU Wien","host_organization_lineage":["https://openalex.org/I145847075"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Thesis"},"volume":null,"type":"dissertation","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-11974","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5069027426","display_name":"Ulrich Neumerkel","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Neumerkel, Ulrich W.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5069027426"],"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":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9994999766349792,"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.9994999766349792,"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/T10317","display_name":"Advanced Database Systems and Queries","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":9.999999747378752e-05,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/binarization","display_name":"binarization","score":0.8519999980926514},{"id":"https://openalex.org/keywords/existential-variables","display_name":"existential variables","score":0.699999988079071},{"id":"https://openalex.org/keywords/definite-clause-grammars","display_name":"definite clause grammars","score":0.9430000185966492},{"id":"https://openalex.org/keywords/accumulator","display_name":"accumulator","score":0.968999981880188},{"id":"https://openalex.org/keywords/unification-algorithms","display_name":"unification algorithms","score":0.8989999890327454},{"id":"https://openalex.org/keywords/program-transformation","display_name":"program transformation","score":0.7749999761581421},{"id":"https://openalex.org/keywords/execution-speed","display_name":"execution speed","score":0.6990000009536743}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7541000247001648},{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"score":0.7408000230789185},{"id":"https://openalex.org/C96146094","wikidata":"https://www.wikidata.org/wiki/Q609057","display_name":"Unification","level":2,"score":0.6586999893188477},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6536999940872192},{"id":"https://openalex.org/C88626702","wikidata":"https://www.wikidata.org/wiki/Q1128903","display_name":"Continuation","level":2,"score":0.6208999752998352},{"id":"https://openalex.org/C204241405","wikidata":"https://www.wikidata.org/wiki/Q461499","display_name":"Transformation (genetics)","level":3,"score":0.4733000099658966},{"id":"https://openalex.org/C2778361913","wikidata":"https://www.wikidata.org/wiki/Q7248437","display_name":"Program transformation","level":2,"score":0.46399998664855957},{"id":"https://openalex.org/C97169998","wikidata":"https://www.wikidata.org/wiki/Q1582738","display_name":"Definite clause grammar","level":5,"score":0.4415000081062317},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43540000915527344},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43070000410079956},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.41029998660087585},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.39329999685287476},{"id":"https://openalex.org/C97686452","wikidata":"https://www.wikidata.org/wiki/Q7604153","display_name":"Static analysis","level":2,"score":0.366100013256073},{"id":"https://openalex.org/C128099668","wikidata":"https://www.wikidata.org/wiki/Q573952","display_name":"Lazy evaluation","level":3,"score":0.3594000041484833},{"id":"https://openalex.org/C2078106","wikidata":"https://www.wikidata.org/wiki/Q14906620","display_name":"Accumulator (cryptography)","level":2,"score":0.3546999990940094},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.3513999879360199},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34929999709129333},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.3449000120162964},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.3393000066280365},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.3303999900817871},{"id":"https://openalex.org/C173856430","wikidata":"https://www.wikidata.org/wiki/Q3257964","display_name":"Separation logic","level":2,"score":0.32120001316070557},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.32089999318122864},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2922999858856201},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.2766000032424927},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.2644999921321869},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.2603999972343445},{"id":"https://openalex.org/C2987117450","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic program","level":3,"score":0.2563999891281128},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.2542000114917755}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:repositum.tuwien.ac.at:1562980","doi":null,"is_oa":true,"landing_page_url":"http://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-11974","pdf_url":"http://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-11974","source":{"id":"https://openalex.org/S4306400493","display_name":"reposiTUm (TU Wien)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I145847075","host_organization_name":"TU Wien","host_organization_lineage":["https://openalex.org/I145847075"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Thesis"},{"id":"pmh:oai:repositum.tuwien.at:20.500.12708/13466","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.12708/13466","pdf_url":"https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-11974","source":{"id":"https://openalex.org/S4306400493","display_name":"reposiTUm (TU Wien)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I145847075","host_organization_name":"TU Wien","host_organization_lineage":["https://openalex.org/I145847075"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Neumerkel, U. W. (1992). Specialization of prolog programs with partially static goals and binarization [Dissertation, Technische Universit\u00e4t Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-11974","raw_type":"Thesis"}],"best_oa_location":{"id":"pmh:oai:repositum.tuwien.ac.at:1562980","doi":null,"is_oa":true,"landing_page_url":"http://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-11974","pdf_url":"http://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-11974","source":{"id":"https://openalex.org/S4306400493","display_name":"reposiTUm (TU Wien)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I145847075","host_organization_name":"TU Wien","host_organization_lineage":["https://openalex.org/I145847075"],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Thesis"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7052663638.pdf","grobid_xml":"https://content.openalex.org/works/W7052663638.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1580941221","https://openalex.org/W2406331646","https://openalex.org/W7099855147","https://openalex.org/W1585409988","https://openalex.org/W105881516","https://openalex.org/W2568056591","https://openalex.org/W1606385353","https://openalex.org/W1515450520","https://openalex.org/W2009311514","https://openalex.org/W1973442766"],"abstract_inverted_index":{"In":[0],"dieser":[1],"Dissertation":[2],"werden":[3,135,158],"zwei":[4],"neue":[5],"Methoden":[6,139,155],"zur":[7,36,58],"Spezialisierung":[8,37],"von":[9,52,63,89,104,168],"normalen":[10],"und":[11,15,32,42,65,69,118],"bin\u00e4ren":[12],"Prologprogrammen":[13],"vorgestellt":[14],"mit":[16],"den":[17,120],"bisherigen":[18],"Techniken":[19],"verglichen.Die":[20],"eine":[21],"Methode":[22,99],"verwendet":[23],"partiell":[24],"statische":[25],"Ziele,":[26],"welche":[27],"die":[28,74,102,116,150,165],"herk\u00f6mmlichen":[29],"Bindungsumgebungen":[30],"verallgemeinern":[31],"dadurch":[33],"mehr":[34],"Information":[35],"insbesondere":[38],"in":[39],"auf":[40],"Expandierung":[41],"Komprimieren":[43],"basierenden":[44],"Transformationssystemen":[45],"weitergeben":[46],"k\u00f6nnen.Die":[47],"andere":[48],"Methode,":[49],"gleichheitsbasierte":[50,166],"Transformation":[51],"'Continuations'":[53],"('Equality-based":[54],"continuation":[55],"transformation'),":[56],"dient":[57],"Entfernung":[59,103],"der":[60,76,93,142,152],"beim":[61],"Durchreichen":[62,92],"Kontextargumenten":[64],"Akkumulatoren":[66],"entstehenden":[67],"Existenzvariablen":[68,96,105],"anderer":[70],"\u00fcberfl\u00fcssiger":[71],"Strukturen,":[72],"f\u00fcr":[73,109,125,164],"aus":[75],"Literatur":[77],"keine":[78],"Verfahren":[79],"bekannt":[80],"sind.Aus":[81],"Definiten":[82],"Klausen-Grammatiken":[83],"(DCGs)":[84],"entstandene":[85],"Programme":[86,106],"k\u00f6nnen":[87],"so":[88],"s\u00e4mtlichen":[90],"zum":[91],"Differenzliste":[94],"verwendeten":[95],"befreit":[97],"werden.Diese":[98],"bereitet":[100],"durch":[101,130,149],"nicht":[107],"nur":[108],"weitere":[110],"Programmtransformationen":[111],"auf,":[112],"sondern":[113],"erh\u00f6ht":[114],"auch":[115],"Ausf\u00fchrungsgeschwindigkeit":[117],"vermindert":[119],"dynamischen":[121],"Speicherbedarf.Sie":[122],"ist":[123],"besonders":[124],"bin\u00e4re":[126],"Prologprogramme":[127],"geeignet,":[128],"was":[129],"experimentelle":[131],"Untersuchungen":[132],"belegt":[133],"wird.Es":[134],"einige":[136,159],"Anwendungen":[137],"unserer":[138],"vorgestellt:":[140],"Der":[141],",,Vienna":[143],"Abstract":[144],"Machine\"":[145],"eigene":[146],"Unifikationsalgorithmus":[147],"kann":[148],"Verbindung":[151],"beiden":[153],"neuen":[154],"hergeleitet":[156],"werden.Weiters":[157],"Erweiterungen":[160],"\u00fcblicher":[161],"Programmiertechniken":[162],"vorgestellt,":[163],"Transformationen":[167],"Nutzen":[169],"sind.":[170]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-10-26T11:51:55.731654","created_date":"2025-10-10T00:00:00"}