18 found
Order:
  1.  2
    How to progress a database.Fangzhen Lin & Ray Reiter - 1997 - Artificial Intelligence 92 (1-2):131-167.
  2.  1
    ASSAT: computing answer sets of a logic program by SAT solvers.Fangzhen Lin & Yuting Zhao - 2004 - Artificial Intelligence 157 (1-2):115-137.
  3.  76
    Ability and knowing how in the situation calculus.Yves Lespérance, Hector J. Levesque, Fangzhen Lin & Richard B. Scherl - 2000 - Studia Logica 66 (1):165-186.
    Most agents can acquire information about their environments as they operate. A good plan for such an agent is one that not only achieves the goal, but is also executable, i.e., ensures that the agent has enough information at every step to know what to do next. In this paper, we present a formal account of what it means for an agent to know how to execute a plan and to be able to achieve a goal. Such a theory is (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  4. A logic of knowledge and justified assumptions.Fangzhen Lin & Yoav Shoham - 1992 - Artificial Intelligence 57 (2-3):271-289.
  5. On strongest necessary and weakest sufficient conditions☆☆An earlier version of this paper was the co-winner of the Best Paper Award at KR2000.Fangzhen Lin - 2001 - Artificial Intelligence 128 (1-2):143-159.
  6. From answer set logic programming to circumscription via logic of GK.Fangzhen Lin & Yi Zhou - 2011 - Artificial Intelligence 175 (1):264-277.
  7. What robots can do: robot programs and effective achievability.Fangzhen Lin & Hector J. Levesque - 1998 - Artificial Intelligence 101 (1-2):201-226.
  8.  1
    Computer-aided proofs of Arrow's and other impossibility theorems.Pingzhong Tang & Fangzhen Lin - 2009 - Artificial Intelligence 173 (11):1041-1053.
  9.  3
    Ordered completion for first-order logic programs on finite structures.Vernon Asuncion, Fangzhen Lin, Yan Zhang & Yi Zhou - 2012 - Artificial Intelligence 177-179 (C):1-24.
  10.  2
    Loop-separable programs and their first-order definability.Yin Chen, Fangzhen Lin, Yan Zhang & Yi Zhou - 2011 - Artificial Intelligence 175 (3-4):890-913.
  11. Applications of the situation calculus to formalizing control and strategic information: the Prolog cut operator.Fangzhen Lin - 1998 - Artificial Intelligence 103 (1-2):273-294.
  12. Discovering theorems in game theory: Two-person games with unique pure Nash equilibrium payoffs.Pingzhong Tang & Fangzhen Lin - 2011 - Artificial Intelligence 175 (14-15):2010-2020.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  13.  1
    Abduction in logic programming: A new definition and an abductive procedure based on rewriting.Fangzhen Lin & Jia-Huai You - 2002 - Artificial Intelligence 140 (1-2):175-205.
  14. Designing competitions between teams of individuals.Pingzhong Tang, Yoav Shoham & Fangzhen Lin - 2010 - Artificial Intelligence 174 (11):749-766.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  15. Characterizing causal action theories and their implementations in answer set programming.Haodi Zhang & Fangzhen Lin - 2017 - Artificial Intelligence 248 (C):1-8.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  16.  1
    Loop formulas for circumscription.Joohyung Lee & Fangzhen Lin - 2006 - Artificial Intelligence 170 (2):160-185.
  17.  13
    Position Systems in Dynamic Domains.Jianmin Ji & Fangzhen Lin - 2015 - Journal of Philosophical Logic 44 (2):147-161.
    A dynamic domain consists of a set of legal states and a transition function that maps states to states. AI formalisms for specifying dynamic domains have so far focused on describing the effects of actions, that is, the transition functions. In this paper we propose a notion of characteristic set of position systems for the purpose of describing legal states. A position system for a type of objects is a set of properties that are mutually exclusive, and that in each (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  18.  1
    A formalization of programs in first-order logic with a discrete linear order.Fangzhen Lin - 2016 - Artificial Intelligence 235 (C):1-25.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark