EZCSP is an inference engine that allows computing extended answer sets of ASP programs, as defined in [bal09a,bal09b]. Intuitively, EZCSP allows a lightweight integration of ASP and constraint programming (CP). An extended answer set of an ASP program P is a pair consisting of an answer set of P, and of a solution to the constraint satisfaction problem (CSP) defined by such answer set of P. The current version of EZCSP uses gringo+clasp by default (lparse+smodels or other solvers can be specified) as ASP solver and BProlog as constraint solver. To specify other solvers, run ”ezcsp -h”.