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

Joohyung Lee, Yunsong Meng

Research output: Contribution to conferencePaper

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 → …

Fingerprint

Generalized Quantifiers
Stable Models
Logic Programs
Semantics
Operator
Reduct
Syntactics
First-order
Alternatives

ASJC Scopus subject areas

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

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.

Two new definitions of stable models of logic programs with generalized quantifiers. / Lee, Joohyung; Meng, Yunsong.

2012. 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.

Research output: Contribution to conferencePaper

Lee, J & Meng, Y 2012, 'Two new definitions of stable models of logic programs with generalized quantifiers' 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, 9/4/12, pp. 131-144.
Lee J, Meng Y. Two new definitions of stable models of logic programs with generalized quantifiers. 2012. 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.
Lee, Joohyung ; Meng, Yunsong. / Two new definitions of stable models of logic programs with generalized quantifiers. 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.14 p.
@conference{f489f293d01d4f5eae1616ec27431f29,
title = "Two new definitions of stable models of logic programs with generalized quantifiers",
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.",
author = "Joohyung Lee and Yunsong Meng",
year = "2012",
month = "1",
day = "1",
language = "English (US)",
pages = "131--144",
note = "5th Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2012, co-located with the 28th International Conference on Logic Programming, ICLP 2012 ; Conference date: 04-09-2012",

}

TY - CONF

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

AU - Lee, Joohyung

AU - Meng, Yunsong

PY - 2012/1/1

Y1 - 2012/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84962084739&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84962084739&partnerID=8YFLogxK

M3 - Paper

SP - 131

EP - 144

ER -