The following pages link to Kaile Su (Q238000):
Displaying 50 items.
- Preference dynamics in games with short sight (Q278384) (← links)
- New local search methods for partial MaxSAT (Q329035) (← links)
- Local search for Boolean satisfiability with configuration checking and subscore (Q490437) (← links)
- CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability (Q502391) (← links)
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover (Q646517) (← links)
- Knowledge structure approach to verification of authentication protocols (Q866176) (← links)
- A logical characterization of extensive games with short sight (Q896918) (← links)
- Default logic about assertions (Q1344433) (← links)
- Constraint guided accelerated search for mixed blocking permutation flowshop scheduling (Q1628124) (← links)
- A complete coalition logic of temporal knowledge for multi-agent systems (Q1633064) (← links)
- A first-order coalition logic for BDI-agents (Q1712430) (← links)
- Reasoning about knowledge, belief and certainty in hierarchical multi-agent systems (Q1712550) (← links)
- Some semantic results about the \(\underset\sim O\) operator in Levesque's logic of belief (Q1814720) (← links)
- More on representation theory for default logic (Q1854447) (← links)
- \(R\)-reconstruction in open logic (Q1895515) (← links)
- Scheduling blocking flowshops with setup times via constraint guided and accelerated local search (Q2003564) (← links)
- (Q2784790) (← links)
- A Logic for Extensive Games with Short Sight (Q2859121) (← links)
- Solving Difficult SAT Problems by Using OBDDs and Greedy Clique Decomposition (Q2898000) (← links)
- Scoring Functions Based on Second Level Score for k-SAT with Long Clauses (Q2929584) (← links)
- (Q2939519) (← links)
- (Q2939522) (← links)
- CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability (Q2982183) (← links)
- Symbolic Model Checking the Knowledge in Herbivore Protocol (Q3003428) (← links)
- Quantified Coalition Logic of Knowledge, Belief and Certainty (Q3305131) (← links)
- (Q3431037) (← links)
- Lower and Upper Bounds for Random Mimimum Satisfiability Problem (Q3452557) (← links)
- CCAnr: A Configuration Checking Based Local Search Solver for Non-random Satisfiability (Q3453204) (← links)
- (Q3455584) (← links)
- Symbolic Model Checking for Dynamic Epistemic Logic (Q3457719) (← links)
- (Q4235216) (← links)
- (Q4300301) (← links)
- (Q4311719) (← links)
- (Q4333071) (← links)
- (Q4364595) (← links)
- Two alternative notions of 'possibility' satisfying Halpern's conditions (Q4487259) (← links)
- (Q4551392) (← links)
- Symbolic model checking for Dynamic Epistemic Logic — S5 and beyond* (Q4612409) (← links)
- A Dynamic-Logical Characterization of Solutions to Sight-limited Extensive Games (Q4637872) (← links)
- (Q4823626) (← links)
- (Q4848184) (← links)
- (Q4867681) (← links)
- (Q4879700) (← links)
- NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover (Q4917618) (← links)
- Primitive Recursiveness of Real Numbers under Different Representations (Q4921448) (← links)
- (Q4943322) (← links)
- Common Object Discovery as Local Search for Maximum Weight Cliques in a Global Object Similarity Graph (Q5237062) (← links)
- Primitive recursive real numbers (Q5307606) (← links)
- The BDD-Based Dynamic A* Algorithm for Real-Time Replanning (Q5321719) (← links)
- FWLS: A Local Search for Graph Coloring (Q5405919) (← links)
