{"id":"https://openalex.org/W1973876376","doi":"https://doi.org/10.1093/jigpal/jzu012","title":"First-order unification in the PVS proof assistant","display_name":"First-order unification in the PVS proof assistant","publication_year":2014,"publication_date":"2014-06-30","ids":{"openalex":"https://openalex.org/W1973876376","doi":"https://doi.org/10.1093/jigpal/jzu012","mag":"1973876376"},"language":"en","primary_location":{"id":"doi:10.1093/jigpal/jzu012","is_oa":false,"landing_page_url":"https://doi.org/10.1093/jigpal/jzu012","pdf_url":null,"source":{"id":"https://openalex.org/S2734381524","display_name":"Logic Journal of IGPL","issn_l":"1367-0751","issn":["1367-0751","1368-9894"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logic Journal of IGPL","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/A5009946230","display_name":"Andr\u00e9ia Borges Avelar","orcid":null},"institutions":[{"id":"https://openalex.org/I150729083","display_name":"Universidade de Bras\u00edlia","ror":"https://ror.org/02xfp8v59","country_code":"BR","type":"education","lineage":["https://openalex.org/I150729083"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"A. B. Avelar","raw_affiliation_strings":["Departamento de Matem\u00e1tica, Universidade de Bras\u00edlia, 70910-900 Bras\u00edlia D.F., Brazil"],"affiliations":[{"raw_affiliation_string":"Departamento de Matem\u00e1tica, Universidade de Bras\u00edlia, 70910-900 Bras\u00edlia D.F., Brazil","institution_ids":["https://openalex.org/I150729083"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012020596","display_name":"Andr\u00e9 Luiz Galdino","orcid":null},"institutions":[{"id":"https://openalex.org/I68106152","display_name":"Universidade Federal de Goi\u00e1s","ror":"https://ror.org/0039d5757","country_code":"BR","type":"education","lineage":["https://openalex.org/I68106152"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"A. L. Galdino","raw_affiliation_strings":["Departamento de Matem\u00e1tica, Campus Catal\u00e3o, Universidade Federal de Goi\u00e1s, 75704-020 Catal\u00e3o, Brazil"],"affiliations":[{"raw_affiliation_string":"Departamento de Matem\u00e1tica, Campus Catal\u00e3o, Universidade Federal de Goi\u00e1s, 75704-020 Catal\u00e3o, Brazil","institution_ids":["https://openalex.org/I68106152"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004006407","display_name":"Fl\u00e1vio L. C. de Moura","orcid":null},"institutions":[{"id":"https://openalex.org/I150729083","display_name":"Universidade de Bras\u00edlia","ror":"https://ror.org/02xfp8v59","country_code":"BR","type":"education","lineage":["https://openalex.org/I150729083"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"F. L. C. de Moura","raw_affiliation_strings":["Departamento de Ci\u00eancia da Computa\u00e7\u00e3o, Universidade de Bras\u00edlia, 70910-900 Bras\u00edlia D.F., Brazil"],"affiliations":[{"raw_affiliation_string":"Departamento de Ci\u00eancia da Computa\u00e7\u00e3o, Universidade de Bras\u00edlia, 70910-900 Bras\u00edlia D.F., Brazil","institution_ids":["https://openalex.org/I150729083"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043206848","display_name":"Maur\u00edcio Ayala-Rinc\u00f3n","orcid":"https://orcid.org/0000-0003-0089-3905"},"institutions":[{"id":"https://openalex.org/I150729083","display_name":"Universidade de Bras\u00edlia","ror":"https://ror.org/02xfp8v59","country_code":"BR","type":"education","lineage":["https://openalex.org/I150729083"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"M. Ayala-Rincon","raw_affiliation_strings":["Departamentos de Ci\u00eancia da Computa\u00e7\u00e3o e Matem\u00e1tica, Universidade de Bras\u00edlia, 70910-900 Bras\u00edlia D.F., Brazil"],"affiliations":[{"raw_affiliation_string":"Departamentos de Ci\u00eancia da Computa\u00e7\u00e3o e Matem\u00e1tica, Universidade de Bras\u00edlia, 70910-900 Bras\u00edlia D.F., Brazil","institution_ids":["https://openalex.org/I150729083"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5009946230"],"corresponding_institution_ids":["https://openalex.org/I150729083"],"apc_list":{"value":4151,"currency":"USD","value_usd":4151},"apc_paid":null,"fwci":1.636,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.86608194,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"22","issue":"5","first_page":"758","last_page":"789"},"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.9998999834060669,"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.9998999834060669,"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/T10142","display_name":"Formal Methods in Verification","score":0.9968000054359436,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9850000143051147,"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/unification","display_name":"Unification","score":0.8608934879302979},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.8328891396522522},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.7337144613265991},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.6679044961929321},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6497464179992676},{"id":"https://openalex.org/keywords/proof-assistant","display_name":"Proof assistant","score":0.6357369422912598},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.5915856957435608},{"id":"https://openalex.org/keywords/formal-proof","display_name":"Formal proof","score":0.5272594690322876},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4419274926185608},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43944379687309265},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.3851454257965088},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3691920340061188},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3254571259021759},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.21816599369049072},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.18429940938949585}],"concepts":[{"id":"https://openalex.org/C96146094","wikidata":"https://www.wikidata.org/wiki/Q609057","display_name":"Unification","level":2,"score":0.8608934879302979},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.8328891396522522},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.7337144613265991},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.6679044961929321},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6497464179992676},{"id":"https://openalex.org/C203265346","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Proof assistant","level":3,"score":0.6357369422912598},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.5915856957435608},{"id":"https://openalex.org/C94461902","wikidata":"https://www.wikidata.org/wiki/Q2762418","display_name":"Formal proof","level":3,"score":0.5272594690322876},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4419274926185608},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43944379687309265},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3851454257965088},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3691920340061188},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3254571259021759},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.21816599369049072},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.18429940938949585},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1093/jigpal/jzu012","is_oa":false,"landing_page_url":"https://doi.org/10.1093/jigpal/jzu012","pdf_url":null,"source":{"id":"https://openalex.org/S2734381524","display_name":"Logic Journal of IGPL","issn_l":"1367-0751","issn":["1367-0751","1368-9894"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311648","host_organization_name":"Oxford University Press","host_organization_lineage":["https://openalex.org/P4310311648","https://openalex.org/P4310311647"],"host_organization_lineage_names":["Oxford University Press","University of Oxford"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logic Journal of IGPL","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W93523116","https://openalex.org/W1484491875","https://openalex.org/W1491324663","https://openalex.org/W1507819540","https://openalex.org/W1534850143","https://openalex.org/W1969006866","https://openalex.org/W1986121459","https://openalex.org/W2000429300","https://openalex.org/W2019376542","https://openalex.org/W2019994514","https://openalex.org/W2022840750","https://openalex.org/W2025817323","https://openalex.org/W2079554395","https://openalex.org/W2100738443","https://openalex.org/W2139612172","https://openalex.org/W3145594871"],"related_works":["https://openalex.org/W3026697850","https://openalex.org/W1524804222","https://openalex.org/W4297608983","https://openalex.org/W2951182230","https://openalex.org/W2977918285","https://openalex.org/W3100311625","https://openalex.org/W26319539","https://openalex.org/W1825610764","https://openalex.org/W4386746735","https://openalex.org/W1562231403"],"abstract_inverted_index":{"This":[0],"work":[1,106,144],"presents":[2],"formalizations":[3,46,79,286],"of":[4,23,26,28,47,55,58,76,95,103,108,121,123,131,148,153,181,199,223,227,233,254,259,282,287,290,292,299,302,310,312],"properties":[5,311],"and":[6,39,49,100,151,284],"algorithms":[7,69],"for":[8,33,52,126],"the":[9,14,24,45,53,56,86,93,96,115,119,132,149,163,166,178,182,193,196,207,221,224,238,246,252,257,260,288,297,313],"first-order":[10,34,157],"unification":[11,68,158,248],"theory":[12],"in":[13,63,174,187,202,275],"proof":[15,54,101],"assistant":[16],"PVS.":[17,104],"In":[18,137,160],"previous":[19,239],"works":[20],"a":[21,128,146,154,175,189,212,216,219,270,278,300],"formalization":[22,130,147,266,298,309],"theorem":[25,57,120,289],"existence":[27,122,291],"most":[29],"general":[30],"unifiers":[31],"(mgu's)":[32],"unifiable":[35],"problems":[36],"was":[37,42,90,295],"presented":[38],"then,":[40],"it":[41,294],"illustrated":[43],"how":[44],"correctness":[48,283],"completeness":[50,152,285],"used":[51,317],"existence,":[59],"can":[60],"be":[61],"adapted":[62],"order":[64],"to":[65,85,139,269,306,318],"verify":[66],"greedy":[67,164,247],"\u00e0":[70],"la":[71],"Robinson.":[72],"The":[73,264],"distinguishing":[74],"feature":[75],"these":[77,140],"two":[78,109,141,183],"is":[80,169,209,229],"that":[81,191],"they":[82],"remain":[83],"close":[84],"textbook":[87],"proofs":[88],"which":[89,276],"possible":[91],"through":[92,211,231],"use":[94],"higher-order":[97],"specification":[98],"language":[99],"engine":[102],"That":[105],"consists":[107],"elaborated":[110,156,272],"PVS":[111,273],"theories":[112],"having":[113],"been":[114],"one":[116,168],"related":[117],"with":[118,162,308],"mgu's":[124],"applied":[125],"obtaining":[127],"full":[129],"Knuth-Bendix(-Huet)":[133],"critical":[134],"pair":[135],"theorem.":[136],"addition":[138],"developments,":[142],"this":[143,242],"describes":[145],"correction":[150],"more":[155,170,243,271],"algorithm.":[159],"contrast":[161],"algorithm,":[165],"current":[167],"efficient.":[171],"It":[172],"navigates":[173],"post-order":[176],"traversal":[177],"tree":[179,314],"structure":[180,316],"terms":[184,208,261],"being":[185,262],"unified":[186],"such":[188],"way":[190],"after":[192],"difference":[194],"at":[195],"first":[197],"position":[198,226],"conflict":[200,228],"(found":[201],"inner-most,":[203],"left-most":[204],"order)":[205],"between":[206],"eliminated":[210],"linkage":[213],"substitution":[214],"(mapping":[215],"variable":[217],"into":[218],"term),":[220],"search":[222,253],"following":[225],"computed":[230],"application":[232,281],"auxiliary":[234,304],"functions":[235],"starting":[236],"from":[237,256],"position.":[240],"Unlike":[241],"efficient":[244],"traversal,":[245],"algorithm":[249],"always":[250],"restarts":[251],"conflicts":[255],"root":[258],"unified.":[263],"new":[265],"gave":[267],"rise":[268],"development":[274],"unlike":[277],"relatively":[279],"straightforward":[280],"mgu's,":[293],"necessary":[296],"series":[301],"structural":[303],"lemmas":[305],"deal":[307],"data":[315],"represent":[319],"terms.":[320]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}