TY - GEN
T1 - Stable models of formulas with intensional functions
AU - Bartholomew, Michael
AU - Lee, Joohyung
N1 - Copyright:
Copyright 2021 Elsevier B.V., All rights reserved.
PY - 2012
Y1 - 2012
N2 - In classical logic, nonBoolean fluents, such as the location of an object and the color of a ball, can be naturally described by functions, but this is not the case with the traditional stable model semantics, where the values of functions are predefined, and nonmonotonicity of the semantics is related to minimizing the extents of predicates but has nothing to do with functions. We extend the first-order stable model semantics by Ferraris, Lee and Lifschitz to allow intensional functions. The new formalism is closely related to multivalued nonmonotonic causal logic, logic programs with in-tensional functions, and other extensions of logic programs with functions, while keeping similar properties as those of the first-order stable model semantics. We show how to eliminate intensional functions in favor of intensional predicates and vice versa, and use these results to encode fragments of the language in the input language of ASP solvers and CSP solvers.
AB - In classical logic, nonBoolean fluents, such as the location of an object and the color of a ball, can be naturally described by functions, but this is not the case with the traditional stable model semantics, where the values of functions are predefined, and nonmonotonicity of the semantics is related to minimizing the extents of predicates but has nothing to do with functions. We extend the first-order stable model semantics by Ferraris, Lee and Lifschitz to allow intensional functions. The new formalism is closely related to multivalued nonmonotonic causal logic, logic programs with in-tensional functions, and other extensions of logic programs with functions, while keeping similar properties as those of the first-order stable model semantics. We show how to eliminate intensional functions in favor of intensional predicates and vice versa, and use these results to encode fragments of the language in the input language of ASP solvers and CSP solvers.
UR - http://www.scopus.com/inward/record.url?scp=84893380275&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84893380275&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84893380275
SN - 9781577355601
T3 - Proceedings of the International Conference on Knowledge Representation and Reasoning
SP - 2
EP - 12
BT - 13th International Conference on the Principles of Knowledge Representation and Reasoning, KR 2012
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 13th International Conference on the Principles of Knowledge Representation and Reasoning, KR 2012
Y2 - 10 June 2012 through 14 June 2012
ER -