Synthesis of Abstraction Hierarchies for Constraint Satisfaction by Clustering Approximately Equivalent Objects

@inproceedings{Ellman1993SynthesisOA,
  title={Synthesis of Abstraction Hierarchies for Constraint Satisfaction by Clustering Approximately Equivalent Objects},
  author={Thomas Ellman},
  booktitle={ICML},
  year={1993}
}
ions based on approximate equivalence can be de ned by focusing on function nding problems, i.e., problems whose solution requires nding a function f that maps a given domain D into a given range R. Thus each state s S is a function that accepts some d D and returns a value r R. An abstraction space may constructed by clustering the domain D into a collection D̂ of disjoint sets. Each state a A will be a function  f which accepts a subset d̂ in the collection D̂ and returns a multiset of… CONTINUE READING