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...

Full description

Saved in:

Bibliographic Details
Published in:	Procedia computer science Vol. 270; pp. 2318 - 2325
Main Authors:	Strąk, Łukasz, Wieczorek, Wojciech, Nowakowski, Arkadiusz
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 2025
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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