{"id":"https://openalex.org/W1975895350","doi":"https://doi.org/10.1007/978-3-642-28729-9_11","title":"Extending ${\\cal H}_1$ -Clauses with Path Disequalities","display_name":"Extending ${\\cal H}_1$ -Clauses with Path Disequalities","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W1975895350","doi":"https://doi.org/10.1007/978-3-642-28729-9_11","mag":"1975895350"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-28729-9_11","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-28729-9_11","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/A5080676686","display_name":"Helmut Seidl","orcid":"https://orcid.org/0000-0002-2135-1593"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Helmut Seidl","raw_affiliation_strings":["Institut f\u00fcr Informatik I2, Technische Universit\u00e4t M\u00fcnchen, Boltzmannstra\u00dfe 3, D-85748, Garching, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik I2, Technische Universit\u00e4t M\u00fcnchen, Boltzmannstra\u00dfe 3, D-85748, Garching, Germany","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057947222","display_name":"Andreas Reu\u00df","orcid":null},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Andreas Reu\u00df","raw_affiliation_strings":["Institut f\u00fcr Informatik I2, Technische Universit\u00e4t M\u00fcnchen, Boltzmannstra\u00dfe 3, D-85748, Garching, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik I2, Technische Universit\u00e4t M\u00fcnchen, Boltzmannstra\u00dfe 3, D-85748, Garching, Germany","institution_ids":["https://openalex.org/I62916508"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5080676686"],"corresponding_institution_ids":["https://openalex.org/I62916508"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.7726,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.70712909,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"165","last_page":"179"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9952999949455261,"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.9952999949455261,"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.9952999949455261,"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/T11598","display_name":"Internet Traffic Analysis and Secure E-voting","score":0.9947999715805054,"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/cryptographic-nonce","display_name":"Cryptographic nonce","score":0.798753023147583},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.7512236833572388},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7146648168563843},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6956545114517212},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.683877170085907},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6204298138618469},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.6077725291252136},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.5201919078826904},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.49846601486206055},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43567830324172974},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4228877127170563},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.34471118450164795},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3204158544540405},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25106000900268555},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.23941570520401},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.08533722162246704}],"concepts":[{"id":"https://openalex.org/C9996903","wikidata":"https://www.wikidata.org/wiki/Q1749235","display_name":"Cryptographic nonce","level":3,"score":0.798753023147583},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7512236833572388},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7146648168563843},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6956545114517212},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.683877170085907},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6204298138618469},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.6077725291252136},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.5201919078826904},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.49846601486206055},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43567830324172974},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4228877127170563},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34471118450164795},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3204158544540405},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25106000900268555},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.23941570520401},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.08533722162246704},{"id":"https://openalex.org/C148730421","wikidata":"https://www.wikidata.org/wiki/Q141090","display_name":"Encryption","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-28729-9_11","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-28729-9_11","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"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.47999998927116394,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1479744988","https://openalex.org/W1480600454","https://openalex.org/W1522049580","https://openalex.org/W1552360561","https://openalex.org/W1553458439","https://openalex.org/W1571999050","https://openalex.org/W1581717847","https://openalex.org/W1589756554","https://openalex.org/W1606555018","https://openalex.org/W1972507301","https://openalex.org/W2000550348","https://openalex.org/W2014118070","https://openalex.org/W2124548094","https://openalex.org/W2132638915","https://openalex.org/W2154274309","https://openalex.org/W2170630946","https://openalex.org/W2497309888","https://openalex.org/W2499957903","https://openalex.org/W2611288859"],"related_works":["https://openalex.org/W2585563416","https://openalex.org/W1515715680","https://openalex.org/W2294297515","https://openalex.org/W2506746226","https://openalex.org/W2109489765","https://openalex.org/W3104737963","https://openalex.org/W1886746238","https://openalex.org/W2585890227","https://openalex.org/W1543051890","https://openalex.org/W2072122432"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}