Stable Models of Formulas with Intensional Functions
暂无分享,去创建一个
[1] Yi Zhou,et al. From Answer Set Logic Programming to Circumscription via Logic of GK , 2007, IJCAI.
[2] Marcello Balduccini,et al. Representing Constraint Satisfaction Problems in Answer Set Programming , 2022 .
[3] Enrico Giunchiglia,et al. Nonmonotonic causal theories , 2004, Artif. Intell..
[4] Vladimir Lifschitz,et al. On the Logic of Causal Explanation (Research Note) , 1997, Artif. Intell..
[5] Joohyung Lee,et al. Stable models and circumscription , 2011, Artif. Intell..
[6] Joohyung Lee,et al. Circumscriptive Event Calculus as Answer Set Programming , 2009, IJCAI.
[8] Joohyung Lee,et al. Symmetric Splitting in the General Theory of Stable Models , 2009, IJCAI.
[9] Joohyung Lee,et al. A Reductive Semantics for Counting and Choice in Answer Set Programming , 2008, AAAI.
[10] Vladimir Lifschitz,et al. Logic Programs with Intensional Functions , 2012, KR.
[11] Joohyung Lee,et al. A Decidable Class of Groundable Formulas in the General Theory of Stable Models , 2010, KR.
[12] Yuliya Lierler,et al. Representing Synonymity in Causal Logic and in Logic Programming , 2010 .
[13] Fangzhen Lin,et al. Answer Set Programming with Functions , 2008, KR.
[14] Vladimir Lifschitz. Logic Programs with Intensional Functions ( Preliminary Report ) , 2011 .
[15] Pedro Cabalar. Functional answer set programming , 2011, Theory Pract. Log. Program..
[16] Joohyung Lee,et al. A New Perspective on Stable Models , 2007, IJCAI.
[17] David Pearce,et al. Strongly equivalent logic programs , 2001, ACM Trans. Comput. Log..
[18] Paolo Ferraris,et al. Answer Sets for Propositional Theories , 2005, LPNMR.