This paper examines the implementation of a constraint language for Topic Maps. Topic Maps are a way of structuring data or information that allow representations of relationships between subjects and attachment of additional information about these subjects. To ensure the rigidity of a topic map, the constraint language is used to specify the rules. The automated constraint validator required a common form of topic map representation. This paper proposes an abstract representation for topic map and its constraints. A translation rule from the abstract representation to Prolog facts and queries is defined. The Prolog engine is used as the automated constraint validator. This paper concentrates on AsTMa* language family, which is being developed at Bond University. A parser for AsTMa= and AsTMa! has been developed to allow topic map validation against its constraints.