Fangzhen Lin

According to our database1, Fangzhen Lin authored at least 88 papers between 1987 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Faster and Safer Training by Embedding High-Level Knowledge into Deep Reinforcement Learning.
CoRR, 2019

Pure Strategy Best Responses to Mixed Strategies in Repeated Games.
CoRR, 2019

VIAP 1.1 - (Competition Contribution).
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2019

Invincible Strategies of Iterated Prisoner's Dilemma.
Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

2018
Machine Theorem Discovery.
AI Magazine, 2018

Extending VIAP to Handle Array Programs.
Proceedings of the Verified Software. Theories, Tools, and Experiments, 2018

2017
Characterizing causal action theories and their implementations in answer set programming.
Artif. Intell., 2017

VIAP - Automated System for Verifying Integer Assignment Programs with Loops.
Proceedings of the 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2017

K-Memory Strategies in Repeated Games.
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

2016
A Model for Phase Transition of Random Answer-Set Programs.
ACM Trans. Comput. Log., 2016

A formalization of programs in first-order logic with a discrete linear order.
Artif. Intell., 2016

Mapping Action Language BC to Logic Programs: A Characterization by Postulates.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Position Systems in Dynamic Domains.
J. Philosophical Logic, 2015

Characterizing Causal Action Theories and Their Implementations in Answer Set Programming: Action Languages B, C, and Beyond.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

2014
A First-Order Semantics for Golog and ConGolog under a Second-Order Induction Axiom on Situations.
Proceedings of the 2014 AAAI Spring Symposia, 2014

On Computing Optimal Strategies in Open List Proportional Representation: The Two Parties Case.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
Computing Loops with at Most One External Support Rule for Basic Logic Programs with Arbitrary Constraint Atoms.
TPLP, 2013

Computing Loops with at Most One External Support Rule.
ACM Trans. Comput. Log., 2013

Turner's Logic of Universal Causation, Propositional Logic, and Logic Programming.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2013

Voting with partial information: what questions to ask?
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

2012
Ordered completion for first-order logic programs on finite structures.
Artif. Intell., 2012

From Turner's Logic of Universal Causation to the Logic of GK.
Proceedings of the Correct Reasoning, 2012

A Well-Founded Semantics for Basic Logic Programs with Arbitrary Abstract Constraint Atoms.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
Two equivalence results for two-person strict games.
Games and Economic Behavior, 2011

Discovering theorems in game theory: Two-person games with unique pure Nash equilibrium payoffs.
Artif. Intell., 2011

From answer set logic programming to circumscription via logic of GK.
Artif. Intell., 2011

Loop-separable programs and their first-order definability.
Artif. Intell., 2011

On Moving Objects in Dynamic Domains.
Proceedings of the Logical Formalizations of Commonsense Reasoning, 2011

Causal Theories of Actions Revisited.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010
Weight constraint programs with evaluable functions.
Ann. Math. Artif. Intell., 2010

Designing competitions between teams of individuals.
Artif. Intell., 2010

2009
General default logic.
Ann. Math. Artif. Intell., 2009

Computer-aided proofs of Arrow's and other impossibility theorems.
Artif. Intell., 2009

Two Applications of Computer-Aided Theorem Discovery and Verification.
Proceedings of the Knowledge Science, 2009

Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs.
Proceedings of the Logic Programming, 25th International Conference, 2009

Team competition.
Proceedings of the 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), 2009

2008
Situation Calculus.
Proceedings of the Handbook of Knowledge Representation, 2008

Answer Set Programming with Functions.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Eleventh International Conference, 2008

Proving Goal Achievability.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Eleventh International Conference, 2008

Abductive Logic Programming by Nonground Rewrite Systems.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007
Recycling computed answers in rewrite systems for abduction.
ACM Trans. Comput. Log., 2007

Discovering Classes of Strongly Equivalent Logic Programs.
J. Artif. Intell. Res., 2007

A characterization of answer sets for logic programs.
Science in China Series F: Information Sciences, 2007

Forgetting and Update -- an exploration.
Proceedings of the Formal Models of Belief Change in Rational Agents, 26.08. - 30.08.2007, 2007

Finitely-Verifiable Classes of Sentences.
Proceedings of the Logical Formalizations of Commonsense Reasoning, 2007

2006
Loop formulas for circumscription.
Artif. Intell., 2006

First-Order Loop Formulas for Normal Logic Programs.
Proceedings of the Proceedings, 2006

Forgetting and Knowledge Update.
Proceedings of the AI 2006: Advances in Artificial Intelligence, 2006

2005
SELP - A System for Studying Strong Equivalence Between Logic Programs.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2005

2004
ASSAT: computing answer sets of a logic program by SAT solvers.
Artif. Intell., 2004

Discovering State Invariants.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Ninth International Conference (KR2004), 2004

On Odd and Even Cycles in Normal Logic Programs.
Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004

2003
Compiling Causal Theories to Successor State Axioms and STRIPS-Like Systems.
J. Artif. Intell. Res., 2003

On Tight Logic Programs and Yet Another Translation from Normal Logic Programs to Propositional Logic.
Proceedings of the IJCAI-03, 2003

Causal Theories of Action: A Computational Core.
Proceedings of the IJCAI-03, 2003

Answer Set Programming Phase Transition: A Study on Randomly Generated Programs.
Proceedings of the Logic Programming, 19th International Conference, 2003

2002
Abduction in logic programming: A new definition and an abductive procedure based on rewriting.
Artif. Intell., 2002

Reducing Strong Equivalence of Logic Programs to Entailment in Classical Propositional Logic.
Proceedings of the Eights International Conference on Principles and Knowledge Representation and Reasoning (KR-02), 2002

2001
A Planner Called R.
AI Magazine, 2001

On strongest necessary and weakest sufficient conditions.
Artif. Intell., 2001

2000
Ability and Knowing How in the Situation Calculus.
Studia Logica, 2000

Alternating Fixpoint Theory for Logic Programs with Priority.
Proceedings of the Computational Logic, 2000

From Causal Theories to Successor State Axioms and STRIPS-Like Systems.
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000

1999
From Causal Theories to Logic Programs (Sometimes).
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1999

1998
What Robots Can Do: Robot Programs and Effective Achievability.
Artif. Intell., 1998

Applications of the Situation Calculus to Formalizing Control and Strategic Information: The Prolog Cut Operator.
Artif. Intell., 1998

On Measuring Plan Quality (A Preliminary Report).
Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98), 1998

1997
Rules as Actions: A Situation Calculus Semantics for Logic Programs.
J. Log. Program., 1997

GOLOG: A Logic Programming Language for Dynamic Domains.
J. Log. Program., 1997

An Ordering on Subgoals for Planning.
Ann. Math. Artif. Intell., 1997

How to Progress a Database.
Artif. Intell., 1997

Applications of the Situation Calculus To Formalizing Control and Strategy Information: The Prolog Cut Operator.
Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, 1997

Controlling Autonomous Robots with GOLOG.
Proceedings of the Advanced Topics in Artificial Intelligence, 1997

1996
Embracing Causality in Specifying the Indeterminate Effects of Actions.
Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, 1996

1995
Provably Correct Theories of Action.
J. ACM, 1995

How to Progress a Database II: The STRIPS Connection.
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

Embracing Causality in Specifying the Indirect Effects of Actions.
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

Foundations of a Logical Approach to Agent Programming.
Proceedings of the Intelligent Agents II, 1995

1994
State Constraints Revisited.
J. Log. Comput., 1994

How to Progress a Database (and Why) I. Logical Foundations.
Proceedings of the 4th International Conference on Principles of Knowledge Representation and Reasoning (KR'94). Bonn, 1994

1993
An Argument-Based Approach to Nonmonotonic Reasoning.
Computational Intelligence, 1993

1992
A Logic of Knowledge and Justified Assumptions.
Artif. Intell., 1992

Concurrent Actions in the Situation Calculus.
Proceedings of the 10th National Conference on Artificial Intelligence, 1992

1991
Provably Correct Theories of Action (Preliminary Report).
Proceedings of the 9th National Conference on Artificial Intelligence, 1991

1990
Epistemic Semantics for Fixed-Points Non-Monotonic Logics.
Proceedings of the 3rd Conference on Theoretical Aspects of Reasoning about Knowledge, 1990

1989
Argument Systems: A Uniform Basis for Nonmonotonic Reasoning.
Proceedings of the 1st International Conference on Principles of Knowledge Representation and Reasoning (KR'89). Toronto, 1989

1988
Circumscription in a Modal Logic.
Proceedings of the 2nd Conference on Theoretical Aspects of Reasoning about Knowledge, 1988

1987
Reasoning in the Presence of Inconsistency.
Proceedings of the 6th National Conference on Artificial Intelligence. Seattle, 1987


  Loading...