Recent Publications
Most of my papers can be found on the Computer Science Bibliography (dblp)
web site http://www.informatik.uni-trier.de/~ley/pers/hd/l/Lin:Fangzhen
- Fangzhen Lin, Ziyi Shou, Chengcai Chen:
Using Language Models For Knowledge Acquisition in Natural Language Reasoning Problems. CoRR abs/2304.01771 (2023)
- Ning Ding, Fangzhen Lin: On Computing Optimal Strategies in Open List Proportional Representation: The Two Parties Case. AAAI 2014: 1419-1425.
- Fangzhen Lin. From Satisfiability to Linear Algebra Technical Report, 2013.
- Fangzhen Lin. A First-Order Semantics for Golog and ConGolog under a Second-Order
Induction Axiom for Situations KR-2014.
- Fangzhen Lin. A Formalization of Programs in First-Order Logic with a Discrete Linear Order Artificial Intelligence 2016
- Fangzhen Lin and Bo Yang. Reasoning about Mutable Data Structures in First-Order Logic with Arithmetic: Lists and Binary Trees Technical Report, 2015.
-
Xiaoping Chen, Jianmin Ji, Fangzhen Lin:
Computing Loops with at Most One External Support Rule. ACM Trans. Comput. Log. 14(1): 3 (2013)
-
Jianmin Ji, Fangzhen Lin, Jia-Huai You:
Computing Loops with at Most One External Support Rule for Basic Logic Programs with Arbitrary Constraint Atoms. TPLP 13(4-5-Online-Supplement) (2013)
- Ning Ding, Fangzhen Lin: Voting with partial information: what questions to ask? AAMAS 2013: 1237-1238
-
Jianmin Ji, Fangzhen Lin: Turner's Logic of Universal Causation, Propositional Logic, and Logic Programming. LPNMR 2013: 401-413
-
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
- Fangzhen Lin and Yi Zhou. From answer set logic programming to circumscription via logic of GK
Artificial Intelligence 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 and Fangzhen Lin.
Discovering Theorems in Game Theory: Two-Person Games with Unique Pure
Nash Equilibrium Payoffs
In Proc. IJCAI-2009.
-
Pingzhong Tang and Fangzhen Lin.
Computer-aided proofs of Arrow's and other impossibility theorems.
Artif. Intell. 173(11): 1041-1053 (2009)
-
Xiaoping Chen, Jianmin Ji and Fangzhen Lin.
Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs. ICLP 2009: 130-144
-
Pingzhong Tang, Yoav Shoham and Fangzhen Lin.
Team competition. AAMAS (1) 2009: 241-248
- Fangzhen Lin.
Proving Goal Achievability
In Proc. KR-2008.
- Xiaoping Chen and Jianmin Ji and Fangzhen Lin.
Computing Loops With at Most One External Support Rule
In Proc. KR-2008.
- Fangzhen Lin and Yisong Wang.
Answer Set Programming with Functions
In Proc. KR-2008.
- Fangzhen Lin and Pingzhong Tang.
Computer-Aided Proofs of Arrow's and Other Impossibility Theorems
In Proc. AAAI-2008.
- Fangzhen Lin and Jia-Huai You.
Abductive Logic Programming by Nonground Rewrite Systems
In Proc. AAAI-2008.
- Fangzhen Lin.
Finitely-Verifiable Classese of Sentences
A revised version of the paper in the working note of
Commonsense'07.
- Fangzhen Lin and Yi Zhou.
From answer set logic programming to circumscription via logic of GK
In Proc. IJCAI-2007.
- Yin Chen, Fangzhen Lin, Yisong Wang and Mingyi Zhang.
First-Order Loop Formulas for Normal Logic Programs
In Proc. KR-06.
- Fangzhen Lin and Yin Chen.
Discovering classes of strongly equivalent logic programs
In Proc. IJCAI-05.
-
Joohyung Lee and Fangzhen Lin.
Loop formulas for circumscription
In Proc. AAAI-04. pp. 281-286 (Outstanding Paper Honorable Mention.)
- Fangzhen Lin and Xishun Zhao.
On odd and even cycles in normal logic programs
In Proc. AAAI-04. pp. 80-85
- Fangzhen Lin.
Discovering state invariants
In Proc. KR-04. pp. 536-544.
- Fangzhen Lin and Jicheng Zhao.
On Tight Logic Programs and Yet Another Translation from Normal Logic
Programs to Propositional Logic
In Proc. IJCAI-03. pp. 853-858.
- Fangzhen Lin and Jia-Huai You.
Recycling Computed Answers in Rewrite Systems for Abduction
In Proc. IJCAI-03. pp. 879-884.
- Jerome Lang, Fangzhen Lin, and Pierre Marquis.
Causal Theories of Action: A Computational Core
In Proc. IJCAI-03. pp. 1073-1078.
- Fangzhen Lin.
Compiling causal theories to successor state axioms and STRIPS-like
systems Journal of Artificial Intelligence
Research 19 (2003) 279-314. This is
the web page about the system described in the paper. This system is
distributed freely without warranty. Try it at your own risk.
- Fangzhen Lin and Yuting Zhao.
ASSAT: Computing answer sets of a logic program by SAT solvers
This is a revised version of the paper that appeared in
Artificial Intelligence 157(1-2): 115-137 (2004). Essentially,
the revised version includes the
erratum that corrects an error in the definition of loops in the AIJ paper. Here is
the home page for ASSAT system:
http://assat.cs.ust.hk/
.
- Fangzhen Lin
Reducing Strong Equivalence of Logic Programs to Entailment in Classical
Propositional Logic
In Proc. KR-02.
-
Fangzhen Lin and Jia-Huai You.
Abduction in logic programming: A new definition and an abductive procedure
based on rewriting
In Proc. IJCAI-01.
Here
is the version in Artificial Intelligence 140(1/2): 175-205 (2002)
-
System R, a planner that competed in the AIPS-2000 Planning Competition
in both the automatic and hand-tailored tracks. It was selected as one of
the Distinguished Planners.
- A planner
called R
This is an informal description of System R for AI Magazine.
-
Version 1.1 of the planner
Distributed for free and without warranty. Try it at your own risks
-
Fangzhen Lin.
From causal theories to successor state axioms and STRIPS-like systems
In Proc. AAAI-2000
-
Fangzhen Lin.
On the strongest necessary and weakest sufficient conditions
Artificial Intelligence 128 (2001) 143-159. An earlier
version
of this paper appear in Proc. the Seventh International Conference
on Principles of Knowledge Representation and Reasoning (KR2000) and was
the co-winner of the Best Paper Award.
- 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.
- Fangzhen Lin and Kewen Wang.
From causal theories to logic programs (sometimes)
In Proc. of 5th International Conference on Logic Programming and Nonmonotonic
Reasoning}, El Paso, Texas, Dec 1999.
- Fangzhen Lin and Hector Levesque.
What robots can do: Robot programs and effective achievability
. Artificial Intelligence.
- Fangzhen Lin.
On measuring plan quality (a preliminary report)
This is a slight modification of a paper with the same title that appeared
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.
On the relationships between static and dynamic causal rules in the situation
calculus
. Working paper presented at the AAAI'98 Spring Symposium on Prospects
for a Commonsense Theory of Causation Stanford University, CA, March 1998.
-
F. Lin. Applications of the Situation Calculus To Formalizing Control and
Strategic Information: The Prolog Cut Operator. IJCAI'97 Distinguished Paper
Award.
IJCAI'97 version:
PS file for a4 paper
, PS file for
letter size paper
, DVI file
.
Full version:
PS file
in Artificial Intelligence Best of IJCAI'97 Special Issue- F.
Lin An Ordering on Subgoals for Planning . Annals of Mathematics and Artificial
Intelligence Special Issue in Honor of Professor Michael Gelfond. 21(1997)
321-342.
PS file
for a4 paper
, PS file
for letter size paper
, DVI file
, - F. Lin and R. Reiter.
How to progress a database.
Artificial Intelligence. 92(1-2), pp.131-167, 1997.
- F. Lin. Embracing
causality in specifying the indeterminate effects of actions.
Proc. of AAAI'96.
- H.J. Levesque, R. Reiter, Y. Lespérance, F. Lin and R. Scherl.
GOLOG:
A Logic Programming Language for Dynamic Domains.
Journal of Logic Programming Special Issue on Reasoning about Action
and Change. 31(1-3), pp.59-84, 1997.
- F. Lin and R. Reiter.
Rules as actions: A situation calculus semantics for logic programs.
Journal of Logic Programming Special Issue on Reasoning about Action
and Change. 31(1-3), pp.299-330, 1997.
- F. Lin
Abstract operators, indeterminate actions, and the magic predicate
. Presented at the 3rd Symposium on Logical Formalizations of Commonsense
Reasoning, Jan. 1996, Stanford, CA.
- F. Lin.
Embracing causality in specifying the indirect effects of actions
. In Proc. IJCAI'95, pp. 1985-1993, 1995.
- F. Lin and R. Reiter.
How to progress a database II: The STRIPS connection
. In Proc. IJCAI'95, pp. 2001-2007, 1995.
- F. Lin and R. Reiter.
How to progress a database (and why) I: Formal foundations
. In Proc. Fourth Int. Conf. on Principles of Knowledge Representation
and Reasoning, pp. 425-436, 1994.
- F. Lin and Y. Shoham.
Provably correct theories of action
. Journal of ACM 42(2):293-320, 1995.
- F. Lin and Y. Shoham.
On non-forgetting and minimal learning
. in Proc. of the 1993 Int. Coll. on Cognitive Science, N. Asher,
K. Korta, and J. Ezquerro, editors, Kluwer Academic Publishers.
- F. Lin and R. Reiter.
Forget It!
Presented at the AAAI Fall Symposium on Relevance, New Orleans, Nov.
1994
- F. Lin and R. Reiter.
State Constraints Revisited
. Journal of Logic and Computation, 4(5):655-678, Special Issue on
Action and Processes, 1994.
- Y. Lespérance, H. Levesque, F. Lin, D. Marcu, R. Reiter, and
R. Scherl. Foundations
of a Logical Approach to Agent Programming
. In Working Notes of the IJCAI-95 Workshop on Agent Theories, Architectures,
and Languages, Montréal, August, 1995.
- Y. Lespérance, H. Levesque, F. Lin, D. Marcu, R. Reiter, and
R. Scherl.
Fondements d'une Approche Logique à la Programmation d'Agents
. Actes des Troisièmes Journées Francophones sur l'Intelligence
Artificielle Distribuée et les Systèmes Multi-Agents, pp.
3-14, Chambéry-St-Badolph, France, March, 1995.
- Y. Lespérance, H. Levesque, F. Lin, and R. Scherl.
Ability and Knowing How in the Situation Calculus
. Unpublished manuscript.
- Y. Lespérance, H. Levesque, F. Lin, D. Marcu, R. Reiter, and
R. 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, pages 79-85, New
Orleans, LA, November, 1994.
- D. Marcu, Y. Lespérance, H. Levesque, F. Lin, R. Reiter, and
R. Scherl.
Distributed Software Agents and Communication in the Situation Calculus
. In Proc. Intelligent Computer Communication (ICC'95) Conference
, Cluj-Napoca, Romania, June, 1995.
Created by Fangzhen Lin on 02-23-2002
Number of hits since 02-23-2002