{"id":"https://openalex.org/W4414570849","doi":"https://doi.org/10.1007/978-3-032-06085-3_16","title":"Designing a\u00a0Safe Forward Chaining Tactic Using Productive Proofs","display_name":"Designing a\u00a0Safe Forward Chaining Tactic Using Productive Proofs","publication_year":2025,"publication_date":"2025-09-25","ids":{"openalex":"https://openalex.org/W4414570849","doi":"https://doi.org/10.1007/978-3-032-06085-3_16"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-032-06085-3_16","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-032-06085-3_16","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-032-06085-3_16.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/978-3-032-06085-3_16.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056733524","display_name":"Kaustuv Chaudhuri","orcid":"https://orcid.org/0000-0003-2938-547X"},"institutions":[{"id":"https://openalex.org/I4210126360","display_name":"Centre Inria de Saclay","ror":"https://ror.org/0315e5x55","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210126360"]},{"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":"Kaustuv Chaudhuri","raw_affiliation_strings":["Inria Saclay & LIX, Institut Polytechnique Paris, Palaiseau, France"],"affiliations":[{"raw_affiliation_string":"Inria Saclay & LIX, Institut Polytechnique Paris, Palaiseau, France","institution_ids":["https://openalex.org/I4210126360","https://openalex.org/I4210139461"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5119750166","display_name":"Arunava Gantait","orcid":null},"institutions":[{"id":"https://openalex.org/I4210126360","display_name":"Centre Inria de Saclay","ror":"https://ror.org/0315e5x55","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210126360"]},{"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":false,"raw_author_name":"Arunava Gantait","raw_affiliation_strings":["Inria Saclay & LIX, Institut Polytechnique Paris, Palaiseau, France"],"affiliations":[{"raw_affiliation_string":"Inria Saclay & LIX, Institut Polytechnique Paris, Palaiseau, France","institution_ids":["https://openalex.org/I4210126360","https://openalex.org/I4210139461"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018394339","display_name":"Dale Miller","orcid":"https://orcid.org/0000-0003-0274-4954"},"institutions":[{"id":"https://openalex.org/I4210126360","display_name":"Centre Inria de Saclay","ror":"https://ror.org/0315e5x55","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210126360"]},{"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":false,"raw_author_name":"Dale Miller","raw_affiliation_strings":["Inria Saclay & LIX, Institut Polytechnique Paris, Palaiseau, France"],"affiliations":[{"raw_affiliation_string":"Inria Saclay & LIX, Institut Polytechnique Paris, Palaiseau, France","institution_ids":["https://openalex.org/I4210126360","https://openalex.org/I4210139461"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5056733524"],"corresponding_institution_ids":["https://openalex.org/I4210126360","https://openalex.org/I4210139461"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.43141736,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"299","last_page":"317"},"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/T11010","display_name":"Logic, Reasoning, and Knowledge","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/T10142","display_name":"Formal Methods in Verification","score":0.998199999332428,"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/chaining","display_name":"Chaining","score":0.8745999932289124},{"id":"https://openalex.org/keywords/forward-chaining","display_name":"Forward chaining","score":0.8215000033378601},{"id":"https://openalex.org/keywords/backward-chaining","display_name":"Backward chaining","score":0.7646999955177307},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6707000136375427},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.6439999938011169},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4099999964237213},{"id":"https://openalex.org/keywords/congruence","display_name":"Congruence (geometry)","score":0.3652999997138977},{"id":"https://openalex.org/keywords/relational-calculus","display_name":"Relational calculus","score":0.3479999899864197}],"concepts":[{"id":"https://openalex.org/C49020025","wikidata":"https://www.wikidata.org/wiki/Q1059099","display_name":"Chaining","level":2,"score":0.8745999932289124},{"id":"https://openalex.org/C142614401","wikidata":"https://www.wikidata.org/wiki/Q777433","display_name":"Forward chaining","level":3,"score":0.8215000033378601},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7860000133514404},{"id":"https://openalex.org/C129916263","wikidata":"https://www.wikidata.org/wiki/Q1141183","display_name":"Backward chaining","level":4,"score":0.7646999955177307},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6707000136375427},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.6439999938011169},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.48249998688697815},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4099999964237213},{"id":"https://openalex.org/C132074034","wikidata":"https://www.wikidata.org/wiki/Q154210","display_name":"Congruence (geometry)","level":2,"score":0.3652999997138977},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3531999886035919},{"id":"https://openalex.org/C99436015","wikidata":"https://www.wikidata.org/wiki/Q1722436","display_name":"Relational calculus","level":4,"score":0.3479999899864197},{"id":"https://openalex.org/C2318724","wikidata":"https://www.wikidata.org/wiki/Q852732","display_name":"Proof theory","level":3,"score":0.3391999900341034},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3357999920845032},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.33079999685287476},{"id":"https://openalex.org/C5655090","wikidata":"https://www.wikidata.org/wiki/Q192588","display_name":"Relational database","level":2,"score":0.32429999113082886},{"id":"https://openalex.org/C62073222","wikidata":"https://www.wikidata.org/wiki/Q1572108","display_name":"Natural deduction","level":2,"score":0.29280000925064087},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2870999872684479},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.28600001335144043},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.2809999883174896},{"id":"https://openalex.org/C40207289","wikidata":"https://www.wikidata.org/wiki/Q755662","display_name":"Relational model","level":3,"score":0.26980000734329224},{"id":"https://openalex.org/C203265346","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Proof assistant","level":3,"score":0.2517000138759613},{"id":"https://openalex.org/C100481476","wikidata":"https://www.wikidata.org/wiki/Q4055684","display_name":"First-order logic","level":2,"score":0.25049999356269836},{"id":"https://openalex.org/C33825631","wikidata":"https://www.wikidata.org/wiki/Q17004731","display_name":"Chain rule (probability)","level":5,"score":0.2500999867916107}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-032-06085-3_16","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-032-06085-3_16","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-032-06085-3_16.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":{"id":"doi:10.1007/978-3-032-06085-3_16","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-032-06085-3_16","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-032-06085-3_16.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4414570849.pdf"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W1484778177","https://openalex.org/W1503413362","https://openalex.org/W1961757151","https://openalex.org/W1988449272","https://openalex.org/W1989085426","https://openalex.org/W2032234226","https://openalex.org/W2039977878","https://openalex.org/W2041585656","https://openalex.org/W2051223322","https://openalex.org/W2070324762","https://openalex.org/W2073904768","https://openalex.org/W2090663022","https://openalex.org/W2110359479","https://openalex.org/W2139875914","https://openalex.org/W2141978322","https://openalex.org/W2216255786","https://openalex.org/W2912466821","https://openalex.org/W2918427073","https://openalex.org/W3216378269","https://openalex.org/W4206913075","https://openalex.org/W4249736722","https://openalex.org/W4300885336","https://openalex.org/W4388650233","https://openalex.org/W6948122057"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"We":[1,59,115],"present":[2],"a":[3,12,34,45,67,77],"proof-theoretic":[4],"treatment":[5],"of":[6,21,36,55,70,80,120],"forward":[7,50,64,122],"chaining":[8,51,65,123],"and":[9,23,52,104,124,135,140],"saturation":[10,125],"within":[11],"multisorted,":[13],"first-order":[14],"intuitionistic":[15],"logic":[16],"with":[17,66],"equality.":[18],"The":[19,82],"notions":[20],"polarity":[22],"focused":[24],"proofs":[25,57],"are":[26,111],"central":[27],"to":[28,48,74,93],"our":[29],"approach":[30],"since":[31],"they":[32],"provide":[33],"characterization":[35],"geometric":[37],"implications":[38],"as":[39,42,44],"bipolar":[40,113],"formulas":[41,71],"well":[43],"natural":[46],"setting":[47],"describe":[49],"the":[53,95,117],"concept":[54],"productive":[56],".":[58],"identify":[60],"conditions":[61],"under":[62],"which":[63,99],"given":[68],"set":[69],"is":[72],"guaranteed":[73],"saturate":[75],"in":[76,88,107,137],"finite":[78],"number":[79],"steps.":[81],"motivation":[83],"for":[84,126],"this":[85],"research":[86],"stems,":[87],"part,":[89],"from":[90],"exploring":[91],"avenues":[92],"automate":[94],"Abella":[96,127],"theorem":[97],"prover,":[98],"relies":[100],"on":[101],"relational":[102,141],"specifications,":[103],"where":[105],"theorems":[106],"typical":[108],"proof":[109],"developments":[110],"essentially":[112],"formulas.":[114],"illustrate":[116],"potential":[118],"benefits":[119],"automating":[121],"by":[128],"presenting":[129],"examples":[130],"that":[131],"compute":[132],"congruence":[133],"closure":[134],"assist":[136],"other":[138],"equational":[139],"reasoning":[142],"tasks.":[143]},"counts_by_year":[],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}