Since its introduction, answer set programming (ASP) has been widely applied to various knowledgeintensive tasks and combinatorial search problems. ASP was found to be closely related to SAT, which has led to new methods of computing answer sets using SAT solvers and techniques adapted from SAT. While this has been the most studied relationship, the relationship of ASP to other computing paradigms, such as constraint satisfaction, quantified boolean formulas (QBF), or first-order logic (FOL) is also the subject of active research. The goal of the annual ASPOCP (acronym for ASP and Other Computing Paradigms) workshop is to facilitate the discussion about crossing the boundaries of current ASP techniques, in combination with or inspired by other computing paradigms. In 2010, the third edition of the ASPOCP workshop (ASPOCP’10) was held in Edinburgh, Scotland, as part of the International Conference on Logic Programming (ICLP) in the frame of the 5th Federated Logic Conference (FLoC). The program included one invited talk by Torsten Schaub and nine regular paper presentations. This special issue of AI Communications contains extended and carefully reviewed versions of select contributions to ASPOCP’10. The articles reflect the range of areas the ASPOCP workshop tries to touch; in particular articles contained in this volume address preferential reasoning, domain-specific heuristics, symmetry breaking, as well as grounding issues. The first article “Potassco: The Potsdam answer set solving collection” [5] is the contribution by our invited speaker and his team. It gives a thorough overview of the suite of ASP tools that are developed at the University of Potsdam. This family of ASP tools