{"id":"https://openalex.org/W2045196404","doi":"https://doi.org/10.2168/lmcs-8(3:30)2012","title":"URSA: A System for Uniform Reduction to SAT","display_name":"URSA: A System for Uniform Reduction to SAT","publication_year":2012,"publication_date":"2012-09-30","ids":{"openalex":"https://openalex.org/W2045196404","doi":"https://doi.org/10.2168/lmcs-8(3:30)2012","mag":"2045196404"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-8(3:30)2012","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-8(3:30)2012","pdf_url":"https://lmcs.episciences.org/1171/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/1171/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5085623977","display_name":"Predrag Jani\u010di\u0107","orcid":"https://orcid.org/0000-0001-8922-4948"},"institutions":[{"id":"https://openalex.org/I4068193","display_name":"University of Belgrade","ror":"https://ror.org/02qsmb048","country_code":"RS","type":"education","lineage":["https://openalex.org/I4068193"]}],"countries":["RS"],"is_corresponding":true,"raw_author_name":"Predrag Janicic","raw_affiliation_strings":["University of Belgrade"],"affiliations":[{"raw_affiliation_string":"University of Belgrade","institution_ids":["https://openalex.org/I4068193"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5085623977"],"corresponding_institution_ids":["https://openalex.org/I4068193"],"apc_list":null,"apc_paid":null,"fwci":2.3504,"has_fulltext":true,"cited_by_count":21,"citation_normalized_percentile":{"value":0.89531629,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"Volume 8, Issue 3","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9991999864578247,"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"}},"topics":[{"id":"https://openalex.org/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9991999864578247,"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"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9973999857902527,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7480819225311279},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.6405372619628906},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5691799521446228},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.547287106513977},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.5105768442153931},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5100923180580139},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.4785221815109253},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.45682457089424133},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4278271496295929},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2433963418006897},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21731707453727722},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11816146969795227}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7480819225311279},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.6405372619628906},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5691799521446228},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.547287106513977},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.5105768442153931},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5100923180580139},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.4785221815109253},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45682457089424133},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4278271496295929},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2433963418006897},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21731707453727722},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11816146969795227},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.2168/lmcs-8(3:30)2012","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-8(3:30)2012","pdf_url":"https://lmcs.episciences.org/1171/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1012.1255","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1012.1255","pdf_url":"https://arxiv.org/pdf/1012.1255","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:doaj.org/article:5cd769dc64504ae8af4e435509a4546c","is_oa":true,"landing_page_url":"https://doaj.org/article/5cd769dc64504ae8af4e435509a4546c","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 8, Issue 3 (2012)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-8(3:30)2012","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-8(3:30)2012","pdf_url":"https://lmcs.episciences.org/1171/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G201303782","display_name":"Kalzium bindende Proteine und neuronale Erregbarkeit","funder_award_id":"27979","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G4765615378","display_name":null,"funder_award_id":"IZ73Z0","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G6586369573","display_name":null,"funder_award_id":"127979","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"},{"id":"https://openalex.org/G846863906","display_name":null,"funder_award_id":"SCOPES","funder_id":"https://openalex.org/F4320320924","funder_display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung"}],"funders":[{"id":"https://openalex.org/F4320320924","display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","ror":"https://ror.org/00yjd3n13"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2045196404.pdf","grobid_xml":"https://content.openalex.org/works/W2045196404.grobid-xml"},"referenced_works_count":66,"referenced_works":["https://openalex.org/W19153916","https://openalex.org/W76341307","https://openalex.org/W123065924","https://openalex.org/W1484559376","https://openalex.org/W1491554327","https://openalex.org/W1504520037","https://openalex.org/W1513176853","https://openalex.org/W1513230022","https://openalex.org/W1518705996","https://openalex.org/W1521081248","https://openalex.org/W1543681538","https://openalex.org/W1544693717","https://openalex.org/W1549774509","https://openalex.org/W1550790359","https://openalex.org/W1579011093","https://openalex.org/W1579337158","https://openalex.org/W1579638562","https://openalex.org/W1583108239","https://openalex.org/W1583771634","https://openalex.org/W1586677474","https://openalex.org/W1587258621","https://openalex.org/W1590910789","https://openalex.org/W1603939277","https://openalex.org/W1607801167","https://openalex.org/W1672530173","https://openalex.org/W1819209966","https://openalex.org/W1881883738","https://openalex.org/W1923495615","https://openalex.org/W1976055110","https://openalex.org/W1980107758","https://openalex.org/W1982482731","https://openalex.org/W2000059300","https://openalex.org/W2014205104","https://openalex.org/W2021196646","https://openalex.org/W2030455524","https://openalex.org/W2036265926","https://openalex.org/W2057361103","https://openalex.org/W2061097805","https://openalex.org/W2062897452","https://openalex.org/W2063727779","https://openalex.org/W2070717151","https://openalex.org/W2081396056","https://openalex.org/W2082172430","https://openalex.org/W2098156778","https://openalex.org/W2100699693","https://openalex.org/W2101512909","https://openalex.org/W2105829631","https://openalex.org/W2109077605","https://openalex.org/W2110311336","https://openalex.org/W2111979987","https://openalex.org/W2114873590","https://openalex.org/W2115207428","https://openalex.org/W2117182850","https://openalex.org/W2118229393","https://openalex.org/W2118406528","https://openalex.org/W2129538349","https://openalex.org/W2131719221","https://openalex.org/W2142785340","https://openalex.org/W2143775744","https://openalex.org/W2147148915","https://openalex.org/W2158651374","https://openalex.org/W2159875930","https://openalex.org/W2165675194","https://openalex.org/W2605289564","https://openalex.org/W2914540762","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4243324743","https://openalex.org/W2532234348","https://openalex.org/W1514298554","https://openalex.org/W4291309325","https://openalex.org/W2950474130","https://openalex.org/W4313469555","https://openalex.org/W2737452945","https://openalex.org/W1547011777","https://openalex.org/W1514706798","https://openalex.org/W1985899403"],"abstract_inverted_index":{"There":[0],"are":[1,104],"a":[2,35,42,55,136,149],"huge":[3],"number":[4],"of":[5,41,45,77,83,166],"problems,":[6],"from":[7],"various":[8],"areas,":[9],"being":[10],"solved":[11,98,117],"by":[12,26,47,74,99,108,118,141],"reducing":[13,48,142],"them":[14,49,143],"to":[15,50,69,144,179],"SAT.":[16,51],"However,":[17],"for":[18,38,138],"many":[19,89],"applications,":[20],"translation":[21],"into":[22],"SAT":[23,70],"is":[24,71,86,177],"performed":[25,171],"specialized,":[27],"problem-specific":[28],"tools.":[29],"In":[30,157],"this":[31,158],"paper":[32],"we":[33,160],"describe":[34,162],"new":[36,56],"system":[37,53,129,153,176],"uniform":[39],"solving":[40,139,152],"wide":[43,87],"class":[44],"problems":[46,91,105,140],"The":[52,67,81,170],"uses":[54],"specification":[57,79],"language":[58],"URSA":[59],"that":[60,174],"combines":[61],"imperative":[62],"and":[63,96,102],"declarative":[64],"programming":[65,121,125],"paradigms.":[66],"reduction":[68],"defined":[72],"precisely":[73],"the":[75,78,84,100,109,128,167,175],"semantics":[76],"language.":[80],"domain":[82],"approach":[85],"(e.g.,":[88],"NP-complete":[90],"can":[92,114,130],"be":[93,115,131],"simply":[94],"specified":[95],"then":[97],"system)":[101],"there":[103],"easily":[106],"solvable":[107],"proposed":[110],"system,":[111],"while":[112],"they":[113],"hardly":[116],"using":[119],"other":[120],"languages":[122],"or":[123],"constraint":[124,151],"systems.":[126,183],"So,":[127],"seen":[132],"not":[133],"only":[134],"as":[135,148],"tool":[137],"SAT,":[145],"but":[146],"also":[147,161],"general-purpose":[150],"(for":[154],"finite":[155],"domains).":[156],"paper,":[159],"an":[163],"open-source":[164],"implementation":[165],"described":[168],"approach.":[169],"experiments":[172],"suggest":[173],"competitive":[178],"state-of-the-art":[180],"related":[181],"modelling":[182]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}