default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFangzhen Lin
Person information
- affiliation: Hong Kong University of Science and Technology
Other persons with a similar name
SPARQL queries 
🛈 Please note that only 57% of the records listed on this page have a DOI. Therefore, DOI-based queries can only provide partial results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c75]Chenglin Wang
, Fangzhen Lin:
On Polynomial Expressions with C-Finite Recurrences in Loops with Nested Nondeterministic Branches. CAV (1) 2024: 409-430- 2023
- [j40]Jiyao Wang, Zijie Chen, Yijia Zhang, Dengbo He, Fangzhen Lin:
Preciser comparison: Augmented multi-layer dynamic contrastive strategy for text2text question classification. Neurocomputing 544: 126299 (2023) - [j39]Jiyao Wang, Zijie Chen, Yang Qin, Dengbo He, Fangzhen Lin:
Multi-Aspect co-Attentional Collaborative Filtering for extreme multi-label text classification. Knowl. Based Syst. 260: 110110 (2023) - [j38]Chenglin Wang, Fangzhen Lin:
Solving Conditional Linear Recurrences for Program Verification: The Periodic Case. Proc. ACM Program. Lang. 7(OOPSLA1): 28-55 (2023) - [j37]Yisong Wang, Thomas Eiter, Yuanlin Zhang, Fangzhen Lin:
Witnesses for Answer Sets of Logic Programs. ACM Trans. Comput. Log. 24(2): 15:1-15:46 (2023) - [c74]Ziyi Shou, Fangzhen Lin:
Evaluate AMR Graph Similarity via Self-supervised Learning. ACL (1) 2023: 16112-16123 - [c73]Yuxin Pan, Yize Chen, Fangzhen Lin:
Adjustable Robust Reinforcement Learning for Online 3D Bin Packing. NeurIPS 2023 - [i14]Fangzhen Lin, Ziyi Shou, Chengcai Chen:
Using Language Models For Knowledge Acquisition in Natural Language Reasoning Problems. CoRR abs/2304.01771 (2023) - [i13]Fengming Zhu, Fangzhen Lin:
On Computing Universal Plans for Partially Observable Multi-Agent Path Finding. CoRR abs/2305.16203 (2023) - [i12]Yuxin Pan, Yize Chen, Fangzhen Lin:
Adjustable Robust Reinforcement Learning for Online 3D Bin Packing. CoRR abs/2310.04323 (2023) - 2022
- [c72]Ziyi Shou, Yuxin Jiang, Fangzhen Lin:
AMR-DA: Data Augmentation by Abstract Meaning Representation. ACL (Findings) 2022: 3082-3098 - [c71]Yuxin Pan, Fangzhen Lin:
Backward Imitation and Forward Reinforcement Learning via Bi-directional Model Rollouts. IROS 2022: 9040-9047 - [i11]Jaewoo Song, Fangzhen Lin:
PocketNN: Integer-only Training and Inference of Neural Networks via Direct Feedback Alignment and Pocket Activations in Pure C++. CoRR abs/2201.02863 (2022) - [i10]Yuxin Pan, Fangzhen Lin:
Backward Imitation and Forward Reinforcement Learning via Bi-directional Model Rollouts. CoRR abs/2208.02434 (2022) - 2021
- [c70]Fangzhen Lin:
Parameterized Logical Theories. AAAI 2021: 6402-6409 - [c69]Yuxin Jiang, Ziyi Shou, Qijun Wang, Hao Wu, Fangzhen Lin:
XRJL-HKUST at SemEval-2021 Task 4: WordNet-Enhanced Dual Multi-head Co-Attention for Reading Comprehension of Abstract Meaning. SemEval@ACL/IJCNLP 2021: 793-798 - [c68]Ziyi Shou, Fangzhen Lin:
Incorporating EDS Graph for AMR Parsing. *SEM 2021: 202-211 - [i9]Yuxin Jiang, Ziyi Shou, Qijun Wang, Hao Wu, Fangzhen Lin:
XRJL-HKUST at SemEval-2021 Task 4: WordNet-Enhanced Dual Multi-head Co-Attention for Reading Comprehension of Abstract Meaning. CoRR abs/2103.16102 (2021) - [i8]Kai Kang, Fangzhen Lin:
Computing Class Hierarchies from Classifiers. CoRR abs/2112.01187 (2021) - 2020
- [c67]Shiheng Wang, Fangzhen Lin:
Nice Invincible Strategy for the Average-Payoff IPD. AAAI 2020: 2268-2275 - [c66]Zihang Gao, Fangzhen Lin, Yi Zhou, Hao Zhang, Kaishun Wu, Haodi Zhang:
Embedding High-Level Knowledge into DQNs to Learn Faster and More Safely. AAAI 2020: 13608-13609
2010 – 2019
- 2019
- [c65]Shiheng Wang, Fangzhen Lin:
Invincible Strategies of Iterated Prisoner's Dilemma. AAMAS 2019: 2256-2258 - [c64]Fangzhen Lin:
Translating classes to first-order logic: an example. FTfJP@ECOOP 2019: 7:1-7:3 - [c63]Pritom Rajkhowa, Fangzhen Lin:
VIAP 1.1 - (Competition Contribution). TACAS (3) 2019: 250-255 - [i7]Shiheng Wang, Fangzhen Lin:
Pure Strategy Best Responses to Mixed Strategies in Repeated Games. CoRR abs/1902.09066 (2019) - [i6]Haodi Zhang, Zihang Gao, Yi Zhou, Hao Zhang, Kaishun Wu, Fangzhen Lin:
Faster and Safer Training by Embedding High-Level Knowledge into Deep Reinforcement Learning. CoRR abs/1910.09986 (2019) - 2018
- [j36]Fangzhen Lin:
Machine Theorem Discovery. AI Mag. 39(2): 53-59 (2018) - [c62]Pritom Rajkhowa, Fangzhen Lin:
Extending VIAP to Handle Array Programs. VSTTE 2018: 38-49 - 2017
- [j35]Haodi Zhang, Fangzhen Lin:
Characterizing causal action theories and their implementations in answer set programming. Artif. Intell. 248: 1-8 (2017) - [c61]Lijie Chen, Fangzhen Lin, Pingzhong Tang, Kangning Wang, Ruosong Wang, Shiheng Wang:
K-Memory Strategies in Repeated Games. AAMAS 2017: 1493-1498 - [c60]Pritom Rajkhowa, Fangzhen Lin:
VIAP - Automated System for Verifying Integer Assignment Programs with Loops. SYNASC 2017: 137-144 - [e5]Jeff Z. Pan, Diego Calvanese, Thomas Eiter, Ian Horrocks, Michael Kifer, Fangzhen Lin, Yuting Zhao:
Reasoning Web: Logical Foundation of Knowledge Graph Construction and Query Answering - 12th International Summer School 2016, Aberdeen, UK, September 5-9, 2016, Tutorial Lectures. Lecture Notes in Computer Science 9885, Springer 2017, ISBN 978-3-319-49492-0 [contents] - [i5]Shiheng Wang, Fangzhen Lin:
Invincible Strategies of Iterated Prisoner's Dilemma. CoRR abs/1712.06488 (2017) - 2016
- [j34]Fangzhen Lin:
A formalization of programs in first-order logic with a discrete linear order. Artif. Intell. 235: 1-25 (2016) - [j33]Lian Wen, Kewen Wang, Yi-Dong Shen, Fangzhen Lin:
A Model for Phase Transition of Random Answer-Set Programs. ACM Trans. Comput. Log. 17(3): 22 (2016) - [c59]Haodi Zhang, Fangzhen Lin:
Mapping Action Language BC to Logic Programs: A Characterization by Postulates. AAAI 2016: 1116-1123 - [e4]Chattrakul Sombattheera, Frieder Stolzenburg, Fangzhen Lin, Abhaya C. Nayak:
Multi-disciplinary Trends in Artificial Intelligence - 10th International Workshop, MIWAI 2016, Chiang Mai, Thailand, December 7-9, 2016, Proceedings. Lecture Notes in Computer Science 10053, Springer 2016, ISBN 978-3-319-49396-1 [contents] - 2015
- [j32]Jianmin Ji, Fangzhen Lin:
Position Systems in Dynamic Domains. J. Philos. Log. 44(2): 147-161 (2015) - [c58]Haodi Zhang, Fangzhen Lin:
Characterizing Causal Action Theories and Their Implementations in Answer Set Programming: Action Languages B, C, and Beyond. IJCAI 2015: 3285-3291 - 2014
- [c57]Ning Ding, Fangzhen Lin:
On Computing Optimal Strategies in Open List Proportional Representation: The Two Parties Case. AAAI 2014: 1419-1425 - [c56]Fangzhen Lin:
A First-Order Semantics for Golog and ConGolog under a Second-Order Induction Axiom on Situations. AAAI Spring Symposia 2014 - [c55]Fangzhen Lin:
A Formalization of Programs in First-Order Logic with a Discrete Linear Order. KR 2014 - [c54]Fangzhen Lin:
A First-Order Semantics for Golog and ConGolog under a Second-Order Induction Axiom for Situations. KR 2014 - 2013
- [j31]Xiaoping Chen, Jianmin Ji, Fangzhen Lin:
Computing Loops with at Most One External Support Rule. ACM Trans. Comput. Log. 14(1): 3:1-3:34 (2013) - [j30]Jianmin Ji, Fangzhen Lin, Jia-Huai You:
Computing Loops with at Most One External Support Rule for Basic Logic Programs with Arbitrary Constraint Atoms. Theory Pract. Log. Program. 13(4-5-Online-Supplement) (2013) - [c53]Ning Ding, Fangzhen Lin:
Voting with partial information: what questions to ask? AAMAS 2013: 1237-1238 - [c52]Jianmin Ji, Fangzhen Lin:
Turner's Logic of Universal Causation, Propositional Logic, and Logic Programming. LPNMR 2013: 401-413 - 2012
- [j29]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) - [c51]Yisong Wang, Fangzhen Lin, Mingyi Zhang, Jia-Huai You:
A Well-Founded Semantics for Basic Logic Programs with Arbitrary Abstract Constraint Atoms. AAAI 2012: 835-841 - [c50]Jianmin Ji, Fangzhen Lin:
From Turner's Logic of Universal Causation to the Logic of GK. Correct Reasoning 2012: 380-385 - 2011
- [j28]Fangzhen Lin, Yi Zhou:
From answer set logic programming to circumscription via logic of GK. Artif. Intell. 175(1): 264-277 (2011) - [j27]Yin Chen, Fangzhen Lin, Yan Zhang, Yi Zhou:
Loop-separable programs and their first-order definability. Artif. Intell. 175(3-4): 890-913 (2011) - [j26]Pingzhong Tang, Fangzhen Lin:
Discovering theorems in game theory: Two-person games with unique pure Nash equilibrium payoffs. Artif. Intell. 175(14-15): 2010-2020 (2011) - [j25]Pingzhong Tang, Fangzhen Lin:
Two equivalence results for two-person strict games. Games Econ. Behav. 71(2): 479-486 (2011) - [c49]Fangzhen Lin, Mikhail Soutchanski:
Causal Theories of Actions Revisited. AAAI 2011: 235-240 - [c48]Fangzhen Lin:
On Moving Objects in Dynamic Domains. AAAI Spring Symposium: Logical Formalizations of Commonsense Reasoning 2011 - [c47]Fangzhen Lin, Mikhail Soutchanski:
Causal Theories of Actions Revisited. AAAI Spring Symposium: Logical Formalizations of Commonsense Reasoning 2011 - [i4]Fangzhen Lin:
Compiling Causal Theories to Successor State Axioms and STRIPS-Like Systems. CoRR abs/1106.4867 (2011) - [i3]Yin Chen, Fangzhen Lin:
Discovering Classes of Strongly Equivalent Logic Programs. CoRR abs/1110.2738 (2011) - 2010
- [j24]Pingzhong Tang, Yoav Shoham, Fangzhen Lin:
Designing competitions between teams of individuals. Artif. Intell. 174(11): 749-766 (2010) - [j23]Yisong Wang, Jia-Huai You, Fangzhen Lin, Li-Yan Yuan, Mingyi Zhang:
Weight constraint programs with evaluable functions. Ann. Math. Artif. Intell. 60(3-4): 341-380 (2010) - [c46]Vernon Asuncion, Fangzhen Lin, Yan Zhang, Yi Zhou:
Ordered Completion for First-Order Logic Programs on Finite Structures. AAAI 2010: 249-254 - [e3]Fangzhen Lin, Ulrike Sattler, Miroslaw Truszczynski:
Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, KR 2010, Toronto, Ontario, Canada, May 9-13, 2010. AAAI Press 2010 [contents]
2000 – 2009
- 2009
- [j22]Pingzhong Tang, Fangzhen Lin:
Computer-aided proofs of Arrow's and other impossibility theorems. Artif. Intell. 173(11): 1041-1053 (2009) - [j21]Yi Zhou, Fangzhen Lin, Yan Zhang:
General default logic. Ann. Math. Artif. Intell. 57(2): 125-160 (2009) - [c45]Pingzhong Tang, Yoav Shoham, Fangzhen Lin:
Team competition. AAMAS (1) 2009: 241-248 - [c44]Xiaoping Chen, Jianmin Ji, Fangzhen Lin:
Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs. ICLP 2009: 130-144 - [c43]Pingzhong Tang, Fangzhen Lin:
Discovering Theorems in Game Theory: Two-Person Games with Unique Pure Nash Equilibrium Payoffs. IJCAI 2009: 312-317 - [c42]Fangzhen Lin:
Two Applications of Computer-Aided Theorem Discovery and Verification. KSEM 2009: 2 - [e2]Esra Erdem, Fangzhen Lin, Torsten Schaub:
Logic Programming and Nonmonotonic Reasoning, 10th International Conference, LPNMR 2009, Potsdam, Germany, September 14-18, 2009. Proceedings. Lecture Notes in Computer Science 5753, Springer 2009, ISBN 978-3-642-04237-9 [contents] - 2008
- [c41]Fangzhen Lin, Pingzhong Tang:
Computer-Aided Proofs of Arrow's and Other Impossibility Theorems. AAAI 2008: 114-119 - [c40]Fangzhen Lin, Jia-Huai You:
Abductive Logic Programming by Nonground Rewrite Systems. AAAI 2008: 480-485 - [c39]Xiaoping Chen, Jianmin Ji, Fangzhen Lin:
Computing Loops with at Most One External Support Rule. KR 2008: 401-410 - [c38]Fangzhen Lin, Yisong Wang:
Answer Set Programming with Functions. KR 2008: 454-465 - [c37]Fangzhen Lin:
Proving Goal Achievability. KR 2008: 621-628 - [r1]Fangzhen Lin:
Situation Calculus. Handbook of Knowledge Representation 2008: 649-669 - 2007
- [j20]Mingyi Zhang, Ying Zhang, Fangzhen Lin:
A characterization of answer sets for logic programs. Sci. China Ser. F Inf. Sci. 50(1): 46-62 (2007) - [j19]Fangzhen Lin, Yin Chen:
Discovering Classes of Strongly Equivalent Logic Programs. J. Artif. Intell. Res. 28: 431-451 (2007) - [j18]Fangzhen Lin, Jia-Huai You:
Recycling computed answers in rewrite systems for abduction. ACM Trans. Comput. Log. 8(2): 9 (2007) - [c36]Fangzhen Lin:
Finitely-Verifiable Classes of Sentences. AAAI Spring Symposium: Logical Formalizations of Commonsense Reasoning 2007: 89-94 - [c35]Fangzhen Lin, Yi Zhou:
From Answer Set Logic Programming to Circumscription via Logic of GK. IJCAI 2007: 441-446 - [c34]Yi Zhou, Fangzhen Lin, Yan Zhang:
General Default Logic. LPNMR 2007: 241-253 - [i2]Abhaya C. Nayak, Yin Chen, Fangzhen Lin:
Forgetting and Update -- an exploration. Formal Models of Belief Change in Rational Agents 2007 - 2006
- [j17]Joohyung Lee, Fangzhen Lin:
Loop formulas for circumscription. Artif. Intell. 170(2): 160-185 (2006) - [c33]Abhaya C. Nayak, Yin Chen, Fangzhen Lin:
Forgetting and Knowledge Update. Australian Conference on Artificial Intelligence 2006: 131-140 - [c32]Yin Chen, Fangzhen Lin, Yisong Wang, Mingyi Zhang:
First-Order Loop Formulas for Normal Logic Programs. KR 2006: 298-307 - [e1]Jérôme Lang, Fangzhen Lin, Ju Wang:
Knowledge Science, Engineering and Management, First International Conference, KSEM 2006, Guilin, China, August 5-8, 2006, Proceedings. Lecture Notes in Computer Science 4092, Springer 2006, ISBN 3-540-37033-1 [contents] - 2005
- [c31]Yin Chen, Fangzhen Lin, Lei Li:
SELP - A System for Studying Strong Equivalence between Logic Programs. Answer Set Programming 2005 - [c30]Fangzhen Lin, Yin Chen:
Discovering Classes of Strongly Equivalent Logic Programs. IJCAI 2005: 516-521 - [c29]Yin Chen, Fangzhen Lin, Lei Li:
SELP - A System for Studying Strong Equivalence Between Logic Programs. LPNMR 2005: 442-446 - 2004
- [j16]Fangzhen Lin, Yuting Zhao:
ASSAT: computing answer sets of a logic program by SAT solvers. Artif. Intell. 157(1-2): 115-137 (2004) - [c28]Fangzhen Lin, Xishun Zhao:
On Odd and Even Cycles in Normal Logic Programs. AAAI 2004: 80-85 - [c27]Joohyung Lee, Fangzhen Lin:
Loop Formulas for Circumscription. AAAI 2004: 281-286 - [c26]Fangzhen Lin:
Discovering State Invariants. KR 2004: 536-544 - [i1]Fangzhen Lin, Jia-Huai You:
Recycling Computed Answers in Rewrite Systems for Abduction. CoRR cs.AI/0402033 (2004) - 2003
- [j15]Fangzhen Lin:
Compiling Causal Theories to Successor State Axioms and STRIPS-Like Systems. J. Artif. Intell. Res. 19: 279-314 (2003) - [c25]Yuting Zhao, Fangzhen Lin:
Answer Set Programming Phase Transition: A Study on Randomly Generated Programs. ICLP 2003: 239-253 - [c24]Fangzhen Lin, Jicheng Zhao:
On Tight Logic Programs and Yet Another Translation from Normal Logic Programs to Propositional Logic. IJCAI 2003: 853-858 - [c23]Fangzhen Lin, Jia-Huai You:
Recycling Computed Answers in Rewrite Systems for Abduction. IJCAI 2003: 879-886 - [c22]Jérôme Lang, Fangzhen Lin, Pierre Marquis:
Causal Theories of Action: A Computational Core. IJCAI 2003: 1073-1078 - 2002
- [j14]Fangzhen Lin, Jia-Huai You:
Abduction in logic programming: A new definition and an abductive procedure based on rewriting. Artif. Intell. 140(1/2): 175-205 (2002) - [c21]Fangzhen Lin, Yuting Zhao:
ASSAT: Computing Answer Sets of a Logic Program by SAT Solvers. AAAI/IAAI 2002: 112-118 - [c20]Fangzhen Lin:
Reducing Strong Equivalence of Logic Programs to Entailment in Classical Propositional Logic. KR 2002: 170-176 - 2001
- [j13]Fangzhen Lin:
On strongest necessary and weakest sufficient conditions. Artif. Intell. 128(1-2): 143-159 (2001) - [j12]Fangzhen Lin:
A Planner Called R. AI Mag. 22(3): 73-76 (2001) - [c19]Fangzhen Lin, Jia-Huai You:
Abduction in Logic Programming: A New Definition and an Abductive Procedure Based on Rewriting. IJCAI 2001: 655-666 - 2000
- [j11]Yves Lespérance, Hector J. Levesque, Fangzhen Lin, Richard B. Scherl:
Ability and Knowing How in the Situation Calculus. Stud Logica 66(1): 165-186 (2000) - [c18]Fangzhen Lin:
From Causal Theories to Successor State Axioms and STRIPS-Like Systems. AAAI/IAAI 2000: 786-791 - [c17]Kewen Wang, Lizhu Zhou, Fangzhen Lin:
Alternating Fixpoint Theory for Logic Programs with Priority. Computational Logic 2000: 164-178 - [c16]Fangzhen Lin:
On Strongest Necessary and Weakest Sufficient Conditions. KR 2000: 167-175
1990 – 1999
- 1999
- [c15]Fangzhen Lin, Kewen Wang:
From Causal Theories to Logic Programs (Sometimes). LPNMR 1999: 117-131 - 1998
- [j10]Fangzhen Lin, Hector J. Levesque:
What Robots Can Do: Robot Programs and Effective Achievability. Artif. Intell. 101(1-2): 201-226 (1998) - [j9]Fangzhen Lin:
Applications of the Situation Calculus to Formalizing Control and Strategic Information: The Prolog Cut Operator. Artif. Intell. 103(1-2): 273-294 (1998) - [c14]Fangzhen Lin:
On Measuring Plan Quality (A Preliminary Report). KR 1998: 224-233 - 1997
- [j8]Fangzhen Lin, Raymond Reiter:
How to Progress a Database. Artif. Intell. 92(1-2): 131-167 (1997) - [j7]Fangzhen Lin:
An Ordering on Subgoals for Planning. Ann. Math. Artif. Intell. 21(2-4): 321-342 (1997) - [j6]Hector J. Levesque, Raymond Reiter, Yves Lespérance, Fangzhen Lin, Richard B. Scherl:
GOLOG: A Logic Programming Language for Dynamic Domains. J. Log. Program. 31(1-3): 59-83 (1997) - [j5]Fangzhen Lin, Raymond Reiter:
Rules as Actions: A Situation Calculus Semantics for Logic Programs. J. Log. Program. 31(1-3): 299-330 (1997) - [c13]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. Australian Joint Conference on Artificial Intelligence 1997: 1-12 - [c12]Fangzhen Lin:
Applications of the Situation Calculus To Formalizing Control and Strategy Information: The Prolog Cut Operator. IJCAI 1997: 1412-1419 - 1996
- [c11]Fangzhen Lin:
Embracing Causality in Specifying the Indeterminate Effects of Actions. AAAI/IAAI, Vol. 1 1996: 670-676 - 1995
- [j4]Fangzhen Lin, Yoav Shoham:
Provably Correct Theories of Action. J. ACM 42(2): 293-320 (1995) - [c10]Yves Lespérance, Hector J. Levesque, Fangzhen Lin, Daniel Marcu, Raymond Reiter, Richard B. Scherl:
Foundations of a Logical Approach to Agent Programming. ATAL 1995: 331-346 - [c9]Fangzhen Lin:
Embracing Causality in Specifying the Indirect Effects of Actions. IJCAI 1995: 1985-1993 - [c8]Fangzhen Lin, Raymond Reiter:
How to Progress a Database II: The STRIPS Connection. IJCAI 1995: 2001-2009 - 1994
- [j3]Fangzhen Lin, Raymond Reiter:
State Constraints Revisited. J. Log. Comput. 4(5): 655-678 (1994) - [c7]Fangzhen Lin, Raymond Reiter:
How to Progress a Database (and Why) I. Logical Foundations. KR 1994: 425-436 - 1993
- [j2]Fangzhen Lin:
An Argument-Based Approach to Nonmonotonic Reasoning. Comput. Intell. 9: 254-267 (1993) - 1992
- [j1]Fangzhen Lin, Yoav Shoham:
A Logic of Knowledge and Justified Assumptions. Artif. Intell. 57(2-3): 271-289 (1992) - [c6]Fangzhen Lin, Yoav Shoham:
Concurrent Actions in the Situation Calculus. AAAI 1992: 590-595 - 1991
- [b1]Fangzhen Lin:
A study of nonmonotonic reasoning. Stanford University, USA, 1991 - [c5]Fangzhen Lin, Yoav Shoham:
Provably Correct Theories of Action (Preliminary Report). AAAI 1991: 349-354 - 1990
- [c4]Fangzhen Lin, Yoav Shoham:
Epistemic Semantics for Fixed-Points Non-Monotonic Logics. TARK 1990: 111-120
1980 – 1989
- 1989
- [c3]Fangzhen Lin, Yoav Shoham:
Argument Systems: A Uniform Basis for Nonmonotonic Reasoning. KR 1989: 245-255 - 1988
- [c2]Fangzhen Lin:
Circumscription in a Modal Logic. TARK 1988: 113-127 - 1987
- [c1]Fangzhen Lin:
Reasoning in the Presence of Inconsistency. AAAI 1987: 139-143
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 20:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
