On the stable model semantics for intensional functions

Michael Bartholomew, Joohyung Lee

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

Several extensions of the stable model semantics are available to describe 'intensional' functions - functions that can be described in terms of other functions and predicates by logic programs. Such functions are useful for expressing inertia and default behaviors of systems, and can be exploited for alleviating the grounding bottleneck involving functional fluents. However, the extensions were defined in different ways under different intuitions. In this paper we provide several reformulations of the extensions, and note that they are in fact closely related to each other and coincide on large syntactic classes of logic programs.

Original languageEnglish (US)
Pages (from-to)863-876
Number of pages14
JournalTheory and Practice of Logic Programming
Volume13
Issue number4-5
DOIs
StatePublished - Jul 2013

Fingerprint

Stable Models
Semantics
Logic Programs
Electric grounding
Syntactics
Reformulation
Predicate
Inertia

Keywords

  • answer set programming
  • intensional functions
  • stable models

ASJC Scopus subject areas

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

Cite this

On the stable model semantics for intensional functions. / Bartholomew, Michael; Lee, Joohyung.

In: Theory and Practice of Logic Programming, Vol. 13, No. 4-5, 07.2013, p. 863-876.

Research output: Contribution to journalArticle

@article{ee6aa2b5adf546e9a8dbcf492b84003c,
title = "On the stable model semantics for intensional functions",
abstract = "Several extensions of the stable model semantics are available to describe 'intensional' functions - functions that can be described in terms of other functions and predicates by logic programs. Such functions are useful for expressing inertia and default behaviors of systems, and can be exploited for alleviating the grounding bottleneck involving functional fluents. However, the extensions were defined in different ways under different intuitions. In this paper we provide several reformulations of the extensions, and note that they are in fact closely related to each other and coincide on large syntactic classes of logic programs.",
keywords = "answer set programming, intensional functions, stable models",
author = "Michael Bartholomew and Joohyung Lee",
year = "2013",
month = "7",
doi = "10.1017/S1471068413000549",
language = "English (US)",
volume = "13",
pages = "863--876",
journal = "Theory and Practice of Logic Programming",
issn = "1471-0684",
publisher = "Cambridge University Press",
number = "4-5",

}

TY - JOUR

T1 - On the stable model semantics for intensional functions

AU - Bartholomew, Michael

AU - Lee, Joohyung

PY - 2013/7

Y1 - 2013/7

N2 - Several extensions of the stable model semantics are available to describe 'intensional' functions - functions that can be described in terms of other functions and predicates by logic programs. Such functions are useful for expressing inertia and default behaviors of systems, and can be exploited for alleviating the grounding bottleneck involving functional fluents. However, the extensions were defined in different ways under different intuitions. In this paper we provide several reformulations of the extensions, and note that they are in fact closely related to each other and coincide on large syntactic classes of logic programs.

AB - Several extensions of the stable model semantics are available to describe 'intensional' functions - functions that can be described in terms of other functions and predicates by logic programs. Such functions are useful for expressing inertia and default behaviors of systems, and can be exploited for alleviating the grounding bottleneck involving functional fluents. However, the extensions were defined in different ways under different intuitions. In this paper we provide several reformulations of the extensions, and note that they are in fact closely related to each other and coincide on large syntactic classes of logic programs.

KW - answer set programming

KW - intensional functions

KW - stable models

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

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

U2 - 10.1017/S1471068413000549

DO - 10.1017/S1471068413000549

M3 - Article

VL - 13

SP - 863

EP - 876

JO - Theory and Practice of Logic Programming

JF - Theory and Practice of Logic Programming

SN - 1471-0684

IS - 4-5

ER -