论文信息 - Logic Programs with Intensional Functions ( Preliminary Report )

Logic Programs with Intensional Functions ( Preliminary Report )

The stable model semantics treats a logic program as a mechanism for specifying its intensional predicates. In this note we discuss a modification of that semantics in which functions, rather than predicates, are intensional. The idea of the new definition comes from nonmonotonic causal logic.

Vladimir Lifschitz

[1] David Pearce,et al. Strongly equivalent logic programs , 2001, ACM Trans. Comput. Log..

[2] Joohyung Lee,et al. Stable models and circumscription , 2011, Artif. Intell..

[3] David Pearce,et al. A Characterization of Strong Equivalence for Logic Programs with Variables , 2007, LPNMR.

[4] Vladimir Lifschitz,et al. Answer set programming and plan generation , 2002, Artif. Intell..

[5] V. Lifschitz,et al. Eliminating Function Symbols from a Nonmonotonic Causal Theory , 2011 .

[6] Hudson Turner,et al. Causal Theories of Action and Change , 1997, AAAI/IAAI.

[7] Vladimir Lifschitz,et al. Datalog Programs and Their Stable Models , 2010, Datalog.

[8] David Pearce,et al. A New Logical Characterisation of Stable Models and Answer Sets , 1996, NMELP.

[9] Murray Shanahan. Solving the frame problem - a mathematical investigation of the common sense law of inertia , 1997 .

[10] Giovambattista Ianni,et al. Computable Functions in ASP: Theory and Implementation , 2008, ICLP.

[11] Pedro Cabalar. Functional answer set programming , 2011, Theory Pract. Log. Program..

[12] Li-Yan Yuan,et al. Weight Constraint Programs with Functions , 2009, LPNMR.

[13] Vladimir Lifschitz,et al. On the Logic of Causal Explanation (Research Note) , 1997, Artif. Intell..

[14] Fangzhen Lin,et al. Answer Set Programming with Functions , 2008, KR.