{"id":"https://openalex.org/W2652260735","doi":"https://doi.org/10.1007/978-3-319-66167-4_14","title":"The Bernays\u2013Sch\u00f6nfinkel\u2013Ramsey Fragment with Bounded Difference Constraints over the Reals Is Decidable","display_name":"The Bernays\u2013Sch\u00f6nfinkel\u2013Ramsey Fragment with Bounded Difference Constraints over the Reals Is Decidable","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2652260735","doi":"https://doi.org/10.1007/978-3-319-66167-4_14","mag":"2652260735"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-66167-4_14","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-66167-4_14","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://inria.hal.science/hal-01592169","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034642471","display_name":"Marco Voigt","orcid":"https://orcid.org/0000-0002-5666-7125"},"institutions":[{"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"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Marco Voigt","raw_affiliation_strings":["Max Planck Institute for Informatics and Saarbr\u00fccken Graduate School of Computer Science, Saarland Informatics Campus, Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Max Planck Institute for Informatics and Saarbr\u00fccken Graduate School of Computer Science, Saarland Informatics Campus, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5034642471"],"corresponding_institution_ids":["https://openalex.org/I4210109712"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.9388,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.85004212,"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":"244","last_page":"261"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994999766349792,"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.9994999766349792,"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.9921000003814697,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9904999732971191,"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/decidability","display_name":"Decidability","score":0.8820278644561768},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.8692607879638672},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.6871652007102966},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.584359884262085},{"id":"https://openalex.org/keywords/presburger-arithmetic","display_name":"Presburger arithmetic","score":0.5490253567695618},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5461422801017761},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.539200484752655},{"id":"https://openalex.org/keywords/arity","display_name":"Arity","score":0.5341272354125977},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48405972123146057},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4729820489883423},{"id":"https://openalex.org/keywords/monadic-predicate-calculus","display_name":"Monadic predicate calculus","score":0.4148717522621155},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2927777171134949},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1244732141494751},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08895277976989746},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.05555826425552368},{"id":"https://openalex.org/keywords/higher-order-logic","display_name":"Higher-order logic","score":0.054176926612854004}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8820278644561768},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.8692607879638672},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.6871652007102966},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.584359884262085},{"id":"https://openalex.org/C5852641","wikidata":"https://www.wikidata.org/wiki/Q956059","display_name":"Presburger arithmetic","level":3,"score":0.5490253567695618},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5461422801017761},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.539200484752655},{"id":"https://openalex.org/C110546421","wikidata":"https://www.wikidata.org/wiki/Q1315869","display_name":"Arity","level":2,"score":0.5341272354125977},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48405972123146057},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4729820489883423},{"id":"https://openalex.org/C124656256","wikidata":"https://www.wikidata.org/wiki/Q6897882","display_name":"Monadic predicate calculus","level":4,"score":0.4148717522621155},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2927777171134949},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1244732141494751},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08895277976989746},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.05555826425552368},{"id":"https://openalex.org/C169896238","wikidata":"https://www.wikidata.org/wiki/Q1644136","display_name":"Higher-order logic","level":3,"score":0.054176926612854004},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-319-66167-4_14","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-66167-4_14","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:HAL:hal-01592169v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01592169","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"FroCoS 2017 - 11th International Symposium on Frontiers of Combining Systems, Sep 2017, Brasilia, Brazil. pp.244-261, ⟨10.1007/978-3-319-66167-4_14⟩","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01592169v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01592169","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"FroCoS 2017 - 11th International Symposium on Frontiers of Combining Systems, Sep 2017, Brasilia, Brazil. pp.244-261, ⟨10.1007/978-3-319-66167-4_14⟩","raw_type":"Conference papers"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W205961229","https://openalex.org/W1481689110","https://openalex.org/W1495026145","https://openalex.org/W1511737804","https://openalex.org/W1536511644","https://openalex.org/W1953825797","https://openalex.org/W1966647497","https://openalex.org/W2021891065","https://openalex.org/W2035045326","https://openalex.org/W2076908710","https://openalex.org/W2101508170","https://openalex.org/W2593309929","https://openalex.org/W2617497701","https://openalex.org/W2652260735","https://openalex.org/W4249885861"],"related_works":["https://openalex.org/W2978681838","https://openalex.org/W4302272215","https://openalex.org/W2009098458","https://openalex.org/W2619879631","https://openalex.org/W1980102547","https://openalex.org/W4390949567","https://openalex.org/W3209732136","https://openalex.org/W1506160289","https://openalex.org/W124040947","https://openalex.org/W2398566420"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}