Department of Computer Science
The Hong Kong University of Science and Technology
Clear Water Bay, Kowloon, Hong Kong
WWW home page: http://www.cs.ust.hk/~flin
Education
PhD in computer science, September 1991, Stanford University, California, USA.
MSc in computer science, July 1986, Beijing University, Beijing, China.
BSc in computer science, July 1983, Fuzhou University, Fuzhou, China.
Experience
July 2007 -- present, Professor, Department of Computer Science,
Hong Kong University of Science and Technology, Hong Kong.
July 2001 -- June 2007, Associate Professor, Department of Computer Science,
Hong Kong University of Science and Technology, Hong Kong.
August 1996 -- June 2001, Assistant Professor, Department of Computer Science,
Hong Kong University of Science and Technology, Hong Kong.
April 1992 -- July 1996, Researcher, Department of Computer Science,
University of Toronto.
October 1991 -- March 1992, Research Scientist, Department of
Computer Science, Stanford University.
Awards
2006-2007 Croucher Foundation Senior Research Fellowship
KR-2006 Ray Reiter Best Paper Prize: Yin Chen, Fangzhen Lin, Yisong Wang, and Mingyi Zhang. First-Order Loop Formulas for Normal Logic Programs.
AAAI-2004 Outstanding Paper Honorable Mention Award:
Joohyung Lee and Fangzhen Lin. Loop formulas for circumscription.
A Celcorp Prize for Performance for System R in the
Artificial Intelligence Planning
and Scheduling Systems (AIPS) Planning Competition for Honorable Mention,
April 2000, Breckenridge, CO, USA.
KR-2000 Best Paper Award: Fangzhen Lin. On the strongest necessary and weakest sufficient
conditions. Co-winner of the Best Paper Award at
the Seventh International Conference on Principles of Knowledge
Representation and Reasoning (KR2000), April 2000, Breckenridge, CO, USA.
IJCAI-1997 Distinguished Paper Award: Fangzhen Lin. Applications of the
Situation Calculus to Formalizing Control and Strategic Information:
the PROLOG Cut Operator.
A Distinguished Paper Award
at the Fifteenth International Joint Conference on Artificial
Intelligence (IJCAI'97), August 1997, Nagoya, Japan.
Implemented Systems
Planning system R.
A program for computing abduction in logic programming.
universal plans.
A program that compiles a causal theory to STRIPS-like
systems.
A program that computes the strongest necessary and weakest sufficient
conditions of a proposition.
A program for answering queries in Reiter's default logic.
Refereed journal articles
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: Compiling Causal Theories to Successor State Axioms and STRIPS-Like Systems. J. Artif. Intell. Res. (JAIR) 19: 279-314 (2003)
Fangzhen Lin and Jia-Huai You. Abduction in Logic Programming: A New
Definition and an Abductive Procedure Based on Rewriting.
Artificial Intelligence 140(1/2): 175-205 (2002)
Fangzhen Lin.
On strongest necessary and weakest sufficient conditions.
Artificial Intelligence 128(1-2): 143-159 (2001).
Fangzhen Lin. Applications of the
situation calculus to formalizing control and strategic information:
the Prolog cut operator.
Artificial Intelligence 103 (1998) 273-294.
Fangzhen Lin and Hector Levesque. What robots can do:
Robot programs and effective achievability. Artificial Intelligence
101 (1998) 201-226.
Fangzhen Lin and Raymond Reiter. How to progress a database,
Artificial Intelligence (92)1-2, 1997, pp.131-167.
Fangzhen Lin. An ordering on goals for planning. Annals of Mathematics and
Artificial Intelligence 21 (1997) 321-342.
Special issue in honor of Professor Michael Gelfond.
Fangzhen Lin and Raymond Reiter. Rules as Actions - a situation calculus semantics
for logic programs. J. of Logic Programming 31:299-330, 1997.
Hector Levesque, Raymond Reiter, Yves Lesperance, Fangzhen Lin, and
Richard Scherl. GOLOG: A logic programming language for dynamic domains.
J. of Logic Programming 31:59-84, 1997.
Fangzhen Lin and Yoav Shoham. Provably correct theories of action.
J. of ACM 42(2):293-320, 1995.
Fangzhen Lin and Raymond Reiter. State Constraints Revisited.
Journal of Logic and Computation, 4(5):655-678,
Special Issue on Action and Processes, 1994.
Fangzhen Lin. An argument-based approach to nonmonotonic reasoning.
Computational Intelligence 9 (1993) 224--267.
Fangzhen Lin and Yoav Shoham. A logic of knowledge and justified assumptions.
Artificial Intelligence 57 (1992) pp. 271--289.
Fangzhen Lin, Xishun Zhao: On Odd and Even Cycles in Normal Logic Programs. AAAI 2004: 80-85
Fangzhen Lin: Discovering State Invariants. KR 2004: 536-544
Yuting Zhao, Fangzhen Lin: Answer Set Programming Phase Transition: A Study on Randomly Generated Programs. ICLP 2003: 239-253
Jérôme Lang, Fangzhen Lin, Pierre Marquis: Causal Theories of Action: A Computational Core. IJCAI 2003: 1073-1078
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
Fangzhen Lin, Yuting Zhao: ASSAT: Computing Answer Sets of a Logic Program by SAT Solvers. AAAI/IAAI 2002: 112-118.
Fangzhen Lin. Reducing the strong equivalence of logic programs
to entailment in classical propositional logic. In Proceedings of
KR'2002. pp. 170-176.
Fangzhen Lin and Jia-Huai You. Abduction in Logic Programming: A New
Definition and an Abductive Procedure Based on Rewriting. In {\em
Proceedings of IJCAI'2001, pp. 655-666.
Fangzhen Lin.
From causal theories to successor state axioms: bridging the
gap between nonmonotonic action theories and STRIPS-like formalisms,
In Proceedings of AAAI'2000, pp. 786-791, Austin, TX, 2000.
Kewen Wang, Lizhu Zhou, Fangzhen Lin. Alternating fixpoint theory for
logic programs with
priority. In Proceedings of the First International Conference on
Computational Logic
(LNCS 1861), pp. 164-178, London, 2000.
Fangzhen Lin. On strongest necessary and weakest sufficient conditions.
In Proceedings of
Seventh International Conference on Principles of Knowledge
Representation and Reasoning (KR2000), pp. 167-165,
Breckenridge, CO, April 2000.
Fangzhen Lin and Kewen Wang. From causal theories to logic programs
(sometimes). In {\em
Proceedings of 5th International Conference on Logic Programming and
Nonmonotonic Reasoning (LNCS 1730), pp. 117-131, El Paso, Texas, Dec 1999.
Fangzhen Lin. On measuring plan quality (a preliminary report).
In Proc. of the Sixth Int. Conf. on Principles of Knowledge
Representation and Reasoning (KR'98), pp. 224-233, Trento, Italy, June 1998.
Fangzhen Lin. Applications of the situation calculus to
formalizing control and strategic information: the Prolog cut operator.
in Proc. of IJCAI'97, pp.1412-1418, Nagoya, Japan.
Fangzhen Lin. Embracing causality in specifying the effects of
indeterminate actions. In proceedings of AAAI'96, pp. 670-676.
Yves Lesperance, Hector Levesque, Fangzhen Lin, Daniel Marcu, Raymond Reiter, and Richard Scherl.
Foundations of a Logical Approach to Agent Programming.
In Intelligent Agents II. Eds by Michael Wooldridge, Joerg P. Mueller,
and
Milind Tambe. pp. 331-346. Springer-Verlag, 1996.
Fangzhen Lin. Embracing causality in specifying the indirect effects
of actions.
in Proc. of the Fourteenth
Int. Joint Conf. on AI (IJCAI'95),
pp. 1985--1993, 1995.
Fangzhen Lin and Raymond Reiter. How to progress a database II: The STRIPS connection.
in Proc. of the Fourteenth Int. Joint Conf. on AI (IJCAI'95),
pp 2001--2007, 1995.
Daniel Marcu, Yves Lesperance, Hector Levesque, Fangzhen Lin, Raymond Reiter, and Richard Scherl.
Distributed Software Agents and Communication in the Situation
Calculus.
In Proc. of Intelligent Computer Communication Conf., Cluj-Napoca,
Romania, June 1995.
Fangzhen Lin and Raymond Reiter. How to progress a database (and why) I: Formal
foundations.
In Proc. of the Fourth Int. Conf. on Principles of Knowledge
Representation and Reasoning (KR'94), pp. 425-436, Bonn, Germany, 1994.
Fangzhen Lin and Yoav Shoham. On non-forgetting and minimal learning.
Proc. of the 1993 Int. Coll. on Cognitive Science,
N. Asher, K. Korta, and J. Ezquerro, editors,
Kluwer Academic Publishers.
Fangzhen Lin and Yoav Shoham. Concurrent actions in the situation calculus.
In Proc. of
the Tenth National Conf. on AI (AAAI'92), pp. 590--595, 1992.
Fangzhen Lin. Default reasoning as negation-as-failure.
In Proc.
of the 2nd Pacific Rim Int. Conf. on AI, pp. 728--731, September 1992.
Fangzhen Lin and Yoav Shoham. Provably correct theories of action.
In Proc. of
the Ninth National Conf. on AI (AAAI'91),
pp. 349--354, 1991.
Fangzhen Lin and Yoav Shoham. Epistemic semantics for fixed-point
nonmonotonic logics.
In Proc. of the Third Conf. on
Theoretical Aspects of Reasoning about Knowledge, pp. 111--120,
Asilomar, CA, March 1990.
Fangzhen Lin and Yoav Shoham. Argument systems: a uniform basis for
nonmonotonic reasoning.
In Proc. of the First Int. Conf.
on Knowledge Representation and Reasoning, pp. 245--255, 1989.
Fangzhen Lin. Circumscription in a modal logic.
In Proc. of the Second
Conf. on Theoretical Aspects of Reasoning about Knowledge, pp. 113--128,
Asilomar, CA, March 1988.
Fangzhen Lin. Reasoning in the presence of inconsistency.
In Proc. of the Sixth National Conf. on AI (AAAI'87), pp. 139--143,
Seattle, WA, 1987.
Invited contributions
Fangzhen Lin. A planner called R. AI Magazine Fall 2001
pp. 73-76.
Fangzhen Lin and Raymond Reiter. A new semantics for logic programs.
In John-Jules Ch. Meyer and Jan Treur, editors,
Handbook of Defeasible Reasoning and Uncertainty Management Systems
Volume 6: Dynamics and Management of Reasoning Processes, pp. 217-248. 2001.
Fangzhen Lin. Search algorithms in the situation calculus. In
H.J. Levesque and F. Pirri, editors, Logical
Foundations for Cognitive Agents: Contributions in Honor of Ray Reiter,
pp. 213-233, Springer, Berlin, 1999.
Refereed workshop articles
Kewen Wang and Fangzhen Lin. Closed world reasoning and query
evaluation in disjunctive deductive databases. In
Proceedings of Seventh International
Workshop on Deductive Databases and Logic Programming DDLP'99,
Tokyo, Japan, Sept 99.
Fangzhen Lin. On the relationships between static and dynamic causal
rules in the situation calculus. In Working Notes of AAAI'98 Spring
Symposium on Prospects for a Commonsense Theory of Causation, pp. 38-43,
Stanford University, CA, March 1998.
Fangzhen Lin. Abstract operators, indeterminate actions, and the magic
predicate. in Working Notes of 3rd Symposium on Logical Formalizations
of Commonsense Reasoning, Jan. 1996, Stanford, CA.
Yves Lesperance, Hector Levesque, Fangzhen Lin, Daniel Marcu, Raymond Reiter, and Richard Scherl.
Foundations of a Logical Approach to Agent Programming.
In Proc. of IJCAI'95 Workshop on Agent Theories, Architectures, and
Languages, Montreal, 1995.
Yves Lesperance, Hector Levesque, Fangzhen Lin, Daniel Marcu, Raymond Reiter, and Richard Scherl.
A Logical Approach to High-Level Robot Programming -- A Progress Report.
In Benjamin Kuipers, editor,
Control of the Physical World by Intelligent
Systems, Papers from the 1994 AAAI Fall Symposium, pp. 79-85,
New Orleans, LA, November, 1994.
Fangzhen Lin and Raymond Reiter. Forget It!
In Proc. of the AAAI Fall Symposium on Relevance, pp. 154-160,
New Orlean, 1994.
Fangzhen Lin. Formalizing various intuition about inheritance in logic
programs.
In Proc. of the Third Int. Workshop on Nonmonotonic
Reasoning, South Lake Tahoe, CA, May 1990.
Professional Service (Last Five Years)
Associate Editor, Journal of Artificial Intelligence Research
(JAIR), 2005 - present.
Member, Steering Committee, PRICAI (Pacific Rim International Conference on
Artificial Intelligence).
Member, Steering Committee, International Workshop on Nonmonotonic Reasoning.
Member, Editorial Board, Journal of Artificial Intelligence Research
(JAIR), 2002 - 2005.
Chair, Doctoral Consortium, KR-2006 (10th International Conference on Principles of
Knowledge Representation and Reasoning), Manchester, UK.
Member, Program Committee, KR-2006.
Member, Senior Program Committee, AAAI-2005 (20th National Conference on Artificial
Intelligence, AAAI), Pittsburgh, USA.
Member, Program Committee, IJCAI-2005 (Nineteenth International Joint Conference on Artificial Intelligence), Edinburgh, Scotland.
Member, Program Committee, SAT-2005 (Eighth International Conference on Theory and Applications of Satisfiability Testing), St. Andrews, Scotland.
Member, Program Committee, Commonsense-2005 (7th International Symposium on Logical Formalizations of Commonsense Reasoning), May 22-24, 2005, Corfu, Greece.
Member, Program Committee, LPNMR-2005 (Eighth International Conference on Logic Programming and Nonmonotonic Reasoning).
Member, Program Committee, AAAI-2004, San Jose, CA, USA, July 2004.
Member, Program Committee, ECAI-2004 (European Conference on AI),
Valencia, Spain, August 22-27, 2004.
Member, Program Committee, KR-2004 (International Conference on Principles of
Knowledge Representation and Reasoning), Whistler, BC, Canada,
June 2004.
Member, Program Committee, ICLP-2004 (International Conference on
Logic Programming), Saint-Malo, France, Sept 2004.
Member, Program Committee,
AOIS-2004 (International Bi-Conference Workshop on Agent-Oriented
Information Systems), Riga, Latvia, June 2004 and New York City,
USA, July 2004.
Member, Program Committee, KEST-2004 (International Conference
on Knowledge Economy and Development of Science and Technology),
Beijing, China, Sept 2004.
Member, Program Committee, LPNMR-2003 (International Conference on Logic Programming and Nonmonotonic Reasoning), Jan 2004, Florida, USA
Member, Program Committee, AOIS-2003, Melbourne, Australia, July 2003.
Member, Program Committee, the Sixth Symposium on Logical Foundation of Commonsense Reasoning, March 24-26, Stanford University, CA, USA
Member, Program Committee,
IJCAI-03 Workshop on Nonmonotonic Reasoning, Action, and Change, Acapulco, Mexico, August 2003.
Member, Program Committee, the 2002
European Conference on Logics in Artificial Intelligence
JELIA'02 (Journies Europiennes sur la Logique en Intelligence
Artificielle). University of Calabria (Rende (Cosenza), Italy),
September 18-20, 2002.
Member, Program Committee, the Fourth International Bi-Conference Workshop on
Agent-Oriented Information Systems (AOIS-2002).
May 27-28, 2002, Toronto, Ontario, Canada at CAiSE'02.
Member, Program Committee, the Tenth International Conference on
Artificial Intelligence: Methodology, Systems, Applications (AIMSA'2002).
Varna, Bulgaria, 4-6th September, 2002.
Member, Program Committee, the 8th International Conference on Principles of
Knowledge Representation and Reasoning (KR2002), April 2002,
France.
Member, Program Committee, the Seventh
International Symposium on AI and Mathematics (AI\& MAth'02),
Ft.-Lauderdale, Flordia, January 2nd-4th, 2002.
Member, Program Committee, the International Joint Conference on Artificial
Intelligence, August 2001, Seattle, WA (IJCAI-2001).
Member, Steering Committee, 9th Intl. Workshop on Nonmonotonic Reasoning
(NMR'2002), April 2002.
Member, Program Committee, 6th International Conference on Logic
Programming and Nonmonotonic Reasoning (LPNMR'01).
Member, Program Committee, 17th National Conference on Artificial
Intelligence, July 2000, Austin, TX (AAAI-2000).
Member, Program Committee, 7th International Conference on Principles of
Knowledge Representation and Reasoning (KR2000), April 2000, CO, USA.
Member, Program Committee, International Conference on
Knowledge Systems and Distributed Intelligence,
IFIP2000 16th World Computer Congress, Aug 2000, Beijing, China.
Member, Program Committee, 6th International
Symposium on Artificial Intelligence and Mathematics 2000, Aug 2000, FL, USA.
Member, Program Committee, 8th Intl. Workshop on Nonmonotonic Reasoning
(NMR'2000), April 2000, CO, USA.
Chair, Session on Cognitive Robotics at the special NSF Workshop on
Logic Based AI, Washington, June 1999.
Member, Program Committee, 5th International Conference on Logic
Programming and Nonmonotonic Reasoning (LPNMR'99).