{"id":"https://openalex.org/W154684055","doi":null,"title":"Automatic inductive theorem proving and program construction methods using program transformation","display_name":"Automatic inductive theorem proving and program construction methods using program transformation","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W154684055","mag":"154684055"},"language":"en","primary_location":{"id":"pmh:oai:doras.dcu.ie:16990","doi":null,"is_oa":false,"landing_page_url":"http://doras.dcu.ie/16990/1/md_humuyan_KABIR_SC.pdf","pdf_url":"http://doras.dcu.ie/16990/1/md_humuyan_KABIR_SC.pdf","source":{"id":"https://openalex.org/S4306401511","display_name":"Dublin City University Open Access Institutional Repository (Dublin City University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I42934936","host_organization_name":"Dublin City University","host_organization_lineage":["https://openalex.org/I42934936"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"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://doras.dcu.ie/16990/","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Md. Humayun Kabir","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Md. Humayun Kabir","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":null,"has_fulltext":true,"cited_by_count":4,"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":false,"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/T10142","display_name":"Formal Methods in Verification","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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.0,"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/inductive-theorem-proving","display_name":"inductive theorem proving","score":0.9269999861717224},{"id":"https://openalex.org/keywords/program-construction","display_name":"program construction","score":0.6980000138282776},{"id":"https://openalex.org/keywords/program-transformation","display_name":"program transformation","score":0.9070000052452087},{"id":"https://openalex.org/keywords/sequent-calculus","display_name":"sequent calculus","score":0.7120000123977661},{"id":"https://openalex.org/keywords/program-correctness","display_name":"program correctness","score":0.6660000085830688},{"id":"https://openalex.org/keywords/overgeneralization","display_name":"overgeneralization","score":0.5989999771118164},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"automated theorem proving","score":0.46000000834465027}],"concepts":[{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.7851189374923706},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.7569358348846436},{"id":"https://openalex.org/C65880906","wikidata":"https://www.wikidata.org/wiki/Q1771121","display_name":"Sequent calculus","level":3,"score":0.7236389517784119},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.710173487663269},{"id":"https://openalex.org/C173613240","wikidata":"https://www.wikidata.org/wiki/Q1150675","display_name":"Computer-assisted proof","level":3,"score":0.5663487911224365},{"id":"https://openalex.org/C2776937632","wikidata":"https://www.wikidata.org/wiki/Q4117718","display_name":"Program synthesis","level":2,"score":0.5621490478515625},{"id":"https://openalex.org/C203265346","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Proof assistant","level":3,"score":0.5360965728759766},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5319222211837769},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5288307070732117},{"id":"https://openalex.org/C159718280","wikidata":"https://www.wikidata.org/wiki/Q5526353","display_name":"Gas meter prover","level":3,"score":0.5237695574760437},{"id":"https://openalex.org/C13766981","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Automated proof checking","level":3,"score":0.5163344144821167},{"id":"https://openalex.org/C2778361913","wikidata":"https://www.wikidata.org/wiki/Q7248437","display_name":"Program transformation","level":2,"score":0.5138481259346008},{"id":"https://openalex.org/C2993131915","wikidata":"https://www.wikidata.org/wiki/Q484511","display_name":"Inductive method","level":3,"score":0.48925328254699707},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.47652921080589294},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.46082815527915955},{"id":"https://openalex.org/C204241405","wikidata":"https://www.wikidata.org/wiki/Q461499","display_name":"Transformation (genetics)","level":3,"score":0.45728039741516113},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.43740949034690857},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42664700746536255},{"id":"https://openalex.org/C2318724","wikidata":"https://www.wikidata.org/wiki/Q852732","display_name":"Proof theory","level":3,"score":0.42604172229766846},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.4177093505859375},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38435596227645874},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C199343813","wikidata":"https://www.wikidata.org/wiki/Q12128","display_name":"Dentistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C88610354","wikidata":"https://www.wikidata.org/wiki/Q1813494","display_name":"Teaching method","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C145420912","wikidata":"https://www.wikidata.org/wiki/Q853077","display_name":"Mathematics education","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:doras.dcu.ie:16990","doi":null,"is_oa":false,"landing_page_url":"http://doras.dcu.ie/16990/1/md_humuyan_KABIR_SC.pdf","pdf_url":"http://doras.dcu.ie/16990/1/md_humuyan_KABIR_SC.pdf","source":{"id":"https://openalex.org/S4306401511","display_name":"Dublin City University Open Access Institutional Repository (Dublin City University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I42934936","host_organization_name":"Dublin City University","host_organization_lineage":["https://openalex.org/I42934936"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Thesis"},{"id":"pmh:http://www.rian.ie/53556/","doi":null,"is_oa":true,"landing_page_url":"http://doras.dcu.ie/16990/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400033","display_name":"Arrow@dit (Dublin Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4210144925","host_organization_name":"Technological University Dublin","host_organization_lineage":["https://openalex.org/I4210144925"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Kabir, Md. Humayun (2007) Automatic inductive theorem proving and program construction methods using program transformation. PhD thesis, Dublin City University.","raw_type":"Other"},{"id":"mag:154684055","doi":null,"is_oa":false,"landing_page_url":"http://doras.dcu.ie/16990/","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:http://www.rian.ie/53556/","doi":null,"is_oa":true,"landing_page_url":"http://doras.dcu.ie/16990/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400033","display_name":"Arrow@dit (Dublin Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4210144925","host_organization_name":"Technological University Dublin","host_organization_lineage":["https://openalex.org/I4210144925"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Kabir, Md. Humayun (2007) Automatic inductive theorem proving and program construction methods using program transformation. PhD thesis, Dublin City University.","raw_type":"Other"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W154684055.pdf","grobid_xml":"https://content.openalex.org/works/W154684055.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2056022747","https://openalex.org/W7096503886","https://openalex.org/W2976732574","https://openalex.org/W1660580880","https://openalex.org/W3093230818","https://openalex.org/W2289580062","https://openalex.org/W2051183640","https://openalex.org/W7097380746","https://openalex.org/W2073317789","https://openalex.org/W2037237472"],"abstract_inverted_index":{"We":[0,73,126,212],"present":[1,83,151,162],"new":[2],"approaches":[3],"to":[4,12,32,50,118,136,168,197,249],"prove":[5],"universally":[6],"and":[7,11,22,58,81,86,98,154,208,218,240,254],"existentially":[8],"quantified":[9],"conjectures":[10,35],"construct":[13,169],"programs":[14,131],"from":[15],"the":[16,29,51,78,84,96,111,129,193,203,215,229,235,238],"resulting":[17,52],"proofs.":[18],"These":[19],"theorem":[20,56,67,157,190,216],"proving":[21,57,158],"program":[23,59,87,99,165,178,205,241],"construction":[24,60,88,100,166,242],"techniques":[25,61,89,101,243],"make":[26,250],"use":[27,194,225],"of":[28,77,95,110,141,195,202,210,226,231,237],"distillation":[30,79,196,227],"algorithm":[31],"transform":[33],"input":[34,204],"into":[36],"a":[37,66,119,163,184,199,245],"normalised":[38],"form":[39,201],"which":[40,69],"we":[41,70,150,161,173],"call":[42,71],"distilled":[43,53],"form.":[44],"The":[45,108,224],"proof":[46,85,97,112,121,239],"rules":[47],"are":[48,132],"applied":[49],"program.":[54],"Our":[55,93],"have":[62,174,213],"been":[63],"implemented":[64,90,214],"in":[65,91,103,183,187,228,244],"prover":[68,217],"Poitin.":[72,92],"give":[74],"an":[75,188],"overview":[76],"algorithm,":[80],"then":[82,106],"implementation":[94],"used":[102,182],"Poitin":[104,232],"is":[105,114],"presented.":[107],"soundness":[109],"technique":[113,167],"shown":[115,175],"with":[116,134],"respect":[117,135],"logical":[120],"system":[122],"using":[123],"sequent":[124],"calculus.":[125],"show":[127],"that":[128],"constructed":[130],"correct":[133,170],"their":[137],"specification.\\n\\nThe":[138],"main":[139],"contributions":[140],"this":[142],"thesis":[143],"can":[144,180],"be":[145,181],"summarised":[146],"as":[147],"follows.":[148],"First,":[149],"fully":[152,252],"automatic,":[153],"efficient":[155],"inductive":[156,189],"techniques.":[159],"Second,":[160],"novel":[164,185],"programs.":[171],"Third,":[172],"how":[176],"automatic":[177,253],"transformation":[179],"way":[186],"prover.":[191],"Finally,":[192],"obtain":[198],"normal":[200],"reduces":[206],"over-generalization":[207],"generation":[209],"non-theorems.":[211],"demonstrated":[219],"it":[220,251],"on":[221],"some":[222],"examples.":[223],"framework":[230],"has":[233],"eased":[234],"automation":[236],"reduced":[246],"search":[247],"space":[248],"efficient.":[255]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2016-06-24T00:00:00"}