System f2lp - computing answer sets of first-order formulas

Abstract

We present an implementation of the general language of stable models proposed by Ferraris, Lee and Lifschitz. Under certain conditions, system F2lp turns a first-order theory under the stable model semantics into an answer set program, so that existing answer set solvers can be used for computing the general language. Quantifiers are first eliminated and then the resulting quantifier-free formulas are turned into rules. Based on the relationship between stable models and circumscription, F2lp can also serve as a reasoning engine for general circumscriptive theories. We illustrate how to use F2lp to compute the circumscriptive event calculus. © 2009 Springer Berlin Heidelberg.