The following pages link to Fangzhen Lin (Q197868):
Displaying 40 items.
- A formalization of programs in first-order logic with a discrete linear order (Q274400) (← links)
- Discovering theorems in game theory: two-person games with unique pure Nash equilibrium payoffs (Q420790) (← links)
- Ordered completion for first-order logic programs on finite structures (Q420824) (← links)
- Two equivalence results for two-person strict games (Q632968) (← links)
- Weight constraint programs with evaluable functions (Q645084) (← links)
- ASSAT: computing answer sets of a logic program by SAT solvers (Q814607) (← links)
- Computer-aided proofs of Arrow's and other impossibility theorems (Q840816) (← links)
- Designing competitions between teams of individuals (Q991017) (← links)
- A logic of knowledge and justified assumption (Q1199920) (← links)
- What robots can do: robot programs and effective achievability (Q1274278) (← links)
- Applications of the situation calculus to formalizing control and strategic information: the Prolog cut operator (Q1274764) (← links)
- An ordering on subgoals for planning (Q1376093) (← links)
- How to progress a database (Q1402735) (← links)
- Abduction in logic programming: A new definition and an abductive procedure based on rewriting (Q1614866) (← links)
- Ability and knowing how in the situation calculus (Q1840653) (← links)
- Position systems in dynamic domains (Q2341258) (← links)
- Characterizing causal action theories and their implementations in answer set programming (Q2407453) (← links)
- Loop formulas for circumscription (Q2457644) (← links)
- A characterization of answer sets for logic programs (Q2644415) (← links)
- (Q2767052) (← links)
- Turner’s Logic of Universal Causation, Propositional Logic, and Logic Programming (Q2851270) (← links)
- From Turner’s Logic of Universal Causation to the Logic of GK (Q2900533) (← links)
- Computing Loops with at Most One External Support Rule (Q2946687) (← links)
- (Q3484810) (← links)
- (Q3493310) (← links)
- (Q3624060) (← links)
- GOLOG: A logic programming language for dynamic domains (Q4352529) (← links)
- Rules as actions: A situation calculus semantics for logic programs (Q4352536) (← links)
- Provably correct theories of action (Q4369865) (← links)
- (Q4535119) (← links)
- Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs (Q4649728) (← links)
- (Q4934652) (← links)
- (Q4955333) (← links)
- Logic Programming (Q5191483) (← links)
- Recycling computed answers in rewrite systems for abduction (Q5277774) (← links)
- A Model for Phase Transition of Random Answer-Set Programs (Q5277923) (← links)
- Logic Programming and Nonmonotonic Reasoning (Q5473996) (← links)
- (Q5740448) (← links)
- Witnesses for Answer Sets of Logic Programs (Q5886522) (← links)
- On strongest necessary and weakest sufficient conditions (Q5941135) (← links)
