{"id":"https://openalex.org/W1608173173","doi":"https://doi.org/10.1007/978-3-642-02777-2_37","title":"A Compact Representation for Syntactic Dependencies in QBFs","display_name":"A Compact Representation for Syntactic Dependencies in QBFs","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W1608173173","doi":"https://doi.org/10.1007/978-3-642-02777-2_37","mag":"1608173173"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-02777-2_37","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-02777-2_37","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5040670461","display_name":"Florian Lonsing","orcid":"https://orcid.org/0000-0002-5715-7231"},"institutions":[{"id":"https://openalex.org/I121883995","display_name":"Johannes Kepler University of Linz","ror":"https://ror.org/052r2xn60","country_code":"AT","type":"education","lineage":["https://openalex.org/I121883995"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Florian Lonsing","raw_affiliation_strings":["Institute for Formal Models and Verification, Johannes Kepler University, Linz, Austria","Institute for Formal Models and Verification Johannes Kepler University, Linz, Austria"],"affiliations":[{"raw_affiliation_string":"Institute for Formal Models and Verification, Johannes Kepler University, Linz, Austria","institution_ids":["https://openalex.org/I121883995"]},{"raw_affiliation_string":"Institute for Formal Models and Verification Johannes Kepler University, Linz, Austria","institution_ids":["https://openalex.org/I121883995"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082596567","display_name":"Armin Biere","orcid":"https://orcid.org/0000-0001-7170-9242"},"institutions":[{"id":"https://openalex.org/I121883995","display_name":"Johannes Kepler University of Linz","ror":"https://ror.org/052r2xn60","country_code":"AT","type":"education","lineage":["https://openalex.org/I121883995"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Armin Biere","raw_affiliation_strings":["Institute for Formal Models and Verification, Johannes Kepler University, Linz, Austria","Institute for Formal Models and Verification Johannes Kepler University, Linz, Austria"],"affiliations":[{"raw_affiliation_string":"Institute for Formal Models and Verification, Johannes Kepler University, Linz, Austria","institution_ids":["https://openalex.org/I121883995"]},{"raw_affiliation_string":"Institute for Formal Models and Verification Johannes Kepler University, Linz, Austria","institution_ids":["https://openalex.org/I121883995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5040670461"],"corresponding_institution_ids":["https://openalex.org/I121883995"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.2552,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.92636139,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"398","last_page":"411"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9991999864578247,"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/T10142","display_name":"Formal Methods in Verification","score":0.9991999864578247,"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.9918000102043152,"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.9855999946594238,"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/computer-science","display_name":"Computer science","score":0.696577250957489},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.65696781873703},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5219475626945496},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.5132951140403748},{"id":"https://openalex.org/keywords/dependency-graph","display_name":"Dependency graph","score":0.48607710003852844},{"id":"https://openalex.org/keywords/quantifier","display_name":"Quantifier (linguistics)","score":0.46765393018722534},{"id":"https://openalex.org/keywords/true-quantified-boolean-formula","display_name":"True quantified Boolean formula","score":0.4469413757324219},{"id":"https://openalex.org/keywords/dependency","display_name":"Dependency (UML)","score":0.4363539218902588},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.42690131068229675},{"id":"https://openalex.org/keywords/quantifier-elimination","display_name":"Quantifier elimination","score":0.4155120253562927},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4009197950363159},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.32292017340660095},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27512210607528687},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.24270591139793396},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.22498294711112976},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.20399650931358337}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.696577250957489},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.65696781873703},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5219475626945496},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.5132951140403748},{"id":"https://openalex.org/C16311509","wikidata":"https://www.wikidata.org/wiki/Q4148050","display_name":"Dependency graph","level":3,"score":0.48607710003852844},{"id":"https://openalex.org/C2778523021","wikidata":"https://www.wikidata.org/wiki/Q5532504","display_name":"Quantifier (linguistics)","level":2,"score":0.46765393018722534},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.4469413757324219},{"id":"https://openalex.org/C19768560","wikidata":"https://www.wikidata.org/wiki/Q320727","display_name":"Dependency (UML)","level":2,"score":0.4363539218902588},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.42690131068229675},{"id":"https://openalex.org/C32278780","wikidata":"https://www.wikidata.org/wiki/Q1849020","display_name":"Quantifier elimination","level":2,"score":0.4155120253562927},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4009197950363159},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.32292017340660095},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27512210607528687},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24270591139793396},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.22498294711112976},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.20399650931358337}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-642-02777-2_37","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-02777-2_37","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:CiteSeerX.psu:10.1.1.365.32","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.365.32","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://fmv.jku.at/papers/LonsingBiere-SAT09.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W69898213","https://openalex.org/W1482661140","https://openalex.org/W1488842140","https://openalex.org/W1494899888","https://openalex.org/W1496518193","https://openalex.org/W1513165874","https://openalex.org/W1515623105","https://openalex.org/W1553278548","https://openalex.org/W1558152194","https://openalex.org/W1571893670","https://openalex.org/W1603813317","https://openalex.org/W1800123991","https://openalex.org/W1836852804","https://openalex.org/W1877759623","https://openalex.org/W1976876676","https://openalex.org/W1986022261","https://openalex.org/W1998084650","https://openalex.org/W2005573219","https://openalex.org/W2012165860","https://openalex.org/W2025137085","https://openalex.org/W2039585983","https://openalex.org/W2067627899","https://openalex.org/W2108447646","https://openalex.org/W2108530105","https://openalex.org/W2110920860","https://openalex.org/W2127982853","https://openalex.org/W2481330961","https://openalex.org/W2798401172"],"related_works":["https://openalex.org/W4214737172","https://openalex.org/W3012938552","https://openalex.org/W2324712051","https://openalex.org/W2798639752","https://openalex.org/W1524103539","https://openalex.org/W4287825236","https://openalex.org/W1239946963","https://openalex.org/W2400855043","https://openalex.org/W3136261533","https://openalex.org/W2235115558"],"abstract_inverted_index":null,"counts_by_year":[{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}