{"id":"https://openalex.org/W2511942492","doi":"https://doi.org/10.1007/s00165-016-0393-z","title":"Proof checking and logic programming","display_name":"Proof checking and logic programming","publication_year":2016,"publication_date":"2016-09-05","ids":{"openalex":"https://openalex.org/W2511942492","doi":"https://doi.org/10.1007/s00165-016-0393-z","mag":"2511942492"},"language":"en","primary_location":{"id":"doi:10.1007/s00165-016-0393-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00165-016-0393-z","pdf_url":null,"source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://inria.hal.science/hal-01390901/document","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5018394339","display_name":"Dale Miller","orcid":"https://orcid.org/0000-0003-0274-4954"},"institutions":[{"id":"https://openalex.org/I4210139461","display_name":"Laboratoire d'Informatique de l'\u00c9cole Polytechnique","ror":"https://ror.org/04afed728","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I142476485","https://openalex.org/I4210139461","https://openalex.org/I4210145102","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Dale Miller","raw_affiliation_strings":["Inria Saclay & LIX, \u00c9cole Polytechnique, 1 rue Honor\u00e9 d\u2019Estienne d\u2019Orves, B\u00e2timent Alan Turing, 91120, Palaiseau, France"],"raw_orcid":"https://orcid.org/0000-0003-0274-4954","affiliations":[{"raw_affiliation_string":"Inria Saclay & LIX, \u00c9cole Polytechnique, 1 rue Honor\u00e9 d\u2019Estienne d\u2019Orves, B\u00e2timent Alan Turing, 91120, Palaiseau, France","institution_ids":["https://openalex.org/I4210139461"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5018394339"],"corresponding_institution_ids":["https://openalex.org/I4210139461"],"apc_list":null,"apc_paid":null,"fwci":0.8834,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.84340727,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"29","issue":"3","first_page":"383","last_page":"399"},"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.9998000264167786,"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.9998000264167786,"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/T11424","display_name":"Security and Verification in Computing","score":0.9994999766349792,"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.9945999979972839,"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/programming-language","display_name":"Programming language","score":0.7621479034423828},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7413204908370972},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6825414896011353},{"id":"https://openalex.org/keywords/gas-meter-prover","display_name":"Gas meter prover","score":0.5542867183685303},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.5489396452903748},{"id":"https://openalex.org/keywords/proof-assistant","display_name":"Proof assistant","score":0.47090578079223633},{"id":"https://openalex.org/keywords/unification","display_name":"Unification","score":0.46022066473960876},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.4582468867301941},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.43821579217910767},{"id":"https://openalex.org/keywords/programming-paradigm","display_name":"Programming paradigm","score":0.43162116408348083},{"id":"https://openalex.org/keywords/formal-proof","display_name":"Formal proof","score":0.42591533064842224},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41782882809638977},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17610830068588257}],"concepts":[{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.7621479034423828},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7413204908370972},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6825414896011353},{"id":"https://openalex.org/C159718280","wikidata":"https://www.wikidata.org/wiki/Q5526353","display_name":"Gas meter prover","level":3,"score":0.5542867183685303},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.5489396452903748},{"id":"https://openalex.org/C203265346","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Proof assistant","level":3,"score":0.47090578079223633},{"id":"https://openalex.org/C96146094","wikidata":"https://www.wikidata.org/wiki/Q609057","display_name":"Unification","level":2,"score":0.46022066473960876},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.4582468867301941},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.43821579217910767},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.43162116408348083},{"id":"https://openalex.org/C94461902","wikidata":"https://www.wikidata.org/wiki/Q2762418","display_name":"Formal proof","level":3,"score":0.42591533064842224},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41782882809638977},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17610830068588257},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00165-016-0393-z","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00165-016-0393-z","pdf_url":null,"source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-01390901v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01390901","pdf_url":"https://inria.hal.science/hal-01390901/document","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"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":"Formal Aspects of Computing, 2017, 29 (3), pp.383-399 ⟨10.1007/s00165-016-0393-z⟩","raw_type":"Journal articles"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01390901v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01390901","pdf_url":"https://inria.hal.science/hal-01390901/document","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"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":"Formal Aspects of Computing, 2017, 29 (3), pp.383-399 ⟨10.1007/s00165-016-0393-z⟩","raw_type":"Journal articles"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2511942492.pdf","grobid_xml":"https://content.openalex.org/works/W2511942492.grobid-xml"},"referenced_works_count":56,"referenced_works":["https://openalex.org/W46734479","https://openalex.org/W107224311","https://openalex.org/W131041899","https://openalex.org/W134339645","https://openalex.org/W258022877","https://openalex.org/W389428040","https://openalex.org/W600819829","https://openalex.org/W657829122","https://openalex.org/W1482532876","https://openalex.org/W1493752083","https://openalex.org/W1498523273","https://openalex.org/W1499101893","https://openalex.org/W1503170941","https://openalex.org/W1503973138","https://openalex.org/W1559383704","https://openalex.org/W1579694940","https://openalex.org/W1590828018","https://openalex.org/W1678615379","https://openalex.org/W1727609483","https://openalex.org/W1807903125","https://openalex.org/W1866043924","https://openalex.org/W1889888010","https://openalex.org/W1961757151","https://openalex.org/W1974190112","https://openalex.org/W1985185257","https://openalex.org/W1988449272","https://openalex.org/W1989085426","https://openalex.org/W1995430920","https://openalex.org/W1996404651","https://openalex.org/W2023035194","https://openalex.org/W2032234226","https://openalex.org/W2070324762","https://openalex.org/W2088881461","https://openalex.org/W2093111544","https://openalex.org/W2095436832","https://openalex.org/W2114925693","https://openalex.org/W2126263702","https://openalex.org/W2129878537","https://openalex.org/W2136310957","https://openalex.org/W2141978322","https://openalex.org/W2143073089","https://openalex.org/W2159130720","https://openalex.org/W2246135666","https://openalex.org/W2263677784","https://openalex.org/W2277055931","https://openalex.org/W2294656706","https://openalex.org/W2413857186","https://openalex.org/W2463700520","https://openalex.org/W2463991046","https://openalex.org/W2483392883","https://openalex.org/W2604354869","https://openalex.org/W2911865844","https://openalex.org/W2964092005","https://openalex.org/W3135320517","https://openalex.org/W4251447739","https://openalex.org/W4256124958"],"related_works":["https://openalex.org/W2809689211","https://openalex.org/W76860425","https://openalex.org/W2160478595","https://openalex.org/W3026697850","https://openalex.org/W2522499048","https://openalex.org/W4214826241","https://openalex.org/W2074713291","https://openalex.org/W1909465604","https://openalex.org/W2759683207","https://openalex.org/W3100311625"],"abstract_inverted_index":{"Abstract":[0],"In":[1,72,93],"a":[2,52,68,84,89,111,148,165],"world":[3],"where":[4],"trusting":[5],"software":[6],"systems":[7],"is":[8,83,119],"increasingly":[9],"important,":[10],"formal":[11,14],"methods":[12],"and":[13,54,77,103,125],"proof":[15,56,62,75,126,155],"can":[16,25,163],"help":[17,26],"provide":[18],"some":[19],"basis":[20],"for":[21,114],"trust.":[22],"Proof":[23],"checking":[24,115,127],"to":[27,40,50,60,108],"reduce":[28],"the":[29,32,139,152,169],"size":[30],"of":[31,91,96,141,154,171],"trusted":[33],"base":[34],"since":[35],"we":[36,47],"do":[37],"not":[38],"need":[39,49],"trust":[41,51],"an":[42],"entire":[43],"theorem":[44,78],"prover:":[45],"instead,":[46],"only":[48],"(smaller":[53],"simpler)":[55],"checker.":[57],"Many":[58],"approaches":[59],"building":[61],"checkers":[63,76],"require":[64],"embedding":[65],"within":[66],"them":[67],"full":[69],"programming":[70,81,86,124,143,162],"language.":[71],"most":[73],"modern":[74],"provers,":[79],"that":[80,160],"language":[82],"functional":[85],"language,":[87],"often":[88],"variant":[90],"ML.":[92],"fact,":[94,146],"aspects":[95],"ML":[97,110],"(e.g.,":[98,128],"strong":[99],"typing,":[100],"abstract":[101],"datatypes,":[102],"higher-order":[104],"programming)":[105],"were":[106],"designed":[107],"make":[109],"trustworthy":[112],"\u201cmeta-language\u201d":[113],"proofs.":[116],"While":[117],"there":[118],"considerable":[120],"overlap":[121],"between":[122],"logic":[123,142,161],"both":[129],"benefit":[130],"from":[131],"unification,":[132],"backtracking":[133],"search,":[134],"efficient":[135],"term":[136],"structures,":[137],"etc.),":[138],"discipline":[140],"has,":[144],"in":[145,151,168],"played":[147],"minor":[149],"role":[150,167],"history":[153],"checking.":[156],"I":[157],"will":[158],"argue":[159],"have":[164],"major":[166],"future":[170],"this":[172],"important":[173],"topic.":[174]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}