{"id":"https://openalex.org/W2618311217","doi":"https://doi.org/10.1007/978-3-319-63046-5_25","title":"Scalable Fine-Grained Proofs for Formula\u00a0Processing","display_name":"Scalable Fine-Grained Proofs for Formula\u00a0Processing","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2618311217","doi":"https://doi.org/10.1007/978-3-319-63046-5_25","mag":"2618311217"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-63046-5_25","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-63046-5_25","pdf_url":null,"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":null,"license_id":null,"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":"green","oa_url":"https://research.vu.nl/en/publications/6a3c1cf5-7057-4259-91af-94efefebd1c9","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000310752","display_name":"Haniel Barbosa","orcid":"https://orcid.org/0000-0003-0188-2300"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I35046152","display_name":"Universidade Federal do Rio Grande do Norte","ror":"https://ror.org/04wn09761","country_code":"BR","type":"education","lineage":["https://openalex.org/I35046152"]},{"id":"https://openalex.org/I4210121838","display_name":"Laboratoire Lorrain de Recherche en Informatique et ses Applications","ror":"https://ror.org/02vnf0c38","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210121838","https://openalex.org/I4210159245","https://openalex.org/I90183372"]},{"id":"https://openalex.org/I90183372","display_name":"Universit\u00e9 de Lorraine","ror":"https://ror.org/04vfs2w97","country_code":"FR","type":"education","lineage":["https://openalex.org/I90183372"]}],"countries":["BR","FR"],"is_corresponding":true,"raw_author_name":"Haniel Barbosa","raw_affiliation_strings":["Universidade Federal do Rio Grande do Norte, Natal, Brazil","Universit\u00e9 de Lorraine, CNRS, Inria, LORIA, Nancy, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universidade Federal do Rio Grande do Norte, Natal, Brazil","institution_ids":["https://openalex.org/I35046152"]},{"raw_affiliation_string":"Universit\u00e9 de Lorraine, CNRS, Inria, LORIA, Nancy, France","institution_ids":["https://openalex.org/I90183372","https://openalex.org/I4210121838","https://openalex.org/I1294671590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079200257","display_name":"Jasmin Christian Blanchette","orcid":"https://orcid.org/0000-0002-8367-0936"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]},{"id":"https://openalex.org/I4210121838","display_name":"Laboratoire Lorrain de Recherche en Informatique et ses Applications","ror":"https://ror.org/02vnf0c38","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210121838","https://openalex.org/I4210159245","https://openalex.org/I90183372"]},{"id":"https://openalex.org/I865915315","display_name":"Vrije Universiteit Amsterdam","ror":"https://ror.org/008xxew50","country_code":"NL","type":"education","lineage":["https://openalex.org/I865915315"]},{"id":"https://openalex.org/I90183372","display_name":"Universit\u00e9 de Lorraine","ror":"https://ror.org/04vfs2w97","country_code":"FR","type":"education","lineage":["https://openalex.org/I90183372"]}],"countries":["DE","FR","NL"],"is_corresponding":false,"raw_author_name":"Jasmin Christian Blanchette","raw_affiliation_strings":["Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","Universit\u00e9 de Lorraine, CNRS, Inria, LORIA, Nancy, France","Vrije Universiteit Amsterdam, Amsterdam, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Universit\u00e9 de Lorraine, CNRS, Inria, LORIA, Nancy, France","institution_ids":["https://openalex.org/I90183372","https://openalex.org/I4210121838","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"Vrije Universiteit Amsterdam, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I865915315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060799584","display_name":"Pascal Fontaine","orcid":"https://orcid.org/0000-0003-4700-6031"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210121838","display_name":"Laboratoire Lorrain de Recherche en Informatique et ses Applications","ror":"https://ror.org/02vnf0c38","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210121838","https://openalex.org/I4210159245","https://openalex.org/I90183372"]},{"id":"https://openalex.org/I90183372","display_name":"Universit\u00e9 de Lorraine","ror":"https://ror.org/04vfs2w97","country_code":"FR","type":"education","lineage":["https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Pascal Fontaine","raw_affiliation_strings":["Universit\u00e9 de Lorraine, CNRS, Inria, LORIA, Nancy, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Lorraine, CNRS, Inria, LORIA, Nancy, France","institution_ids":["https://openalex.org/I90183372","https://openalex.org/I4210121838","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5000310752"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I35046152","https://openalex.org/I4210121838","https://openalex.org/I90183372"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.9788,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.88810289,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"398","last_page":"412"},"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.9977999925613403,"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.9865999817848206,"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/mathematical-proof","display_name":"Mathematical proof","score":0.923296332359314},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.738099992275238},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6201003193855286},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5320939421653748},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5174254179000854},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5038172602653503},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5018007755279541},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.4937828481197357},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4575809836387634},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.4517095983028412},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"Satisfiability modulo theories","score":0.43696457147598267},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.41937994956970215},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23855990171432495}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.923296332359314},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.738099992275238},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6201003193855286},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5320939421653748},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5174254179000854},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5038172602653503},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5018007755279541},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.4937828481197357},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4575809836387634},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.4517095983028412},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.43696457147598267},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.41937994956970215},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23855990171432495},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":8,"locations":[{"id":"doi:10.1007/978-3-319-63046-5_25","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-63046-5_25","pdf_url":null,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:research.vu.nl:publications/6a3c1cf5-7057-4259-91af-94efefebd1c9","is_oa":true,"landing_page_url":"https://hdl.handle.net/1871.1/6a3c1cf5-7057-4259-91af-94efefebd1c9","pdf_url":"https://research.vu.nl/en/publications/6a3c1cf5-7057-4259-91af-94efefebd1c9","source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"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":"Barbosa , H , Blanchette , J C , Fleury , M & Fontaine , P 2020 , ' Scalable Fine-Grained Proofs for Formula Processing ' , Journal of Automated Reasoning , vol. 64 , no. 3 , pp. 485-510 . https://doi.org/10.1007/s10817-018-09502-y","raw_type":"article"},{"id":"pmh:oai:HAL:hal-01526841v1","is_oa":false,"landing_page_url":"https://inria.hal.science/hal-01526841","pdf_url":null,"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"[Research Report] Universite de Lorraine, CNRS, Inria, LORIA, Nancy, France; Universidade Federal do Rio Grande do Norte, Natal, Brazil; Vrije Universiteit Amsterdam, Amsterdam, The Netherlands; Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany. 2017, pp.25","raw_type":"Reports"},{"id":"pmh:oai:pure.mpg.de:item_2488486","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-002E-0713-5","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Lecture Notes in Artificial Intelligence","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:pure.mpg.de:item_3238279","is_oa":false,"landing_page_url":"http://hdl.handle.net/21.11116/0000-0006-908A-B","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Automated Reasoning","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:research.vu.nl:openaire_cris_publications/6a3c1cf5-7057-4259-91af-94efefebd1c9","is_oa":true,"landing_page_url":"https://research.vu.nl/en/publications/6a3c1cf5-7057-4259-91af-94efefebd1c9","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"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":"Barbosa , H , Blanchette , J C , Fleury , M & Fontaine , P 2020 , ' Scalable Fine-Grained Proofs for Formula Processing ' , Journal of Automated Reasoning , vol. 64 , no. 3 , pp. 485-510 . https://doi.org/10.1007/s10817-018-09502-y","raw_type":"article"},{"id":"pmh:oai:research.vu.nl:publications/c5e129c5-8413-4381-aa22-5eb29391a7ae","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85026751831&partnerID=8YFLogxK","pdf_url":null,"source":{"id":"https://openalex.org/S4306400546","display_name":"Digital Academic REpository of VU University Amsterdam (Vrije Universiteit Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"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":"Barbosa, H, Blanchette, J C & Fontaine, P 2017, Scalable fine-grained proofs for formula processing. in L de Moura (ed.), Automated Deduction -CADE 26 : 26th International Conference on Automated Deduction, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10395 LNAI, Springer/Verlag, pp. 398-412, 26th International Conference on Automated Deduction, CADE-26 2017, Gothenburg, Sweden, 6/08/17. https://doi.org/10.1007/978-3-319-63046-5_25","raw_type":"contributionToPeriodical"},{"id":"pmh:vu:oai:research.vu.nl:publications/c5e129c5-8413-4381-aa22-5eb29391a7ae","is_oa":false,"landing_page_url":"https://research.vu.nl/en/publications/c5e129c5-8413-4381-aa22-5eb29391a7ae","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Automated Deduction: CADE 26 - 26th International Conference on Automated Deduction, Proceedings, 398 - 412","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":{"id":"pmh:oai:research.vu.nl:publications/6a3c1cf5-7057-4259-91af-94efefebd1c9","is_oa":true,"landing_page_url":"https://hdl.handle.net/1871.1/6a3c1cf5-7057-4259-91af-94efefebd1c9","pdf_url":"https://research.vu.nl/en/publications/6a3c1cf5-7057-4259-91af-94efefebd1c9","source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"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":"Barbosa , H , Blanchette , J C , Fleury , M & Fontaine , P 2020 , ' Scalable Fine-Grained Proofs for Formula Processing ' , Journal of Automated Reasoning , vol. 64 , no. 3 , pp. 485-510 . https://doi.org/10.1007/s10817-018-09502-y","raw_type":"article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1525532892","display_name":null,"funder_award_id":"STU 483/2-1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G4643437329","display_name":null,"funder_award_id":"13-IS02-0001","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G5548776230","display_name":"SC-square - Satisfiability Checking and Symbolic Computation: uniting two communities to solve real problems","funder_award_id":"712689","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G7189913046","display_name":null,"funder_award_id":"ANR-13-IS02-0001","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2618311217.pdf","grobid_xml":"https://content.openalex.org/works/W2618311217.grobid-xml"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W1781094","https://openalex.org/W64150172","https://openalex.org/W81349459","https://openalex.org/W155339612","https://openalex.org/W156574570","https://openalex.org/W208087222","https://openalex.org/W1216298300","https://openalex.org/W1483170865","https://openalex.org/W1498523273","https://openalex.org/W1519551513","https://openalex.org/W1522613702","https://openalex.org/W1524804222","https://openalex.org/W1552715853","https://openalex.org/W1554551469","https://openalex.org/W1967880086","https://openalex.org/W2093910552","https://openalex.org/W2106192381","https://openalex.org/W2159595840","https://openalex.org/W2293687462","https://openalex.org/W2505251503","https://openalex.org/W2583369873","https://openalex.org/W2598379852","https://openalex.org/W2600851862","https://openalex.org/W2737189788","https://openalex.org/W4250846042","https://openalex.org/W4252433905","https://openalex.org/W4256124958","https://openalex.org/W6698777470"],"related_works":["https://openalex.org/W2808944898","https://openalex.org/W3196207352","https://openalex.org/W2951724202","https://openalex.org/W3084261076","https://openalex.org/W1996614773","https://openalex.org/W4387820098","https://openalex.org/W2125274893","https://openalex.org/W4318620547","https://openalex.org/W3098927713","https://openalex.org/W2583022676"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":5},{"year":2017,"cited_by_count":2}],"updated_date":"2026-05-20T08:49:12.498775","created_date":"2025-10-10T00:00:00"}