{"id":"https://openalex.org/W2887907097","doi":"https://doi.org/10.4230/oasics.iclp.2018.11","title":"SMT-Based Answer Set Solver CMODELS(DIFF) (System Description)","display_name":"SMT-Based Answer Set Solver CMODELS(DIFF) (System Description)","alternate_titles":[],"publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2887907097","doi":"https://doi.org/10.4230/oasics.iclp.2018.11","mag":"2887907097"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:9877","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.11","pdf_url":"https://drops.dagstuhl.de/storage/01oasics/oasics-vol064-iclp2018/OASIcs.ICLP.2018.11/OASIcs.ICLP.2018.11.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"InProceedings"},"parent_works":[{"id":"https://openalex.org/W6910248511","display_name":"OASIcs, Volume 64, ICLP'18, Complete Volume","relationship":"part"}],"lineage":["https://openalex.org/W2887907097","https://openalex.org/W6910248511"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/01oasics/oasics-vol064-iclp2018/OASIcs.ICLP.2018.11/OASIcs.ICLP.2018.11.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5017119333","display_name":"Da Shen","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I122266389","display_name":"University of Nebraska at Omaha","ror":"https://ror.org/04yrkc140","country_code":"US","type":"education","lineage":["https://openalex.org/I122266389"]},{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shen, Da","raw_affiliation_strings":["Department of Computer Science, University of Nebraska at Omaha, South 67th Street, Omaha, NE 68182, USA","University of Maryland, College Park, College Park, United States"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Nebraska at Omaha, South 67th Street, Omaha, NE 68182, USA","institution_ids":["https://openalex.org/I122266389"]},{"raw_affiliation_string":"University of Maryland, College Park, College Park, United States","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008816972","display_name":"Yuliya Lierler","orcid":"https://orcid.org/0000-0002-6146-623X","observed_orcids":["https://orcid.org/0000-0002-6146-623X"]},"institutions":[{"id":"https://openalex.org/I122266389","display_name":"University of Nebraska at Omaha","ror":"https://ror.org/04yrkc140","country_code":"US","type":"education","lineage":["https://openalex.org/I122266389"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lierler, Yuliya","raw_affiliation_strings":["Department of Computer Science, University of Nebraska at Omaha, South 67th Street, Omaha, NE 68182, USA","University of Nebraska at Omaha, Omaha, United States"],"raw_orcid":"https://orcid.org/0000-0002-6146-623X","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Nebraska at Omaha, South 67th Street, Omaha, NE 68182, USA","institution_ids":["https://openalex.org/I122266389"]},{"raw_affiliation_string":"University of Nebraska at Omaha, Omaha, United States","institution_ids":["https://openalex.org/I122266389"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1077,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.42792377,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":86,"max":94},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9785000085830688,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9785000085830688,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.007499999832361937,"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.0015999999595806003,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/answer-set-solvers","display_name":"answer set solvers","score":0.8870000243186951},{"id":"https://openalex.org/keywords/satisfiability-modulo-theories","display_name":"satisfiability modulo theories","score":0.8619999885559082},{"id":"https://openalex.org/keywords/logic-programs","display_name":"logic programs","score":0.781000018119812},{"id":"https://openalex.org/keywords/answer-set-computation","display_name":"answer set computation","score":0.38999998569488525}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7005529999732971},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6225166916847229},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5433796644210815},{"id":"https://openalex.org/C3019612716","wikidata":"https://www.wikidata.org/wiki/Q730920","display_name":"Problem solver","level":2,"score":0.4820300340652466},{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.4510740637779236},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.36095309257507324},{"id":"https://openalex.org/C459310","wikidata":"https://www.wikidata.org/wiki/Q117801","display_name":"Computational science","level":1,"score":0.2722368836402893}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:9877","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.11","pdf_url":"https://drops.dagstuhl.de/storage/01oasics/oasics-vol064-iclp2018/OASIcs.ICLP.2018.11/OASIcs.ICLP.2018.11.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/oasics.iclp.2018.11","doi":"https://doi.org/10.4230/oasics.iclp.2018.11","is_oa":true,"landing_page_url":"https://doi.org/10.4230/oasics.iclp.2018.11","pdf_url":null,"source":{"id":"https://openalex.org/S7407061190","display_name":"OASIcs : OpenAccess Series in Informatics","issn_l":"2190-6807","issn":["2190-6807"],"is_oa":true,"is_in_doaj":true,"is_core":false,"listed_in":["doaj"],"host_organization":"https://openalex.org/P4310313770","host_organization_name":"Schloss Dagstuhl \u2014 Leibniz-Zentrum fuer Informatik","host_organization_lineage":["https://openalex.org/P4310313770"],"host_organization_lineage_names":["Schloss Dagstuhl \u2014 Leibniz-Zentrum fuer Informatik"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},{"id":"mag:2887907097","doi":null,"is_oa":false,"landing_page_url":"https://works.bepress.com/yuliya_lierler/79/","pdf_url":null,"source":{"id":"https://openalex.org/S4306419642","display_name":"International Conference on Logic Programming","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"International Conference on Logic Programming","raw_type":null}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:9877","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.11","pdf_url":"https://drops.dagstuhl.de/storage/01oasics/oasics-vol064-iclp2018/OASIcs.ICLP.2018.11/OASIcs.ICLP.2018.11.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G7743475462","display_name":"RI: Small: Automated Optimization of Programs and Processing Tools in Answer Set Programming","funder_award_id":"1707371","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2887907097.pdf","grobid_xml":"https://content.openalex.org/works/W2887907097.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W1481294694","https://openalex.org/W1505818550","https://openalex.org/W1549449731","https://openalex.org/W1577827016","https://openalex.org/W1584297074","https://openalex.org/W1589232796","https://openalex.org/W1694306392","https://openalex.org/W1766332311","https://openalex.org/W2004414305","https://openalex.org/W2087563242","https://openalex.org/W2130489957","https://openalex.org/W2159875930","https://openalex.org/W2180614101","https://openalex.org/W2304178603","https://openalex.org/W2399343913","https://openalex.org/W2401337862","https://openalex.org/W2460803124","https://openalex.org/W2470355232","https://openalex.org/W7043103689"],"related_works":["https://openalex.org/W2160562204","https://openalex.org/W1530155240","https://openalex.org/W1555272910","https://openalex.org/W2283737044","https://openalex.org/W1712761282","https://openalex.org/W1587265115","https://openalex.org/W1630439664","https://openalex.org/W2100622236","https://openalex.org/W1523419405","https://openalex.org/W2433033450"],"abstract_inverted_index":{"Many":[0],"answer":[1,30,45,66],"set":[2,67],"solvers":[3,6,12,27],"utilize":[4],"Satisfiability":[5,9,14,24],"for":[7],"search.":[8],"Modulo":[10,25],"Theory":[11,26],"extend":[13],"solvers.":[15],"This":[16],"paper":[17],"presents":[18],"the":[19],"CMODELS(DIFF)":[20,62],"system":[21],"that":[22,61],"uses":[23],"to":[28],"find":[29],"sets":[31,46],"of":[32,44,47],"a":[33,48,64],"logic":[34,49],"program.":[35],"Its":[36],"theoretical":[37],"foundation":[38],"is":[39,63],"based":[40],"on":[41],"Niemala's":[42],"characterization":[43],"program":[50],"via":[51],"so":[52],"called":[53],"level":[54],"rankings.":[55],"The":[56],"comparative":[57],"experimental":[58],"analysis":[59],"demonstrates":[60],"viable":[65],"solver.":[68]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2887907097","counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-11-17T12:49:18.490984","created_date":"2018-08-22T00:00:00"}
