{"id":"https://openalex.org/W2002057804","doi":"https://doi.org/10.1016/s1571-0661(05)01137-0","title":"Proof-search and Proof Nets in Mixed Linear Logic","display_name":"Proof-search and Proof Nets in Mixed Linear Logic","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2002057804","doi":"https://doi.org/10.1016/s1571-0661(05)01137-0","mag":"2002057804"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(05)01137-0","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)01137-0","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/s1571-0661(05)01137-0","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5031692169","display_name":"Didier Galmiche","orcid":"https://orcid.org/0000-0002-9968-5323"},"institutions":[{"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"]},{"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"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"D. Galmiche","raw_affiliation_strings":["LORIA UMR 7503 \u2013 UHP Nancy 1 Campus Scientifique, BP 239 Vand\u0153uvre-l\u00e8s-Nancy, France"],"affiliations":[{"raw_affiliation_string":"LORIA UMR 7503 \u2013 UHP Nancy 1 Campus Scientifique, BP 239 Vand\u0153uvre-l\u00e8s-Nancy, France","institution_ids":["https://openalex.org/I90183372","https://openalex.org/I4210121838"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009659739","display_name":"Jean-Marc Notin","orcid":null},"institutions":[{"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":true,"raw_author_name":"J.M. Notin","raw_affiliation_strings":["LORIA UMR 7503 \u2013 UHP Nancy 1 Campus Scientifique, BP 239 Vand\u0153uvre-l\u00e8s-Nancy, France"],"affiliations":[{"raw_affiliation_string":"LORIA UMR 7503 \u2013 UHP Nancy 1 Campus Scientifique, BP 239 Vand\u0153uvre-l\u00e8s-Nancy, France","institution_ids":["https://openalex.org/I90183372","https://openalex.org/I4210121838"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5009659739","https://openalex.org/A5031692169"],"corresponding_institution_ids":["https://openalex.org/I4210121838","https://openalex.org/I90183372"],"apc_list":null,"apc_paid":null,"fwci":2.6532,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.90613387,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":"37","issue":null,"first_page":"1","last_page":"33"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":1.0,"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":1.0,"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.9997000098228455,"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.9990000128746033,"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/linear-logic","display_name":"Linear logic","score":0.7938773036003113},{"id":"https://openalex.org/keywords/structural-proof-theory","display_name":"Structural proof theory","score":0.780653178691864},{"id":"https://openalex.org/keywords/proof-complexity","display_name":"Proof complexity","score":0.6319758892059326},{"id":"https://openalex.org/keywords/noncommutative-geometry","display_name":"Noncommutative geometry","score":0.5883935689926147},{"id":"https://openalex.org/keywords/proof-of-concept","display_name":"Proof of concept","score":0.5675948858261108},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.5640316605567932},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.5583699941635132},{"id":"https://openalex.org/keywords/commutative-property","display_name":"Commutative property","score":0.5321221947669983},{"id":"https://openalex.org/keywords/proof-theory","display_name":"Proof theory","score":0.5062638521194458},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47315749526023865},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4667321443557739},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4520934224128723},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3646014928817749},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.29243093729019165},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.15262478590011597},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.07014822959899902}],"concepts":[{"id":"https://openalex.org/C28077239","wikidata":"https://www.wikidata.org/wiki/Q841728","display_name":"Linear logic","level":2,"score":0.7938773036003113},{"id":"https://openalex.org/C195653647","wikidata":"https://www.wikidata.org/wiki/Q7625047","display_name":"Structural proof theory","level":4,"score":0.780653178691864},{"id":"https://openalex.org/C105605280","wikidata":"https://www.wikidata.org/wiki/Q7249999","display_name":"Proof complexity","level":3,"score":0.6319758892059326},{"id":"https://openalex.org/C68797384","wikidata":"https://www.wikidata.org/wiki/Q2746792","display_name":"Noncommutative geometry","level":2,"score":0.5883935689926147},{"id":"https://openalex.org/C124978682","wikidata":"https://www.wikidata.org/wiki/Q1201019","display_name":"Proof of concept","level":2,"score":0.5675948858261108},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.5640316605567932},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.5583699941635132},{"id":"https://openalex.org/C183778304","wikidata":"https://www.wikidata.org/wiki/Q165474","display_name":"Commutative property","level":2,"score":0.5321221947669983},{"id":"https://openalex.org/C2318724","wikidata":"https://www.wikidata.org/wiki/Q852732","display_name":"Proof theory","level":3,"score":0.5062638521194458},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47315749526023865},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4667321443557739},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4520934224128723},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3646014928817749},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.29243093729019165},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.15262478590011597},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.07014822959899902},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1016/s1571-0661(05)01137-0","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)01137-0","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.144.1151","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.144.1151","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.loria.fr/~galmiche/=papers/Mixed-proof.ps.gz","raw_type":"text"},{"id":"pmh:oai:HAL:inria-00099227v1","is_oa":false,"landing_page_url":"https://inria.hal.science/inria-00099227","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":"Electronic Notes in Theoretical Computer Science, 2001, 37, pp.1-33","raw_type":"Journal articles"}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(05)01137-0","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)01137-0","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W147093031","https://openalex.org/W1487237605","https://openalex.org/W1499443302","https://openalex.org/W1530615807","https://openalex.org/W1583513531","https://openalex.org/W1590029082","https://openalex.org/W1606670493","https://openalex.org/W1973260109","https://openalex.org/W1987835101","https://openalex.org/W1989713129","https://openalex.org/W2007362771","https://openalex.org/W2010171977","https://openalex.org/W2033995205","https://openalex.org/W2040807747","https://openalex.org/W2074070481","https://openalex.org/W2078432227","https://openalex.org/W2079171825","https://openalex.org/W2148854889","https://openalex.org/W2163870768","https://openalex.org/W4292002792","https://openalex.org/W6606070266","https://openalex.org/W6629837467","https://openalex.org/W6632800853","https://openalex.org/W6681863486"],"related_works":["https://openalex.org/W4312475206","https://openalex.org/W4387322292","https://openalex.org/W2722497084","https://openalex.org/W2263677784","https://openalex.org/W4295538670","https://openalex.org/W2151894250","https://openalex.org/W3189967158","https://openalex.org/W4287024315","https://openalex.org/W1916795416","https://openalex.org/W2007362771"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,36],"study":[4],"how":[5],"to":[6,57,61,72,77,90,98],"design":[7],"proof-search":[8,40],"methods":[9,87],"for":[10],"the":[11,29,45,55,64,70,81,93,99],"multiplicative":[12],"fragment":[13],"of":[14,28,47,101],"Mixed":[15],"Linear":[16],"Logic":[17],"which":[18],"combines":[19],"both":[20,42],"commutative":[21],"and":[22,31,68,79,95],"noncommutative":[23],"connectives.":[24],"After":[25],"an":[26],"analysis":[27],"interaction":[30],"relationships":[32],"between":[33],"these":[34],"connectives,":[35],"propose":[37],"two":[38],"different":[39],"algorithms,":[41],"based":[43],"on":[44],"construction":[46],"labelled":[48],"proof":[49,65,85],"nets.":[50],"The":[51],"labels":[52],"allow":[53],"in":[54,69],"former":[56],"fix":[58],"some":[59,74,102],"constraints":[60],"satisfy":[62],"during":[63],"net":[66],"search":[67],"latter":[71],"propagate":[73],"informations":[75],"useful":[76,89],"guide":[78],"control":[80],"search.":[82],"Such":[83],"based-on":[84],"nets":[86],"are":[88],"efficiently":[91],"detect":[92],"non-provability":[94],"could":[96],"lead":[97],"generation":[100],"countermodels.":[103]},"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}