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

Michael Bartholomew; Joohyung Lee

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

Michael Bartholomew, Joohyung Lee

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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 language	English (US)
Title of host publication	Principles of Knowledge Representation and Reasoning
Subtitle of host publication	Proceedings of the 12th International Conference, KR 2010
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	477-485
Number of pages	9
ISBN (Print)	9781577354512
State	Published - 2010
Event	12th International Conference on Principles of Knowledge Representation and Reasoning, KR 2010 - Toronto, ON, Canada Duration: May 9 2010 → May 13 2010

Publication series

Name	Proceedings of the International Conference on Knowledge Representation and Reasoning
ISSN (Print)	2334-1025
ISSN (Electronic)	2334-1033

Other

Other	12th International Conference on Principles of Knowledge Representation and Reasoning, KR 2010
Country/Territory	Canada
City	Toronto, ON
Period	5/9/10 → 5/13/10

ASJC Scopus subject areas

Logic

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 Conference on Knowledge Representation and Reasoning). Institute of Electrical and Electronics Engineers Inc..

A decidable class of groundable formulas in the general theory of stable models. / Bartholomew, Michael; Lee, Joohyung.
Principles of Knowledge Representation and Reasoning: Proceedings of the 12th International Conference, KR 2010. Institute of Electrical and Electronics Engineers Inc., 2010. p. 477-485 (Proceedings of the International Conference on Knowledge Representation and Reasoning).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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. Proceedings of the International Conference on Knowledge Representation and Reasoning, Institute of Electrical and Electronics Engineers Inc., pp. 477-485, 12th International Conference on Principles of Knowledge Representation and Reasoning, KR 2010, Toronto, ON, Canada, 5/9/10.

Bartholomew M, Lee J. 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. Institute of Electrical and Electronics Engineers Inc. 2010. p. 477-485. (Proceedings of the International Conference on Knowledge Representation and Reasoning).

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

@inproceedings{0ee289681438434f828789db061fb439,

title = "A decidable class of groundable formulas in the general theory of stable models",

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

author = "Michael Bartholomew and Joohyung Lee",

note = "Copyright: Copyright 2021 Elsevier B.V., All rights reserved.; 12th International Conference on Principles of Knowledge Representation and Reasoning, KR 2010 ; Conference date: 09-05-2010 Through 13-05-2010",

year = "2010",

language = "English (US)",

isbn = "9781577354512",

series = "Proceedings of the International Conference on Knowledge Representation and Reasoning",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "477--485",

booktitle = "Principles of Knowledge Representation and Reasoning",

}

TY - GEN

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

AU - Bartholomew, Michael

AU - Lee, Joohyung

PY - 2010

Y1 - 2010

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

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

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

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

M3 - Conference contribution

AN - SCOPUS:79955751900

SN - 9781577354512

T3 - Proceedings of the International Conference on Knowledge Representation and Reasoning

SP - 477

EP - 485

BT - Principles of Knowledge Representation and Reasoning

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 12th International Conference on Principles of Knowledge Representation and Reasoning, KR 2010

Y2 - 9 May 2010 through 13 May 2010

ER -

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

Abstract

Publication series

Other

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this