{"id":"https://openalex.org/W4415974343","doi":"https://doi.org/10.1016/j.procs.2025.09.353","title":"Logic Programming for Orthogonal Graph Drawing on Restricted Grids","display_name":"Logic Programming for Orthogonal Graph Drawing on Restricted Grids","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4415974343","doi":"https://doi.org/10.1016/j.procs.2025.09.353"},"language":"en","primary_location":{"id":"doi:10.1016/j.procs.2025.09.353","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2025.09.353","pdf_url":null,"source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/j.procs.2025.09.353","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082516283","display_name":"\u0141ukasz Str\u0105k","orcid":"https://orcid.org/0000-0002-1074-2847"},"institutions":[{"id":"https://openalex.org/I864159182","display_name":"University of Silesia in Katowice","ror":"https://ror.org/0104rcc94","country_code":"PL","type":"education","lineage":["https://openalex.org/I864159182"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"\u0141ukasz Str\u0105k","raw_affiliation_strings":["Faculty of Science and Technology, University of Silesia in Katowice, Bankowa 14, 40-007 Katowice, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Science and Technology, University of Silesia in Katowice, Bankowa 14, 40-007 Katowice, Poland","institution_ids":["https://openalex.org/I864159182"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021657351","display_name":"Wojciech Wieczorek","orcid":"https://orcid.org/0000-0003-3191-9151"},"institutions":[{"id":"https://openalex.org/I62088572","display_name":"University of Bielsko-Bia\u0142a","ror":"https://ror.org/01ew38b77","country_code":"PL","type":"education","lineage":["https://openalex.org/I62088572"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Wojciech Wieczorek","raw_affiliation_strings":["Department of Computer Science and Automatics, University of Bielsko-Biala, Willowa 2, 43-309 Bielsko-Bia\u0142a, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Automatics, University of Bielsko-Biala, Willowa 2, 43-309 Bielsko-Bia\u0142a, Poland","institution_ids":["https://openalex.org/I62088572"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030111607","display_name":"Arkadiusz Nowakowski","orcid":"https://orcid.org/0000-0001-8304-5746"},"institutions":[{"id":"https://openalex.org/I864159182","display_name":"University of Silesia in Katowice","ror":"https://ror.org/0104rcc94","country_code":"PL","type":"education","lineage":["https://openalex.org/I864159182"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Arkadiusz Nowakowski","raw_affiliation_strings":["Faculty of Science and Technology, University of Silesia in Katowice, Bankowa 14, 40-007 Katowice, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Science and Technology, University of Silesia in Katowice, Bankowa 14, 40-007 Katowice, Poland","institution_ids":["https://openalex.org/I864159182"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5082516283"],"corresponding_institution_ids":["https://openalex.org/I864159182"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.29039936,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"270","issue":null,"first_page":"2318","last_page":"2325"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.6032000184059143,"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.6032000184059143,"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.16529999673366547,"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/T10215","display_name":"Semantic Web and Ontologies","score":0.062300000339746475,"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/constraint-programming","display_name":"Constraint programming","score":0.6093999743461609},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.5794000029563904},{"id":"https://openalex.org/keywords/answer-set-programming","display_name":"Answer set programming","score":0.5687000155448914},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.527899980545044},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.517300009727478},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4869000017642975},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.45579999685287476},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4456999897956848},{"id":"https://openalex.org/keywords/graph-drawing","display_name":"Graph drawing","score":0.42590001225471497}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8083999752998352},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.6093999743461609},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.5794000029563904},{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.5687000155448914},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.527899980545044},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5202999711036682},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.517300009727478},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4869000017642975},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.45579999685287476},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4456999897956848},{"id":"https://openalex.org/C112953755","wikidata":"https://www.wikidata.org/wiki/Q739462","display_name":"Graph drawing","level":3,"score":0.42590001225471497},{"id":"https://openalex.org/C145580432","wikidata":"https://www.wikidata.org/wiki/Q6497118","display_name":"Lattice graph","level":5,"score":0.41920000314712524},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.4156999886035919},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3950999975204468},{"id":"https://openalex.org/C178481205","wikidata":"https://www.wikidata.org/wiki/Q5164372","display_name":"Constraint graph","level":5,"score":0.3716999888420105},{"id":"https://openalex.org/C146206909","wikidata":"https://www.wikidata.org/wiki/Q531152","display_name":"Declarative programming","level":4,"score":0.3700999915599823},{"id":"https://openalex.org/C204306468","wikidata":"https://www.wikidata.org/wiki/Q5159106","display_name":"Concurrent constraint logic programming","level":5,"score":0.3463999927043915},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.34540000557899475},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3255999982357025},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.3237999975681305},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3018999993801117},{"id":"https://openalex.org/C50033165","wikidata":"https://www.wikidata.org/wiki/Q15712089","display_name":"Inductive programming","level":3,"score":0.29840001463890076},{"id":"https://openalex.org/C2987117450","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic program","level":3,"score":0.29649999737739563},{"id":"https://openalex.org/C195818886","wikidata":"https://www.wikidata.org/wiki/Q5421724","display_name":"Expressive power","level":2,"score":0.2922999858856201},{"id":"https://openalex.org/C96315309","wikidata":"https://www.wikidata.org/wiki/Q5508829","display_name":"Functional logic programming","level":4,"score":0.25999999046325684}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.procs.2025.09.353","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2025.09.353","pdf_url":null,"source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/j.procs.2025.09.353","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2025.09.353","pdf_url":null,"source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W45568410","https://openalex.org/W634834491","https://openalex.org/W1549747920","https://openalex.org/W1562629407","https://openalex.org/W1606891084","https://openalex.org/W2037121654","https://openalex.org/W2071784417","https://openalex.org/W2082102943","https://openalex.org/W2084784960","https://openalex.org/W2810621424","https://openalex.org/W4254790956"],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"investigates":[2],"the":[3,50,67],"use":[4],"of":[5,69],"logic":[6],"programming\u2014specifically,":[7],"Answer":[8],"Set":[9],"Programming":[10],"(ASP)\u2014as":[11],"a":[12,28],"declarative":[13,70],"approach":[14,51],"to":[15],"orthogonal":[16],"graph":[17,75],"drawing":[18,23],"on":[19,45],"restricted":[20],"grids.":[21,42],"The":[22],"problem":[24,31],"is":[25],"encoded":[26],"as":[27],"constraint":[29],"satisfaction":[30],"that":[32,49],"enforces":[33],"planarity,":[34],"orthogonality,":[35],"and":[36,54,61],"spatial":[37],"constraints":[38],"within":[39],"bounded":[40],"integer":[41],"Experimental":[43],"results":[44],"benchmark":[46],"graphs":[47],"indicate":[48],"generates":[52],"valid":[53],"aesthetically":[55],"pleasing":[56],"layouts,":[57],"particularly":[58],"for":[59],"small":[60],"medium-sized":[62],"instances.":[63],"These":[64],"findings":[65],"demonstrate":[66],"promise":[68],"programming":[71],"in":[72],"supporting":[73],"constraint-driven":[74],"layout":[76],"methodologies.":[77]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-11-06T00:00:00"}