{"id":"https://openalex.org/W2127882277","doi":"https://doi.org/10.1007/978-3-642-40885-4_15","title":"Non-cyclic Sorts for First-Order Satisfiability","display_name":"Non-cyclic Sorts for First-Order Satisfiability","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2127882277","doi":"https://doi.org/10.1007/978-3-642-40885-4_15","mag":"2127882277"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-40885-4_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-40885-4_15","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/A5040847270","display_name":"Konstantin Korovin","orcid":"https://orcid.org/0000-0002-0740-621X"},"institutions":[{"id":"https://openalex.org/I28407311","display_name":"University of Manchester","ror":"https://ror.org/027m9bs27","country_code":"GB","type":"education","lineage":["https://openalex.org/I28407311"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Konstantin Korovin","raw_affiliation_strings":["School of Computer Science, The University of Manchester, United Kingdom"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, The University of Manchester, United Kingdom","institution_ids":["https://openalex.org/I28407311"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5040847270"],"corresponding_institution_ids":["https://openalex.org/I28407311"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.7085,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.91097478,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"214","last_page":"228"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9994999766349792,"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":0.9994999766349792,"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.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.9991000294685364,"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/fragment","display_name":"Fragment (logic)","score":0.8500974774360657},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.7832472324371338},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.755103349685669},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6707991361618042},{"id":"https://openalex.org/keywords/translation","display_name":"Translation (biology)","score":0.5253821611404419},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4947461783885956},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.43136030435562134},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41183003783226013}],"concepts":[{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.8500974774360657},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7832472324371338},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.755103349685669},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6707991361618042},{"id":"https://openalex.org/C149364088","wikidata":"https://www.wikidata.org/wiki/Q185917","display_name":"Translation (biology)","level":4,"score":0.5253821611404419},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4947461783885956},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.43136030435562134},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41183003783226013},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C105580179","wikidata":"https://www.wikidata.org/wiki/Q188928","display_name":"Messenger RNA","level":3,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/978-3-642-40885-4_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-40885-4_15","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:pure.atira.dk:openaire_cris_publications/3c939e5c-92f6-4fbb-a9ec-5349c6685cf5","is_oa":false,"landing_page_url":"https://research.manchester.ac.uk/en/publications/3c939e5c-92f6-4fbb-a9ec-5349c6685cf5","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Korovin, K 2013, Non-cyclic Sorts for First-Order Satisfiability. in Frontiers of Combining Systems - 9th International Symposium, FroCoS 2013, Nancy, France, September 18-20, 2013. Proceedings. pp. 214-228. https://doi.org/10.1007/978-3-642-40885-4_15","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.381.657","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.381.657","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.man.ac.uk/~korovink/my_pub/frocos_non_cyclic_2013.pdf","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:publications/3c939e5c-92f6-4fbb-a9ec-5349c6685cf5","is_oa":false,"landing_page_url":"https://www.research.manchester.ac.uk/portal/en/publications/noncyclic-sorts-for-firstorder-satisfiability(3c939e5c-92f6-4fbb-a9ec-5349c6685cf5).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400662","display_name":"Research Explorer (The University of Manchester)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I28407311","host_organization_name":"University of Manchester","host_organization_lineage":["https://openalex.org/I28407311"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Korovin, K 2013, Non-cyclic Sorts for First-Order Satisfiability. in Frontiers of Combining Systems - 9th International Symposium, FroCoS 2013, Nancy, France, September 18-20, 2013. Proceedings. pp. 214-228. https://doi.org/10.1007/978-3-642-40885-4_15","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W26338302","https://openalex.org/W59103672","https://openalex.org/W136844454","https://openalex.org/W148663991","https://openalex.org/W158985585","https://openalex.org/W1214709765","https://openalex.org/W1507273773","https://openalex.org/W1508989423","https://openalex.org/W1520118813","https://openalex.org/W1534896904","https://openalex.org/W1536511644","https://openalex.org/W1538009249","https://openalex.org/W1551824194","https://openalex.org/W1556566737","https://openalex.org/W1573992413","https://openalex.org/W1589439023","https://openalex.org/W1590111213","https://openalex.org/W1590233219","https://openalex.org/W1596722521","https://openalex.org/W1597663530","https://openalex.org/W1606555018","https://openalex.org/W1807555267","https://openalex.org/W1966048066","https://openalex.org/W1971727793","https://openalex.org/W1999468161","https://openalex.org/W2002331993","https://openalex.org/W2018970941","https://openalex.org/W2098095758","https://openalex.org/W2118382442","https://openalex.org/W2132638915","https://openalex.org/W2145377870","https://openalex.org/W2151523288","https://openalex.org/W2162131937","https://openalex.org/W2167964658","https://openalex.org/W2408386962","https://openalex.org/W2798401172","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2752930545","https://openalex.org/W2040430117","https://openalex.org/W2118701833","https://openalex.org/W3101316517","https://openalex.org/W2294297515","https://openalex.org/W1543051890","https://openalex.org/W2585890227","https://openalex.org/W2072122432","https://openalex.org/W2789140669","https://openalex.org/W4296306758"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}