Abstract
Problem solving by declarative theory building can be an extremely effective method for porting concepts and knowledge from the problem domain to the solution domain, by allowing the implementation of complete procedural constructs and enabling to produce sound solutions. If conveniently expressed, such a theory may be directly coded into a declarative programming language. If expressed within the paradigm of logic programming, then the theory itself represents the very procedure to obtain its desired solutions. The illustrative case study considered here is the obtention of architectural layouts from an adjacency graph: Given a list of imposed adjacencies among a set of planar rectangular spaces (represented by the graph's nodes), the goal is to generate all permissible layouts schemas on the plane which respect the adjacencies, and to determine the minimal modular dimensions of such a set of spaces. Another aim of this article is also to show the guidelines of an effective translation of the theory constructed to solve the proposed problem in Logic Programming, making use of the combined power of two different semantics and their implementations, namely the Well Founded Semantics and the Stable Models one.

URL:
http://rewerse.net/publications/rewerse-publications.html#REWERSE-RP-2007-068

BibTeX:

@inproceedings{REWERSE-RP-2007-068,
	author = {Luís Moniz Pereira and Ruben Duarte Viegas},
	title = {Architectural Design via Declarative Programming},
	booktitle = {Proceedings of 9th International Conference on Enterprise Information Systems, Funchal, Madeira, Portugal (12th--16th June 2007)},
	year = {2007},
	pages = {363--369},
	url = {http://rewerse.net/publications/rewerse-publications.html#REWERSE-RP-2007-068}
}