Encoding lparse.tight

Name	lparse.tight
Class Tree	[Root] Unclassified (114) BoundedSpanningTree (7)
Submitter	Martin Gebser
Author
Description	This is a bounded minimum spanning tree encoding Author: Gayathri Namasivayam, Miroslaw Truszczynski, University of Kentucky
Created	2009-03-30 13:03
Modified	2008-11-29 00:10
Languages	lparse
Language Features
Compatible Instance Classes
Input Predicates
Output Predicates
Encoding Parameter
Standalone	No
Tags
Attributes
Content	%This is a bounded minimum spanning tree encoding % Author: Gayathri Namasivayam, Miroslaw Truszczynski, University of Kentucky % associate every node in the tree with an vtx 1{ stvtx(I,X) :vtx(X) }1 :- vtx(I). 1{ stvtx(I,X) :vtx(I) }1 :- vtx(X). % the top most node in the tree has no incoming edges :- stvtx(1,Y) , bstedge(X,Y), edge(X,Y), vtx(X;Y). % every node other than the top most has exactly one incoming edge 1 { bstedge(X,Y) :vtx(X) :edge(X,Y) } 1 :- stvtx(I,Y), I > 1, vtx(I;Y). % every incoming edge to a node must be from a node with a lower vtx value :- stvtx(I,Y), stvtx(J,X), bstedge(X,Y), edge(X,Y), I <= J, vtx(I;J;X;Y). % each node can have atmost d outgoing edges { bstedge(X,Y) :vtx(Y) :edge(X,Y) } D :- vtx(X), bound(D).

Actions