Logic Programming for Orthogonal Graph Drawing on Restricted Grids

This paper investigates the use of logic programming—specifically, Answer Set Programming (ASP)—as a declarative approach to orthogonal graph drawing on restricted grids. The drawing problem is encoded as a constraint satisfaction problem that enforces planarity, orthogonality, and spatial constrain...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Procedia computer science Ročník 270; s. 2318 - 2325
Hlavní autoři: Strąk, Łukasz, Wieczorek, Wojciech, Nowakowski, Arkadiusz
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 2025
Témata:
answer set programming
graph visualization
logic programming
orthogonal graph drawing
logic programming
orthogonal graph drawing
answer set programming
graph visualization
ISSN:1877-0509, 1877-0509
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper investigates the use of logic programming—specifically, Answer Set Programming (ASP)—as a declarative approach to orthogonal graph drawing on restricted grids. The drawing problem is encoded as a constraint satisfaction problem that enforces planarity, orthogonality, and spatial constraints within bounded integer grids. Experimental results on benchmark graphs indicate that the approach generates valid and aesthetically pleasing layouts, particularly for small and medium-sized instances. These findings demonstrate the promise of declarative programming in supporting constraint-driven graph layout methodologies.
ISSN:1877-0509
1877-0509
DOI:10.1016/j.procs.2025.09.353