Encoding lparse.tight

Name lparse.tight
Class Tree
Submitter Martin Gebser
Description Hamilton cycle problem
The graph is given as facts "vtx(X)." and "edge(X,Y)."
Predicate perm(I,X) defines a permutation of vertices: vertex X
in position I of the permutation. Then we make sure that two
consequtive vertices in the permutation are connected.
Then we build the key predicate "hc". Atom "hc(X,Y)" represents the fact
that edge (X,Y) is in the Hamiltonian cycle to be constructed.
Created 2009-03-30 13:03
Modified 2008-11-29 00:10
Language Features
Compatible Instance Classes
    Input Predicates
      Output Predicates
        Encoding Parameter
          Standalone Help No