 | 2009 |
|---|
| 67 |       | Esra Erdem,
Fangzhen Lin,
Torsten Schaub:
Logic Programming and Nonmonotonic Reasoning, 10th International Conference, LPNMR 2009, Potsdam, Germany, September 14-18, 2009. Proceedings
Springer 2009 |
| 66 | | Pingzhong Tang,
Yoav Shoham,
Fangzhen Lin:
Team competition.
AAMAS (1) 2009: 241-248 |
| 65 | | Xiaoping Chen,
Jianmin Ji,
Fangzhen Lin:
Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs.
ICLP 2009: 130-144 |
| 64 | | Pingzhong Tang,
Fangzhen Lin:
Discovering Theorems in Game Theory: Two-Person Games with Unique Pure Nash Equilibrium Payoffs.
IJCAI 2009: 312-317 |
| 63 | | Pingzhong Tang,
Fangzhen Lin:
Computer-aided proofs of Arrow's and other impossibility theorems.
Artif. Intell. 173(11): 1041-1053 (2009) |
| 2008 |
|---|
| 62 |  | Fangzhen Lin,
Pingzhong Tang:
Computer-Aided Proofs of Arrow's and Other Impossibility Theorems.
AAAI 2008: 114-119 |
| 61 | | Fangzhen Lin,
Jia-Huai You:
Abductive Logic Programming by Nonground Rewrite Systems.
AAAI 2008: 480-485 |
| 60 | | Xiaoping Chen,
Jianmin Ji,
Fangzhen Lin:
Computing Loops with at Most One External Support Rule.
KR 2008: 401-410 |
| 59 | | Fangzhen Lin,
Yisong Wang:
Answer Set Programming with Functions.
KR 2008: 454-465 |
| 58 | | Fangzhen Lin:
Proving Goal Achievability.
KR 2008: 621-628 |
| 2007 |
|---|
| 57 | | Abhaya C. Nayak,
Yin Chen,
Fangzhen Lin:
Forgetting and Update -- an exploration.
Formal Models of Belief Change in Rational Agents 2007 |
| 56 | | Fangzhen Lin,
Yi Zhou:
From Answer Set Logic Programming to Circumscription via Logic of GK.
IJCAI 2007: 441-446 |
| 55 | | Yi Zhou,
Fangzhen Lin,
Yan Zhang:
General Default Logic.
LPNMR 2007: 241-253 |
| 54 | | Fangzhen Lin,
Jia-Huai You:
Recycling computed answers in rewrite systems for abduction.
ACM Trans. Comput. Log. 8(2): (2007) |
| 53 | | Fangzhen Lin,
Yin Chen:
Discovering Classes of Strongly Equivalent Logic Programs.
J. Artif. Intell. Res. (JAIR) 28: 431-451 (2007) |
| 2006 |
|---|
| 52 | | Jérôme Lang,
Fangzhen Lin,
Ju Wang:
Knowledge Science, Engineering and Management, First International Conference, KSEM 2006, Guilin, China, August 5-8, 2006, Proceedings
Springer 2006 |
| 51 | | Abhaya C. Nayak,
Yin Chen,
Fangzhen Lin:
Forgetting and Knowledge Update.
Australian Conference on Artificial Intelligence 2006: 131-140 |
| 50 | | Yin Chen,
Fangzhen Lin,
Yisong Wang,
Mingyi Zhang:
First-Order Loop Formulas for Normal Logic Programs.
KR 2006: 298-307 |
| 49 | | Joohyung Lee,
Fangzhen Lin:
Loop formulas for circumscription.
Artif. Intell. 170(2): 160-185 (2006) |
| 2005 |
|---|
| 48 | | Yin Chen,
Fangzhen Lin,
Lei Li:
SELP - A System for Studying Strong Equivalence between Logic Programs.
Answer Set Programming 2005 |
| 47 | | Fangzhen Lin,
Yin Chen:
Discovering Classes of Strongly Equivalent Logic Programs.
IJCAI 2005: 516-521 |
| 46 | | Yin Chen,
Fangzhen Lin,
Lei Li:
SELP - A System for Studying Strong Equivalence Between Logic Programs.
LPNMR 2005: 442-446 |
| 2004 |
|---|
| 45 | | Joohyung Lee,
Fangzhen Lin:
Loop Formulas for Circumscription.
AAAI 2004: 281-286 |
| 44 | | Fangzhen Lin,
Xishun Zhao:
On Odd and Even Cycles in Normal Logic Programs.
AAAI 2004: 80-85 |
| 43 | | Fangzhen Lin:
Discovering State Invariants.
KR 2004: 536-544 |
| 42 | | Fangzhen Lin,
Yuting Zhao:
ASSAT: computing answer sets of a logic program by SAT solvers.
Artif. Intell. 157(1-2): 115-137 (2004) |
| 41 | | Fangzhen Lin,
Jia-Huai You:
Recycling Computed Answers in Rewrite Systems for Abduction
CoRR cs.AI/0402033: (2004) |
| 2003 |
|---|
| 40 | | Yuting Zhao,
Fangzhen Lin:
Answer Set Programming Phase Transition: A Study on Randomly Generated Programs.
ICLP 2003: 239-253 |
| 39 | | Jérôme Lang,
Fangzhen Lin,
Pierre Marquis:
Causal Theories of Action: A Computational Core.
IJCAI 2003: 1073-1078 |
| 38 | | Fangzhen Lin,
Jicheng Zhao:
On Tight Logic Programs and Yet Another Translation from Normal Logic Programs to Propositional Logic.
IJCAI 2003: 853-858 |
| 37 | | Fangzhen Lin,
Jia-Huai You:
Recycling Computed Answers in Rewrite Systems for Abduction.
IJCAI 2003: 879-886 |
| 36 | | Fangzhen Lin:
Compiling Causal Theories to Successor State Axioms and STRIPS-Like Systems.
J. Artif. Intell. Res. (JAIR) 19: 279-314 (2003) |
| 2002 |
|---|
| 35 | | Fangzhen Lin,
Yuting Zhao:
ASSAT: Computing Answer Sets of a Logic Program by SAT Solvers.
AAAI/IAAI 2002: 112- |
| 34 | | Fangzhen Lin:
Reducing Strong Equivalence of Logic Programs to Entailment in Classical Propositional Logic.
KR 2002: 170-176 |
| 33 | | 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) |
| 2001 |
|---|
| 32 | | Fangzhen Lin,
Jia-Huai You:
Abduction in Logic Programming: A New Definition and an Abductive Procedure Based on Rewriting.
IJCAI 2001: 655-666 |
| 31 | | Fangzhen Lin:
A Planner Called R.
AI Magazine 22(3): 73-76 (2001) |
| 30 | | Fangzhen Lin:
On strongest necessary and weakest sufficient conditions.
Artif. Intell. 128(1-2): 143-159 (2001) |
| 2000 |
|---|
| 29 | | Fangzhen Lin:
From Causal Theories to Successor State Axioms and STRIPS-Like Systems.
AAAI/IAAI 2000: 786-791 |
| 28 | | Kewen Wang,
Lizhu Zhou,
Fangzhen Lin:
Alternating Fixpoint Theory for Logic Programs with Priority.
Computational Logic 2000: 164-178 |
| 27 | | Fangzhen Lin:
On Strongest Necessary and Weakest Sufficient Conditions.
KR 2000: 167-175 |
| 26 | | 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) |
| 1999 |
|---|
| 25 | | Fangzhen Lin,
Kewen Wang:
From Causal Theories to Logic Programs (Sometimes).
LPNMR 1999: 117-131 |
| 1998 |
|---|
| 24 | | Fangzhen Lin:
On Measuring Plan Quality (A Preliminary Report).
KR 1998: 224-233 |
| 23 | | Fangzhen Lin,
Hector J. Levesque:
What Robots Can Do: Robot Programs and Effective Achievability.
Artif. Intell. 101(1-2): 201-226 (1998) |
| 22 | | 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) |
| 1997 |
|---|
| 21 | | 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 |
| 20 | | Fangzhen Lin:
Applications of the Situation Calculus To Formalizing Control and Strategy Information: The Prolog Cut Operator.
IJCAI 1997: 1412-1419 |
| 19 | | Fangzhen Lin:
An Ordering on Subgoals for Planning.
Ann. Math. Artif. Intell. 21(2-4): 321-342 (1997) |
| 18 | | Fangzhen Lin,
Raymond Reiter:
How to Progress a Database.
Artif. Intell. 92(1-2): 131-167 (1997) |
| 17 | | Fangzhen Lin,
Raymond Reiter:
Rules as Actions: A Situation Calculus Semantics for Logic Programs.
J. Log. Program. 31(1-3): 299-330 (1997) |
| 16 | | 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) |
| 1996 |
|---|
| 15 | | Fangzhen Lin:
Embracing Causality in Specifying the Indeterminate Effects of Actions.
AAAI/IAAI, Vol. 1 1996: 670-676 |
| 1995 |
|---|
| 14 | | 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 |
| 13 | | Fangzhen Lin:
Embracing Causality in Specifying the Indirect Effects of Actions.
IJCAI 1995: 1985-1993 |
| 12 | | Fangzhen Lin,
Raymond Reiter:
How to Progress a Database II: The STRIPS Connection.
IJCAI 1995: 2001-2009 |
| 11 | | Fangzhen Lin,
Yoav Shoham:
Provably Correct Theories of Action.
J. ACM 42(2): 293-320 (1995) |
| 1994 |
|---|
| 10 | | Fangzhen Lin,
Raymond Reiter:
How to Progress a Database (and Why) I. Logical Foundations.
KR 1994: 425-436 |
| 9 | | Fangzhen Lin,
Raymond Reiter:
State Constraints Revisited.
J. Log. Comput. 4(5): 655-678 (1994) |
| 1993 |
|---|
| 8 | | Fangzhen Lin:
An Argument-Based Approach to Nonmonotonic Reasoning.
Computational Intelligence 9: 254-267 (1993) |
| 1992 |
|---|
| 7 | | Fangzhen Lin,
Yoav Shoham:
Concurrent Actions in the Situation Calculus.
AAAI 1992: 590-595 |
| 6 | | Fangzhen Lin,
Yoav Shoham:
A Logic of Knowledge and Justified Assumptions.
Artif. Intell. 57(2-3): 271-289 (1992) |
| 1991 |
|---|
| 5 | | Fangzhen Lin,
Yoav Shoham:
Provably Correct Theories of Action (Preliminary Report).
AAAI 1991: 349-354 |
| 1990 |
|---|
| 4 | | Fangzhen Lin,
Yoav Shoham:
Epistemic Semantics for Fixed-Points Non-Monotonic Logics.
TARK 1990: 111-120 |
| 1989 |
|---|
| 3 | | Fangzhen Lin,
Yoav Shoham:
Argument Systems: A Uniform Basis for Nonmonotonic Reasoning.
KR 1989: 245-255 |
| 1988 |
|---|
| 2 | | Fangzhen Lin:
Circumscription in a Modal Logic.
TARK 1988: 113-127 |
| 1987 |
|---|
| 1 | | Fangzhen Lin:
Reasoning in the Presence of Inconsistency.
AAAI 1987: 139-143 |
