System f2lp - computing answer sets of first-order formulas

Joohyung Lee, Ravi Palla

Research output: Chapter in Book/Report/Conference proceedingConference contribution

29 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationLogic Programming and Nonmonotonic Reasoning - 10th International Conference, LPNMR 2009, Proceedings
Pages515-521
Number of pages7
DOIs
StatePublished - 2009
Event10th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2009 - Potsdam, Germany
Duration: Sep 14 2009Sep 18 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5753 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other10th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2009
Country/TerritoryGermany
CityPotsdam
Period9/14/099/18/09

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'System f2lp - computing answer sets of first-order formulas'. Together they form a unique fingerprint.

Cite this