A decidable class of groundable formulas in the general theory of stable models

Michael Bartholomew, Joohyung Lee

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

5 Scopus citations

Abstract

We present a decidable class of first-order formulas in the general theory of stable models that can be instantiated even in the presence of function constants. The notion of an argument-restricted formula presented here is a natural generalization of both the notion of an argument-restricted program and the notion of a semi-safe sentence that have been studied in different contexts. Based on this new notion, we extend the notion of safety defined by Cabalar, Pearce and Valverde to arbitrary formulas that allow function constants, and apply the result to RASPL-1 programs and programs with arbitrary aggregates, ensuring finite groundability of those programs in the presence of function constants. We also show that under a certain syntactic condition, argument-restricted formulas can be turned into argument-restricted programs.

Original languageEnglish (US)
Title of host publicationPrinciples of Knowledge Representation and Reasoning
Subtitle of host publicationProceedings of the 12th International Conference, KR 2010
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages477-485
Number of pages9
ISBN (Print)9781577354512
StatePublished - Jan 1 2010
Event12th International Conference on Principles of Knowledge Representation and Reasoning, KR 2010 - Toronto, ON, Canada
Duration: May 9 2010May 13 2010

Publication series

NameProceedings of the International Workshop on Temporal Representation and Reasoning

Other

Other12th International Conference on Principles of Knowledge Representation and Reasoning, KR 2010
CountryCanada
CityToronto, ON
Period5/9/105/13/10

ASJC Scopus subject areas

  • Logic

Fingerprint Dive into the research topics of 'A decidable class of groundable formulas in the general theory of stable models'. Together they form a unique fingerprint.

  • Cite this

    Bartholomew, M., & Lee, J. (2010). A decidable class of groundable formulas in the general theory of stable models. In Principles of Knowledge Representation and Reasoning: Proceedings of the 12th International Conference, KR 2010 (pp. 477-485). (Proceedings of the International Workshop on Temporal Representation and Reasoning). Institute of Electrical and Electronics Engineers Inc..