{"id":"https://openalex.org/W19485686","doi":"https://doi.org/10.1090/dimacs/039/10","title":"Exponential lower bounds for semantic resolution","display_name":"Exponential lower bounds for semantic resolution","alternate_titles":[],"publication_year":1997,"publication_date":"1997-11-18","ids":{"openalex":"https://openalex.org/W19485686","doi":"https://doi.org/10.1090/dimacs/039/10","mag":"19485686"},"language":"en","primary_location":{"id":"doi:10.1090/dimacs/039/10","doi":"https://doi.org/10.1090/dimacs/039/10","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/039/10","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},"parent_works":[{"id":"https://openalex.org/W2979259583","display_name":"Proof Complexity and Feasible Arithmetics","relationship":"volume"}],"lineage":["https://openalex.org/W19485686","https://openalex.org/W2979259583"],"child_works_count":0,"type":"book-chapter","is_traditional":true,"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/A5048543827","display_name":"Stasys P. Jukna","orcid":"https://orcid.org/0000-0002-2786-9326","observed_orcids":["https://orcid.org/0000-0002-2786-9326"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Stasys Jukna","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5048543827"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8587,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.73243435,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"163","last_page":"172"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.35420000553131104,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.35420000553131104,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.22339999675750732,"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/T10126","display_name":"Logic, programming, and type systems","score":0.08500000089406967,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/semantic-resolution","display_name":"semantic resolution","score":0.9300000071525574},{"id":"https://openalex.org/keywords/exponential-lower-bounds","display_name":"exponential lower bounds","score":0.9710000157356262},{"id":"https://openalex.org/keywords/proof-complexity","display_name":"proof complexity","score":0.8870000243186951},{"id":"https://openalex.org/keywords/resolution-proof-systems","display_name":"resolution proof systems","score":0.5519999861717224},{"id":"https://openalex.org/keywords/propositional-logic","display_name":"propositional logic","score":0.5040000081062317},{"id":"https://openalex.org/keywords/proof-search","display_name":"proof search","score":0.3059999942779541}],"concepts":[{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.5515456795692444},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.5218226313591003},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44124525785446167},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3735077977180481},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36095285415649414},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.34118324518203735},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.25152021646499634},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.16332706809043884}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1090/dimacs/039/10","doi":"https://doi.org/10.1090/dimacs/039/10","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/039/10","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1974951277","https://openalex.org/W2130081235","https://openalex.org/W140996085","https://openalex.org/W7097335510","https://openalex.org/W7096984262","https://openalex.org/W2511902872","https://openalex.org/W1984323815","https://openalex.org/W2049059582","https://openalex.org/W4366572229","https://openalex.org/W7070907824"],"abstract_inverted_index":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W19485686","counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2016-06-24T00:00:00"}
