The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Fangzhen Lin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Yves Lespérance, Hector J. Levesque, Fangzhen Lin, Daniel Marcu, Raymond Reiter, Richard B. Scherl
    Foundations of a Logical Approach to Agent Programming. [Citation Graph (1, 0)][DBLP]
    ATAL, 1995, pp:331-346 [Conf]
  2. Fangzhen Lin, Yoav Shoham
    Argument Systems: A Uniform Basis for Nonmonotonic Reasoning. [Citation Graph (1, 0)][DBLP]
    KR, 1989, pp:245-255 [Conf]
  3. Hector J. Levesque, Raymond Reiter, Yves Lespérance, Fangzhen Lin, Richard B. Scherl
    GOLOG: A Logic Programming Language for Dynamic Domains. [Citation Graph (1, 0)][DBLP]
    J. Log. Program., 1997, v:31, n:1-3, pp:59-83 [Journal]
  4. Fangzhen Lin, Raymond Reiter
    State Constraints Revisited. [Citation Graph (1, 0)][DBLP]
    J. Log. Comput., 1994, v:4, n:5, pp:655-678 [Journal]
  5. Fangzhen Lin
    From Causal Theories to Successor State Axioms and STRIPS-Like Systems. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 2000, pp:786-791 [Conf]
  6. Joohyung Lee, Fangzhen Lin
    Loop Formulas for Circumscription. [Citation Graph (0, 0)][DBLP]
    AAAI, 2004, pp:281-286 [Conf]
  7. Fangzhen Lin
    Reasoning in the Presence of Inconsistency. [Citation Graph (0, 0)][DBLP]
    AAAI, 1987, pp:139-143 [Conf]
  8. Fangzhen Lin
    Embracing Causality in Specifying the Indeterminate Effects of Actions. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, Vol. 1, 1996, pp:670-676 [Conf]
  9. Fangzhen Lin, Yoav Shoham
    Provably Correct Theories of Action (Preliminary Report). [Citation Graph (0, 0)][DBLP]
    AAAI, 1991, pp:349-354 [Conf]
  10. Fangzhen Lin, Yoav Shoham
    Concurrent Actions in the Situation Calculus. [Citation Graph (0, 0)][DBLP]
    AAAI, 1992, pp:590-595 [Conf]
  11. Fangzhen Lin, Yuting Zhao
    ASSAT: Computing Answer Sets of a Logic Program by SAT Solvers. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 2002, pp:112-0 [Conf]
  12. Fangzhen Lin, Xishun Zhao
    On Odd and Even Cycles in Normal Logic Programs. [Citation Graph (0, 0)][DBLP]
    AAAI, 2004, pp:80-85 [Conf]
  13. Yin Chen, Fangzhen Lin, Lei Li
    SELP - A System for Studying Strong Equivalence between Logic Programs. [Citation Graph (0, 0)][DBLP]
    Answer Set Programming, 2005, pp:- [Conf]
  14. Abhaya C. Nayak, Yin Chen, Fangzhen Lin
    Forgetting and Knowledge Update. [Citation Graph (0, 0)][DBLP]
    Australian Conference on Artificial Intelligence, 2006, pp:131-140 [Conf]
  15. 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. [Citation Graph (0, 0)][DBLP]
    Australian Joint Conference on Artificial Intelligence, 1997, pp:1-12 [Conf]
  16. Kewen Wang, Lizhu Zhou, Fangzhen Lin
    Alternating Fixpoint Theory for Logic Programs with Priority. [Citation Graph (0, 0)][DBLP]
    Computational Logic, 2000, pp:164-178 [Conf]
  17. Yuting Zhao, Fangzhen Lin
    Answer Set Programming Phase Transition: A Study on Randomly Generated Programs. [Citation Graph (0, 0)][DBLP]
    ICLP, 2003, pp:239-253 [Conf]
  18. Jérôme Lang, Fangzhen Lin, Pierre Marquis
    Causal Theories of Action: A Computational Core. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2003, pp:1073-1078 [Conf]
  19. Fangzhen Lin
    Embracing Causality in Specifying the Indirect Effects of Actions. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1995, pp:1985-1993 [Conf]
  20. Fangzhen Lin
    Applications of the Situation Calculus To Formalizing Control and Strategy Information: The Prolog Cut Operator. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1997, pp:1412-1419 [Conf]
  21. Fangzhen Lin, Yin Chen
    Discovering Classes of Strongly Equivalent Logic Programs. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2005, pp:516-521 [Conf]
  22. Fangzhen Lin, Raymond Reiter
    How to Progress a Database II: The STRIPS Connection. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1995, pp:2001-2009 [Conf]
  23. Fangzhen Lin, Jia-Huai You
    Abduction in Logic Programming: A New Definition and an Abductive Procedure Based on Rewriting. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2001, pp:655-666 [Conf]
  24. Fangzhen Lin, Jia-Huai You
    Recycling Computed Answers in Rewrite Systems for Abduction. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2003, pp:879-886 [Conf]
  25. Fangzhen Lin, Jicheng Zhao
    On Tight Logic Programs and Yet Another Translation from Normal Logic Programs to Propositional Logic. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2003, pp:853-858 [Conf]
  26. Fangzhen Lin, Yi Zhou
    From Answer Set Logic Programming to Circumscription via Logic of GK. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:441-446 [Conf]
  27. Yin Chen, Fangzhen Lin, Yisong Wang, Mingyi Zhang
    First-Order Loop Formulas for Normal Logic Programs. [Citation Graph (0, 0)][DBLP]
    KR, 2006, pp:298-307 [Conf]
  28. Fangzhen Lin
    Discovering State Invariants. [Citation Graph (0, 0)][DBLP]
    KR, 2004, pp:536-544 [Conf]
  29. Fangzhen Lin
    Reducing Strong Equivalence of Logic Programs to Entailment in Classical Propositional Logic. [Citation Graph (0, 0)][DBLP]
    KR, 2002, pp:170-176 [Conf]
  30. Fangzhen Lin
    On Measuring Plan Quality (A Preliminary Report). [Citation Graph (0, 0)][DBLP]
    KR, 1998, pp:224-233 [Conf]
  31. Fangzhen Lin, Raymond Reiter
    How to Progress a Database (and Why) I. Logical Foundations. [Citation Graph (0, 0)][DBLP]
    KR, 1994, pp:425-436 [Conf]
  32. Fangzhen Lin
    On Strongest Necessary and Weakest Sufficient Conditions. [Citation Graph (0, 0)][DBLP]
    KR, 2000, pp:167-175 [Conf]
  33. Yin Chen, Fangzhen Lin, Lei Li
    SELP - A System for Studying Strong Equivalence Between Logic Programs. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2005, pp:442-446 [Conf]
  34. Fangzhen Lin, Kewen Wang
    From Causal Theories to Logic Programs (Sometimes). [Citation Graph (0, 0)][DBLP]
    LPNMR, 1999, pp:117-131 [Conf]
  35. Yi Zhou, Fangzhen Lin, Yan Zhang
    General Default Logic. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2007, pp:241-253 [Conf]
  36. Fangzhen Lin
    Circumscription in a Modal Logic. [Citation Graph (0, 0)][DBLP]
    TARK, 1988, pp:113-127 [Conf]
  37. Fangzhen Lin, Yoav Shoham
    Epistemic Semantics for Fixed-Points Non-Monotonic Logics. [Citation Graph (0, 0)][DBLP]
    TARK, 1990, pp:111-120 [Conf]
  38. Joohyung Lee, Fangzhen Lin
    Loop formulas for circumscription. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2006, v:170, n:2, pp:160-185 [Journal]
  39. Fangzhen Lin
    On strongest necessary and weakest sufficient conditions. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2001, v:128, n:1-2, pp:143-159 [Journal]
  40. Fangzhen Lin
    Applications of the Situation Calculus to Formalizing Control and Strategic Information: The Prolog Cut Operator. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1998, v:103, n:1-2, pp:273-294 [Journal]
  41. Fangzhen Lin, Hector J. Levesque
    What Robots Can Do: Robot Programs and Effective Achievability. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1998, v:101, n:1-2, pp:201-226 [Journal]
  42. Fangzhen Lin, Raymond Reiter
    How to Progress a Database. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1997, v:92, n:1-2, pp:131-167 [Journal]
  43. Fangzhen Lin, Yoav Shoham
    A Logic of Knowledge and Justified Assumptions. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1992, v:57, n:2-3, pp:271-289 [Journal]
  44. Fangzhen Lin, Jia-Huai You
    Abduction in logic programming: A new definition and an abductive procedure based on rewriting. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2002, v:140, n:1/2, pp:175-205 [Journal]
  45. Fangzhen Lin, Yuting Zhao
    ASSAT: computing answer sets of a logic program by SAT solvers. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2004, v:157, n:1-2, pp:115-137 [Journal]
  46. Fangzhen Lin
    A Planner Called R. [Citation Graph (0, 0)][DBLP]
    AI Magazine, 2001, v:22, n:3, pp:73-76 [Journal]
  47. Fangzhen Lin
    An Ordering on Subgoals for Planning. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1997, v:21, n:2-4, pp:321-342 [Journal]
  48. Fangzhen Lin
    An Argument-Based Approach to Nonmonotonic Reasoning. [Citation Graph (0, 0)][DBLP]
    Computational Intelligence, 1993, v:9, n:, pp:254-267 [Journal]
  49. Fangzhen Lin, Jia-Huai You
    Recycling Computed Answers in Rewrite Systems for Abduction [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  50. Fangzhen Lin, Yoav Shoham
    Provably Correct Theories of Action. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1995, v:42, n:2, pp:293-320 [Journal]
  51. Fangzhen Lin
    Compiling Causal Theories to Successor State Axioms and STRIPS-Like Systems. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 2003, v:19, n:, pp:279-314 [Journal]
  52. Fangzhen Lin, Raymond Reiter
    Rules as Actions: A Situation Calculus Semantics for Logic Programs. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1997, v:31, n:1-3, pp:299-330 [Journal]
  53. Yves Lespérance, Hector J. Levesque, Fangzhen Lin, Richard B. Scherl
    Ability and Knowing How in the Situation Calculus. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 2000, v:66, n:1, pp:165-186 [Journal]
  54. Fangzhen Lin, Yin Chen
    Discovering Classes of Strongly Equivalent Logic Programs. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 2007, v:28, n:, pp:431-451 [Journal]
  55. Fangzhen Lin, Jia-Huai You
    Recycling computed answers in rewrite systems for abduction. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2007, v:8, n:2, pp:- [Journal]

  56. Computer-Aided Proofs of Arrow's and Other Impossibility Theorems. [Citation Graph (, )][DBLP]


  57. Abductive Logic Programming by Nonground Rewrite Systems. [Citation Graph (, )][DBLP]


  58. Ordered Completion for First-Order Logic Programs on Finite Structures. [Citation Graph (, )][DBLP]


  59. Team competition. [Citation Graph (, )][DBLP]


  60. Forgetting and Update -- an exploration. [Citation Graph (, )][DBLP]


  61. Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs. [Citation Graph (, )][DBLP]


  62. Discovering Theorems in Game Theory: Two-Person Games with Unique Pure Nash Equilibrium Payoffs. [Citation Graph (, )][DBLP]


  63. Proving Goal Achievability. [Citation Graph (, )][DBLP]


  64. Answer Set Programming with Functions. [Citation Graph (, )][DBLP]


  65. Computing Loops with at Most One External Support Rule. [Citation Graph (, )][DBLP]


  66. Two Applications of Computer-Aided Theorem Discovery and Verification. [Citation Graph (, )][DBLP]


  67. Computer-aided proofs of Arrow's and other impossibility theorems. [Citation Graph (, )][DBLP]


  68. Designing competitions between teams of individuals. [Citation Graph (, )][DBLP]


  69. General default logic. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002