Fangzhen Lin

Xiaoping Chen, Jianmin Ji, Fangzhen Lin: Computing Loops with at Most One External Support Rule. ACM Trans. Comput. Log. 14(1): 3 (2013)

Vernon Asuncion, Fangzhen Lin, Yan Zhang, Yi Zhou: Ordered completion for first-order logic programs on finite structures. Artif. Intell. 177-179: 1-24 (2012)

Yisong Wang, Fangzhen Lin, Mingyi Zhang, Jia-Huai You: A Well-Founded Semantics for Basic Logic Programs with Arbitrary Abstract Constraint Atoms. AAAI 2012

Jianmin Ji, Fangzhen Lin: From Turner's Logic of Universal Causation to the Logic of GK. Correct Reasoning 2012: 380-385

Fangzhen Lin, Yi Zhou: From answer set logic programming to circumscription via logic of GK. Artif. Intell. 175(1): 264-277 (2011)

Yin Chen, Fangzhen Lin, Yan Zhang, Yi Zhou: Loop-separable programs and their first-order definability. Artif. Intell. 175(3-4): 890-913 (2011)

Pingzhong Tang, Fangzhen Lin: Discovering theorems in game theory: Two-person games with unique pure Nash equilibrium payoffs. Artif. Intell. 175(14-15): 2010-2020 (2011)

Pingzhong Tang, Fangzhen Lin: Two equivalence results for two-person strict games. Games and Economic Behavior 71(2): 479-486 (2011)

Fangzhen Lin, Mikhail Soutchanski: Causal Theories of Actions Revisited. AAAI 2011

Fangzhen Lin: On Moving Objects in Dynamic Domains. AAAI Spring Symposium: Logical Formalizations of Commonsense Reasoning 2011

Fangzhen Lin, Mikhail Soutchanski: Causal Theories of Actions Revisited. AAAI Spring Symposium: Logical Formalizations of Commonsense Reasoning 2011

Fangzhen Lin: Compiling Causal Theories to Successor State Axioms and STRIPS-Like Systems. CoRR abs/1106.4867 (2011)

Pingzhong Tang, Yoav Shoham, Fangzhen Lin: Designing competitions between teams of individuals. Artif. Intell. 174(11): 749-766 (2010)

Yisong Wang, Jia-Huai You, Fangzhen Lin, Li-Yan Yuan, Mingyi Zhang: Weight constraint programs with evaluable functions. Ann. Math. Artif. Intell. 60(3-4): 341-380 (2010)

Vernon Asuncion, Fangzhen Lin, Yan Zhang, Yi Zhou: Ordered Completion for First-Order Logic Programs on Finite Structures. AAAI 2010

Fangzhen Lin, Ulrike Sattler, Miroslaw Truszczynski (Eds.): Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, KR 2010, Toronto, Ontario, Canada, May 9-13, 2010. AAAI Press 2010

Pingzhong Tang, Fangzhen Lin: Computer-aided proofs of Arrow's and other impossibility theorems. Artif. Intell. 173(11): 1041-1053 (2009)

Yi Zhou, Fangzhen Lin, Yan Zhang: General default logic. Ann. Math. Artif. Intell. 57(2): 125-160 (2009)

Pingzhong Tang, Yoav Shoham, Fangzhen Lin: Team competition. AAMAS (1) 2009: 241-248

Xiaoping Chen, Jianmin Ji, Fangzhen Lin: Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs. ICLP 2009: 130-144

Pingzhong Tang, Fangzhen Lin: Discovering Theorems in Game Theory: Two-Person Games with Unique Pure Nash Equilibrium Payoffs. IJCAI 2009: 312-317

Fangzhen Lin: Two Applications of Computer-Aided Theorem Discovery and Verification. KSEM 2009: 2

Esra Erdem, Fangzhen Lin, Torsten Schaub (Eds.): Logic Programming and Nonmonotonic Reasoning, 10th International Conference, LPNMR 2009, Potsdam, Germany, September 14-18, 2009. Proceedings. Lecture Notes in Computer Science 5753, Springer 2009, isbn 978-3-642-04237-9

Fangzhen Lin, Pingzhong Tang: Computer-Aided Proofs of Arrow's and Other Impossibility Theorems. AAAI 2008: 114-119

Fangzhen Lin, Jia-Huai You: Abductive Logic Programming by Nonground Rewrite Systems. AAAI 2008: 480-485

Xiaoping Chen, Jianmin Ji, Fangzhen Lin: Computing Loops with at Most One External Support Rule. KR 2008: 401-410

Fangzhen Lin, Yisong Wang: Answer Set Programming with Functions. KR 2008: 454-465

Fangzhen Lin: Proving Goal Achievability. KR 2008: 621-628

Mingyi Zhang, Ying Zhang, Fangzhen Lin: A characterization of answer sets for logic programs. Science in China Series F: Information Sciences 50(1): 46-62 (2007)

Fangzhen Lin, Yin Chen: Discovering Classes of Strongly Equivalent Logic Programs. J. Artif. Intell. Res. (JAIR) 28: 431-451 (2007)

Fangzhen Lin, Jia-Huai You: Recycling computed answers in rewrite systems for abduction. ACM Trans. Comput. Log. 8(2) (2007)

Fangzhen Lin: Finitely-Verifiable Classes of Sentences. AAAI Spring Symposium: Logical Formalizations of Commonsense Reasoning 2007: 89-94

Abhaya C. Nayak, Yin Chen, Fangzhen Lin: Forgetting and Update -- an exploration. Formal Models of Belief Change in Rational Agents 2007

Fangzhen Lin, Yi Zhou: From Answer Set Logic Programming to Circumscription via Logic of GK. IJCAI 2007: 441-446

Yi Zhou, Fangzhen Lin, Yan Zhang: General Default Logic. LPNMR 2007: 241-253

Joohyung Lee, Fangzhen Lin: Loop formulas for circumscription. Artif. Intell. 170(2): 160-185 (2006)

Abhaya C. Nayak, Yin Chen, Fangzhen Lin: Forgetting and Knowledge Update. Australian Conference on Artificial Intelligence 2006: 131-140

Yin Chen, Fangzhen Lin, Yisong Wang, Mingyi Zhang: First-Order Loop Formulas for Normal Logic Programs. KR 2006: 298-307

Jérôme Lang, Fangzhen Lin, Ju Wang (Eds.): Knowledge Science, Engineering and Management, First International Conference, KSEM 2006, Guilin, China, August 5-8, 2006, Proceedings. Lecture Notes in Computer Science 4092, Springer 2006, isbn 3-540-37033-1

Yin Chen, Fangzhen Lin, Lei Li: SELP - A System for Studying Strong Equivalence between Logic Programs. Answer Set Programming 2005

Fangzhen Lin, Yin Chen: Discovering Classes of Strongly Equivalent Logic Programs. IJCAI 2005: 516-521

Yin Chen, Fangzhen Lin, Lei Li: SELP - A System for Studying Strong Equivalence Between Logic Programs. LPNMR 2005: 442-446

Fangzhen Lin, Yuting Zhao: ASSAT: computing answer sets of a logic program by SAT solvers. Artif. Intell. 157(1-2): 115-137 (2004)

Fangzhen Lin, Xishun Zhao: On Odd and Even Cycles in Normal Logic Programs. AAAI 2004: 80-85

Joohyung Lee, Fangzhen Lin: Loop Formulas for Circumscription. AAAI 2004: 281-286

Fangzhen Lin: Discovering State Invariants. KR 2004: 536-544

Fangzhen Lin, Jia-Huai You: Recycling Computed Answers in Rewrite Systems for Abduction. CoRR cs.AI/0402033 (2004)

Fangzhen Lin: Compiling Causal Theories to Successor State Axioms and STRIPS-Like Systems. J. Artif. Intell. Res. (JAIR) 19: 279-314 (2003)

Yuting Zhao, Fangzhen Lin: Answer Set Programming Phase Transition: A Study on Randomly Generated Programs. ICLP 2003: 239-253

Fangzhen Lin, Jicheng Zhao: On Tight Logic Programs and Yet Another Translation from Normal Logic Programs to Propositional Logic. IJCAI 2003: 853-858

Fangzhen Lin, Jia-Huai You: Recycling Computed Answers in Rewrite Systems for Abduction. IJCAI 2003: 879-886

Jérôme Lang, Fangzhen Lin, Pierre Marquis: Causal Theories of Action: A Computational Core. IJCAI 2003: 1073-1078

Fangzhen Lin, Jia-Huai You: Abduction in logic programming: A new definition and an abductive procedure based on rewriting. Artif. Intell. 140(1/2): 175-205 (2002)

Fangzhen Lin, Yuting Zhao: ASSAT: Computing Answer Sets of a Logic Program by SAT Solvers. AAAI/IAAI 2002: 112-118

Fangzhen Lin: Reducing Strong Equivalence of Logic Programs to Entailment in Classical Propositional Logic. KR 2002: 170-176

Fangzhen Lin: On strongest necessary and weakest sufficient conditions. Artif. Intell. 128(1-2): 143-159 (2001)

Fangzhen Lin: A Planner Called R. AI Magazine 22(3): 73-76 (2001)

Fangzhen Lin, Jia-Huai You: Abduction in Logic Programming: A New Definition and an Abductive Procedure Based on Rewriting. IJCAI 2001: 655-666

Yves Lespérance, Hector J. Levesque, Fangzhen Lin, Richard B. Scherl: Ability and Knowing How in the Situation Calculus. Studia Logica 66(1): 165-186 (2000)

Fangzhen Lin: From Causal Theories to Successor State Axioms and STRIPS-Like Systems. AAAI/IAAI 2000: 786-791

Kewen Wang, Lizhu Zhou, Fangzhen Lin: Alternating Fixpoint Theory for Logic Programs with Priority. Computational Logic 2000: 164-178

Fangzhen Lin: On Strongest Necessary and Weakest Sufficient Conditions. KR 2000: 167-175

Fangzhen Lin, Kewen Wang: From Causal Theories to Logic Programs (Sometimes). LPNMR 1999: 117-131

Fangzhen Lin, Hector J. Levesque: What Robots Can Do: Robot Programs and Effective Achievability. Artif. Intell. 101(1-2): 201-226 (1998)

Fangzhen Lin: Applications of the Situation Calculus to Formalizing Control and Strategic Information: The Prolog Cut Operator. Artif. Intell. 103(1-2): 273-294 (1998)

Fangzhen Lin: On Measuring Plan Quality (A Preliminary Report). KR 1998: 224-233

Fangzhen Lin, Raymond Reiter: How to Progress a Database. Artif. Intell. 92(1-2): 131-167 (1997)

Fangzhen Lin: An Ordering on Subgoals for Planning. Ann. Math. Artif. Intell. 21(2-4): 321-342 (1997)

Hector J. Levesque, Raymond Reiter, Yves Lespérance, Fangzhen Lin, Richard B. Scherl: GOLOG: A Logic Programming Language for Dynamic Domains. J. Log. Program. 31(1-3): 59-83 (1997)

Fangzhen Lin, Raymond Reiter: Rules as Actions: A Situation Calculus Semantics for Logic Programs. J. Log. Program. 31(1-3): 299-330 (1997)

Kenneth Tam, J. Lloyd, Yves Lespérance, Hector J. Levesque, Fangzhen Lin, Daniel Marcu, Raymond Reiter, Michael R. M. Jenkin: Controlling Autonomous Robots with GOLOG. Australian Joint Conference on Artificial Intelligence 1997: 1-12

Fangzhen Lin: Applications of the Situation Calculus To Formalizing Control and Strategy Information: The Prolog Cut Operator. IJCAI 1997: 1412-1419

Fangzhen Lin: Embracing Causality in Specifying the Indeterminate Effects of Actions. AAAI/IAAI, Vol. 1 1996: 670-676

Fangzhen Lin, Yoav Shoham: Provably Correct Theories of Action. J. ACM 42(2): 293-320 (1995)

Yves Lespérance, Hector J. Levesque, Fangzhen Lin, Daniel Marcu, Raymond Reiter, Richard B. Scherl: Foundations of a Logical Approach to Agent Programming. ATAL 1995: 331-346

Fangzhen Lin: Embracing Causality in Specifying the Indirect Effects of Actions. IJCAI 1995: 1985-1993

Fangzhen Lin, Raymond Reiter: How to Progress a Database II: The STRIPS Connection. IJCAI 1995: 2001-2009

Fangzhen Lin, Raymond Reiter: State Constraints Revisited. J. Log. Comput. 4(5): 655-678 (1994)

Fangzhen Lin, Raymond Reiter: How to Progress a Database (and Why) I. Logical Foundations. KR 1994: 425-436

Fangzhen Lin: An Argument-Based Approach to Nonmonotonic Reasoning. Computational Intelligence 9: 254-267 (1993)

Fangzhen Lin, Yoav Shoham: A Logic of Knowledge and Justified Assumptions. Artif. Intell. 57(2-3): 271-289 (1992)

Fangzhen Lin, Yoav Shoham: Concurrent Actions in the Situation Calculus. AAAI 1992: 590-595

Fangzhen Lin, Yoav Shoham: Provably Correct Theories of Action (Preliminary Report). AAAI 1991: 349-354

Fangzhen Lin, Yoav Shoham: Epistemic Semantics for Fixed-Points Non-Monotonic Logics. TARK 1990: 111-120

Fangzhen Lin, Yoav Shoham: Argument Systems: A Uniform Basis for Nonmonotonic Reasoning. KR 1989: 245-255

Fangzhen Lin: Circumscription in a Modal Logic. TARK 1988: 113-127

Fangzhen Lin: Reasoning in the Presence of Inconsistency. AAAI 1987: 139-143