Two new definitions of stable models of logic programs with generalized quantifiers

Joohyung Lee, Yunsong Meng

Research output: Contribution to conferencePaper

2 Scopus citations

Abstract

We present alternative definitions of the first-order stable model semantics and its extension to incorporate generalized quantifiers by referring to the familiar notion of a reduct instead of referring to the SM operator in the original definitions. Also, we extend the FLP stable model semantics to allow generalized quantifiers by referring to an operator that is similar to the SM operator. For a reasonable syntactic class of logic programs, we show that the two stable model semantics of generalized quantifiers are interchangeable.

Original languageEnglish (US)
Pages131-144
Number of pages14
StatePublished - Jan 1 2012
Event5th Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2012, co-located with the 28th International Conference on Logic Programming, ICLP 2012 - Budapest, Hungary
Duration: Sep 4 2012 → …

Conference

Conference5th Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2012, co-located with the 28th International Conference on Logic Programming, ICLP 2012
CountryHungary
CityBudapest
Period9/4/12 → …

ASJC Scopus subject areas

  • Artificial Intelligence
  • Theoretical Computer Science
  • Computational Theory and Mathematics
  • Hardware and Architecture
  • Software

Fingerprint Dive into the research topics of 'Two new definitions of stable models of logic programs with generalized quantifiers'. Together they form a unique fingerprint.

  • Cite this

    Lee, J., & Meng, Y. (2012). Two new definitions of stable models of logic programs with generalized quantifiers. 131-144. Paper presented at 5th Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2012, co-located with the 28th International Conference on Logic Programming, ICLP 2012, Budapest, Hungary.