Kein Profilbild | No profile picture | Utilisateur n'as pas d'image
https://philosophie.ch/profil/lin-f

Fangzhen Lin (lin-f)

Contributions à Philosophie.ch

No contributions yet

Bibliography

    Lespérance, Yves, Levesque, Hector J., Lin, Fangzhen, Marcu, Daniel, Reiter, Raymond and Scherl, Richard B. 1994. A Logical Approach to High-Level Robot Programming – A Progress Report.” in AAAI-94. Control of the Physical World by Intelligent Systems, Papers from the 1994 AAAI Fall Symposium, edited by Benjamin J. Kuipers, pp. 79–85. Menlo Park, California: The AAAI Press.
    Lespérance, Yves, Levesque, Hector J., Lin, Fangzhen, Marcu, Daniel, Reiter, Raymond and Scherl, Richard B. 1996. Foundations of a Logical Approach to Agent Programming.” in ATAL-95. Intelligent Agents Volume II – Proceedings of the 1995 Workshop on Agent Theories, Architectures, and Languages, edited by Michael J. Wooldridge, Jörg Paul Müller, and Miland Tambe, pp. 331–346. Lecture Notes in Computer Science. Berlin: Springer.
    Lespérance, Yves, Levesque, Hector J., Lin, Fangzhen and Scherl, Richard B. 2000. Ability and Knowing How in the Situation Calculus.” Studia Logica: An International Journal for Symbolic Logic 66(1): 165–186.
    Lespérance, Yves, Reiter, Raymond, Lin, Fangzhen and Scherl, Richard B. 1997. GOLOG: A Logic Programming Language for Dynamic Domains.” Journal of Logic Programming 31(1–3): 59–84.
    Levesque, Hector J., Reiter, Raymond, Lespérance, Yves, Lin, Fangzhen and Scherl, Richard B. 1997. golog: a Logic Programming Language for Dynamic Domains.” Journal of Logic Programming 31(1–3).
    Lin, Fangzhen. 1988. Circumscription in a Modal Logic.” in TARK 1988. Theoretical Aspects of Reasoning about Knowledge: Proceedings of the Second Conference, edited by Moshe Y. Vardi, pp. 113–127. San Francisco, California: Morgan Kaufmann Publishers.
    Lin, Fangzhen. 1991. A Study in Nonmonotonic Reasoning.” PhD dissertation, Stanford, California: Computer Science Department, Stanford University.
    Lin, Fangzhen. 1995. Embracing Causality in Specifying the Indirect Effects of Actions.” in IJCAI-95. Proceedings of the 14th International Joint Conference on Artificial Intelligence, edited by Christopher S. Mellish and C. Raymond Perrault, pp. 1985–1991. San Francisco, California: Morgan Kaufmann Publishers.
    Lin, Fangzhen. 1996a. Abstract Operators, Indeterminate Effects, and the Magic Predicate.” in, pp. 96–103.
    Lin, Fangzhen. 1996b. Nondeterminism in Causal Theories of Action.” in AAAI-96. Proceedings of the Thirteenth National Conference on Artificial Intelligence and the Ninth Innovative Applications of Artificial Intelligence Conference, edited by William J. Clancey and Daniel S. Weld, pp. 670–676. Menlo Park, California: The AAAI Press.
    Lin, Fangzhen. 1998a. On the Relationships between Static and Dynamic Causal Rules in the Situation Calculus.” in AAAI-98. Working Notes of the AAAI Spring Symposium on Prospects for a Commonsense Theory of Causation, edited by Charles L. Ortiz Jr., pp. 38–43. Menlo Park, California: The AAAI Press.
    Lin, Fangzhen. 1998b. Applications of the Situation Calculus to Formalizing Control and Strategic Information: the Prolog Cut Operator.” Artificial Intelligence 103(1–2): 273–294.
    Lin, Fangzhen. 1998c. On Measuring Plan Quality (A Preliminary Report).” in KR’98: Principles of Knowledge Representation and Reasoning, edited by Anthony G. Cohn, Lenhart K. Schubert, and Stuart C. Shapiro, pp. 224–232. San Francisco, California: Morgan Kaufmann Publishers.
    Lin, Fangzhen. 2000. On Strongest Necessary and Weakest Sufficient Conditions.” Artificial Intelligence 128(1–2): 143–159. Reprinted in Cohn, Giunchiglia and Selman (2000, 167–175).
    Lin, Fangzhen. 2001. A Planner Called R.” The AI Magazine 22(1): 73–76.
    Lin, Fangzhen. 2002. Reducing Strong Equivalence to Entailment in Classical Propositional Logic.” in KR’02: Principles of Knowledge Representation and Reasoning, edited by Dieter Fensel, Fausto Giunchiglia, Deborah L. McGuinness, and Mary-Anne Williams, pp. 170–176. San Francisco, California: Morgan Kaufmann Publishers.
    Lin, Fangzhen and Levesque, Hector J. 1998. What Robots Can Do: Robot Programs and Effective Achievability.” Artificial Intelligence 101(1–2): 201–226.
    Lin, Fangzhen and Reiter, Raymond. 1994a. State Constraints Revisited.” Journal of Logic and Computation 4: 655–678.
    Lin, Fangzhen and Reiter, Raymond. 1994b. Forget It! in AAAI-94. Working Notes, AAAI Fall Symposium on Relevance, edited by Russell Greiner and Devika Subramanian, pp. 154–159. Menlo Park, California: The AAAI Press.
    Lin, Fangzhen and Reiter, Raymond. 1994c. How to Progress a Database (and Why) I: Logical Foundations.” in KR’94: Principles of Knowledge Representation and Reasoning, edited by Jon Doyle, Erik Sandewall, and Pietro Torasso, pp. 425–436. San Francisco, California: Morgan Kaufmann Publishers.
    Lin, Fangzhen and Reiter, Raymond. 1995. How to Progress a Database II: The strips Connection.” in IJCAI-95. Proceedings of the 14th International Joint Conference on Artificial Intelligence, edited by Christopher S. Mellish and C. Raymond Perrault, pp. 2001–2007. San Francisco, California: Morgan Kaufmann Publishers.
    Lin, Fangzhen and Reiter, Raymond. 1997. How to Progress a Database.” Artificial Intelligence 92(1–2): 131–167.
    Lin, Fangzhen and Reiter, Raymond. 2001. A New Semantics for Logic Programs.” in Handbook of Defeasible Reasoning and Uncertainty Management Systems VI: Dynamics and Management of Reasoning Processes, edited by John-Jules Ch. Meyer and Jan Treur, pp. 217–248. Dordrecht: Kluwer Academic Publishers.
    Lin, Fangzhen and Shoham, Yoav. 1989. Argument Systems: A Uniform Basis for Non-Monotonic Reasoning.” in KR’89: Principles of Knowledge Representation and Reasoning, edited by Ronald J. Brachman, Hector J. Levesque, and Raymond Reiter, pp. 245–255. San Francisco, California: Morgan Kaufmann Publishers.
    Lin, Fangzhen and Shoham, Yoav. 1990. Epistemic Semantics for Fixed-Points Non-Monotonic Logics.” in TARK 1990. Theoretical Aspects of Reasoning about Knowledge: Proceedings of the Third Conference, edited by Rohit Parikh, pp. 111–120. San Francisco, California: Morgan Kaufmann Publishers.
    Lin, Fangzhen and Shoham, Yoav. 1991. Provably Correct Theories of Action (Preliminary Report).” in AAAI-91. Proceedings of the Ninth National Conference on Artificial Intelligence, edited by Thomas L. Dean and Kathleen R. McKeown, pp. 349–354. Menlo Park, California: The AAAI Press.
    Lin, Fangzhen and Shoham, Yoav. 1992. A Logic of Knowledge and Justified Assumptions.” Artificial Intelligence 57(2–3): 271–289.
    Lin, Fangzhen and You, Jia-Huan. 2002. Abduction in Logic Programming: A New Definition and an Abductive Procedure Based on Rewriting.” Artificial Intelligence 140(1–2): 175–205.
    Lin, Fangzhen and Zao, Yuting. 2002. ASSAT: Computing Answer Sets of a Logic Program by SAT Solvers.” in AAAI-02. Proceedings of the Eighteenth National Conference on Artificial Intelligence, edited by Rina Dechter, Richard S. Sutton, and Michael J. Kearns, pp. 112–117. Menlo Park, California: The AAAI Press. Republished as Lin and Zao (2004).
    Lin, Fangzhen and Zao, Yuting. 2004. ASSAT: Computing Answer Sets of a Logic Program by SAT Solvers.” Artificial Intelligence 157(1–2): 115–137.

Further References

    Cohn, Anthony G., Giunchiglia, Fausto and Selman, Bart, eds. 2000. KR’00: Principles of Knowledge Representation and Reasoning. San Francisco, California: Morgan Kaufmann Publishers.