{"id":"https://openalex.org/W3199888975","doi":"https://doi.org/10.4204/eptcs.345.30","title":"Modeling and Solving Graph Synthesis Problems Using SAT-Encoded Reachability Constraints in Picat","display_name":"Modeling and Solving Graph Synthesis Problems Using SAT-Encoded Reachability Constraints in Picat","publication_year":2021,"publication_date":"2021-09-15","ids":{"openalex":"https://openalex.org/W3199888975","doi":"https://doi.org/10.4204/eptcs.345.30","mag":"3199888975"},"language":"en","primary_location":{"id":"doi:10.4204/eptcs.345.30","is_oa":true,"landing_page_url":"https://doi.org/10.4204/eptcs.345.30","pdf_url":"https://arxiv.org/pdf/2109.08293","source":{"id":"https://openalex.org/S4210216316","display_name":"Electronic Proceedings in Theoretical Computer Science","issn_l":"2075-2180","issn":["2075-2180"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310318029","host_organization_name":"Open Publishing Association","host_organization_lineage":["https://openalex.org/P4310318029"],"host_organization_lineage_names":["Open Publishing Association"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Proceedings in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://arxiv.org/pdf/2109.08293","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5113864016","display_name":"Neng\u2010Fa Zhou","orcid":null},"institutions":[{"id":"https://openalex.org/I121847817","display_name":"The Graduate Center, CUNY","ror":"https://ror.org/00awd9g61","country_code":"US","type":"education","lineage":["https://openalex.org/I121847817"]},{"id":"https://openalex.org/I83041322","display_name":"Brooklyn College","ror":"https://ror.org/019k4jq75","country_code":"US","type":"education","lineage":["https://openalex.org/I83041322"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Neng-Fa Zhou","raw_affiliation_strings":["CUNY Brooklyn College & Graduate Center"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CUNY Brooklyn College & Graduate Center","institution_ids":["https://openalex.org/I83041322","https://openalex.org/I121847817"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5113864016"],"corresponding_institution_ids":["https://openalex.org/I121847817","https://openalex.org/I83041322"],"apc_list":null,"apc_paid":null,"fwci":0.3038,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.59797378,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"345","issue":null,"first_page":"165","last_page":"178"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9987999796867371,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9987999796867371,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9987000226974487,"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/T10142","display_name":"Formal Methods in Verification","score":0.9932000041007996,"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/reachability","display_name":"Reachability","score":0.9380406141281128},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.6893946528434753},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.626312792301178},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.6043660640716553},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.5467329621315002},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5335303544998169},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4709162414073944},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46400561928749084},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.460918664932251},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.45680755376815796},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.4218788146972656},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.31772536039352417},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25336962938308716},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13524243235588074}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9380406141281128},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.6893946528434753},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.626312792301178},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.6043660640716553},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.5467329621315002},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5335303544998169},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4709162414073944},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46400561928749084},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.460918664932251},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.45680755376815796},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.4218788146972656},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.31772536039352417},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25336962938308716},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13524243235588074},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"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":2,"locations":[{"id":"doi:10.4204/eptcs.345.30","is_oa":true,"landing_page_url":"https://doi.org/10.4204/eptcs.345.30","pdf_url":"https://arxiv.org/pdf/2109.08293","source":{"id":"https://openalex.org/S4210216316","display_name":"Electronic Proceedings in Theoretical Computer Science","issn_l":"2075-2180","issn":["2075-2180"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310318029","host_organization_name":"Open Publishing Association","host_organization_lineage":["https://openalex.org/P4310318029"],"host_organization_lineage_names":["Open Publishing Association"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Proceedings in Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2109.08293","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2109.08293","pdf_url":"https://arxiv.org/pdf/2109.08293","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"}],"best_oa_location":{"id":"doi:10.4204/eptcs.345.30","is_oa":true,"landing_page_url":"https://doi.org/10.4204/eptcs.345.30","pdf_url":"https://arxiv.org/pdf/2109.08293","source":{"id":"https://openalex.org/S4210216316","display_name":"Electronic Proceedings in Theoretical Computer Science","issn_l":"2075-2180","issn":["2075-2180"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310318029","host_organization_name":"Open Publishing Association","host_organization_lineage":["https://openalex.org/P4310318029"],"host_organization_lineage_names":["Open Publishing Association"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Proceedings in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.4399999976158142}],"awards":[{"id":"https://openalex.org/G3663904791","display_name":null,"funder_award_id":"CCF1618046","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":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3199888975.pdf","grobid_xml":"https://content.openalex.org/works/W3199888975.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W65937437","https://openalex.org/W1570066695","https://openalex.org/W1583450023","https://openalex.org/W1590910789","https://openalex.org/W1963756896","https://openalex.org/W1999396796","https://openalex.org/W2012978749","https://openalex.org/W2013473339","https://openalex.org/W2089155985","https://openalex.org/W2091138122","https://openalex.org/W2118406528","https://openalex.org/W2134275387","https://openalex.org/W2158651374","https://openalex.org/W2159875930","https://openalex.org/W2166791089","https://openalex.org/W2400555644","https://openalex.org/W2482661504","https://openalex.org/W2555981498","https://openalex.org/W2562193053","https://openalex.org/W2605289564","https://openalex.org/W2750143525","https://openalex.org/W2950058198","https://openalex.org/W3083663179","https://openalex.org/W3105634068","https://openalex.org/W3186789547","https://openalex.org/W6602722155","https://openalex.org/W6609993202"],"related_works":["https://openalex.org/W2091348864","https://openalex.org/W2569549435","https://openalex.org/W2784687883","https://openalex.org/W2354343466","https://openalex.org/W2097415053","https://openalex.org/W3014398131","https://openalex.org/W3122634451","https://openalex.org/W2997121997","https://openalex.org/W1486916474","https://openalex.org/W2495408185"],"abstract_inverted_index":{"Many":[0],"constraint":[1],"satisfaction":[2],"problems":[3,20],"involve":[4],"synthesizing":[5],"subgraphs":[6],"that":[7],"satisfy":[8],"certain":[9],"reachability":[10],"constraints.":[11],"This":[12],"paper":[13],"presents":[14],"programs":[15,29],"in":[16],"Picat":[17,36],"for":[18],"four":[19],"selected":[21],"from":[22],"the":[23,31,35,39,43],"recent":[24],"LP/CP":[25],"programming":[26],"competitions.":[27],"The":[28],"demonstrate":[30],"modeling":[32],"capabilities":[33],"of":[34,42],"language":[37],"and":[38],"solving":[40],"efficiency":[41],"cutting-edge":[44],"SAT":[45],"solvers":[46],"empowered":[47],"with":[48],"effective":[49],"encodings.":[50]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}