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

Joohyung Lee; Yunsong Meng

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

Joohyung Lee, Yunsong Meng

Computing and Augmented Intelligence, School of (IAFSE-SCAI)

Research output: Contribution to conference › Paper › peer-review

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 language	English (US)
Pages	131-144
Number of pages	14
State	Published - 2012
Event	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 Duration: Sep 4 2012 → …

Conference

Conference	5th Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2012, co-located with the 28th International Conference on Logic Programming, ICLP 2012
Country/Territory	Hungary
City	Budapest
Period	9/4/12 → …

ASJC Scopus subject areas

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

Cite this

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 conference › Paper › peer-review

@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",

note = "Funding Information: We are grateful to Vladimir Lifschitz for useful discussions related to this paper. We are also grateful to Joseph Babb and the anonymous referees for their useful comments. This work was partially supported by the National Science Foundation under Grant IIS-0916116 and by the South Korea IT R&D program MKE/KIAT 2010-TD-300404-001. Publisher Copyright: {\textcopyright} 2012 arXiv.org. All rights reserved.; 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",

year = "2012",

language = "English (US)",

pages = "131--144",

}

TY - CONF

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

AU - Lee, Joohyung

AU - Meng, Yunsong

N1 - Funding Information: We are grateful to Vladimir Lifschitz for useful discussions related to this paper. We are also grateful to Joseph Babb and the anonymous referees for their useful comments. This work was partially supported by the National Science Foundation under Grant IIS-0916116 and by the South Korea IT R&D program MKE/KIAT 2010-TD-300404-001. Publisher Copyright: © 2012 arXiv.org. All rights reserved.

PY - 2012

Y1 - 2012

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

AN - SCOPUS:84962084739

SP - 131

EP - 144

T2 - 5th Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2012, co-located with the 28th International Conference on Logic Programming, ICLP 2012

Y2 - 4 September 2012

ER -

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

Abstract

Conference

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this