f2lp swMATH ID: 9898 Software Authors: Lee, J., Palla, R. Description: System f2lp – computing answer sets of first-order formulas. 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. Homepage: http://link.springer.com/chapter/10.1007%2F978-3-642-04238-6_51 Related Software: CCalc; Cplus2ASP; Coala; WASP; PRISM; PrASP; ProbLog; ASPMT2SMT; z3; oClingo Cited in: 9 Publications all top 5 Cited by 13 Authors 5 Lee, Joohyung 1 Alviano, Mario 1 Babb, Joseph 1 Bartholomew, Michael 1 Cabalar, Pedro 1 Casolary, Michael 1 Ferraris, Paolo 1 Leone, Nicola 1 Lierler, Yuliya 1 Lifschitz, Vladimir 1 Nickles, Matthias 1 Santos, Paulo Eduardo 1 Yang, Fangkai Cited in 3 Serials 2 Theory and Practice of Logic Programming 1 Artificial Intelligence 1 Journal of Computer and System Sciences Cited in 2 Fields 9 Computer science (68-XX) 3 Mathematical logic and foundations (03-XX) Citations by Year