Towards Abstraction in ASP with an Application on Reasoning about Agent Policies

Institute of Logic and Computation, TU Wien, Vienna, Austria (email: {zeynep,eiter}@kr.tuwien.ac.at) submitted 1 January 2003; revised 1 January 2003; accepted 1 January 2003 ASP programs are a convenient tool for problem solving, whereas with large problem instances the size of the state space can be prohibitive. We consider abstraction as a means of over-approximation and introduce a method to automatically abstract (possibly non-ground) ASP programs that preserves their structure, while reducing the size of the problem.