 First, there are close connections between autoepistemic logic and logic programming. For instance, Gelfond’s and Lifschitz’s stable model semantics for logic programming with  negation as failure  which serves as the foundation for the answer set programming paradigm in computer science has been equivalently expressed by means of autoepistemic logic  (Gelfond and Lifschitz 1988).  The result is achieved by translating clauses in logic programming 