From Turner's Logic of Universal Causation to the Logic of GK

Logic of knowledge and justified assumptions, also known as logic of grounded knowledge (GK), was proposed by Lin and Shoham as a general logic for nonmonotonic reasoning. To date, it has been used to embed in it default logic, autoepistemic logic, and general logic programming under stable model semantics. Besides showing the generality of GK as a logic for nonmonotonic reasoning, these embeddings shed light on the relationships among these other logics. Along this line, we show that Turner's logic of universal causation can be naturally embedded into logic of GK as well.

[1]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

[2]  Paolo Ferraris,et al.  Answer Sets for Propositional Theories , 2005, LPNMR.

[3]  Robert C. Moore.  Semantical Considerations on Nonmonotonic Logic , 1985, IJCAI.

[4]  Yi Zhou,et al.  From Answer Set Logic Programming to Circumscription via Logic of GK , 2007, IJCAI.

[5]  Richard Spencer-Smith,et al.  Modal Logic , 2007 .

[6]  Wolfgang Faber,et al.  Logic Programming and Nonmonotonic Reasoning , 2011, Lecture Notes in Computer Science.

[7]  M. de Rijke,et al.  Modal Logic , 2001, Cambridge Tracts in Theoretical Computer Science.

[8]  Joohyung Lee,et al.  A New Perspective on Stable Models , 2007, IJCAI.

[9]  Fangzhen Lin,et al.  Embracing Causality in Specifying the Indirect Effects of Actions , 1995, IJCAI.

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

[11]  Hudson Turner,et al.  A Logic of Universal Causation , 1999, Artif. Intell..

[12]  John McCarthy,et al.  Applications of Circumscription to Formalizing Common Sense Knowledge , 1987, NMR.

[13]  Fangzhen Lin,et al.  A Logic of Knowledge and Justified Assumptions , 1992, Artif. Intell..

[14]  John McCarthy,et al.  Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..

[15]  Fangzhen Lin,et al.  Causal Theories of Actions Revisited , 2011, AAAI.

[16]  Fangzhen Lin.  Reducing Strong Equivalence of Logic Programs to Entailment in Classical Propositional Logic , 2002, KR.