The following pages link to Wei Li (Q351017):
Displaying 50 items.
- \textbf{R}-calculus without the cut rule (Q351018) (← links)
- Optimized statistical analysis of software trustworthiness attributes (Q362171) (← links)
- (Q439713) (redirect page) (← links)
- A formal semantics for program debugging (Q439714) (← links)
- (Q507354) (redirect page) (← links)
- Revision with probability (Q507355) (← links)
- An algorithm to compute maximal contractions for Horn clauses (Q543196) (← links)
- R-calculus for ELP: An operational approach to knowledge base maintenance (Q676851) (← links)
- Dynamical characteristics of software trustworthiness and their evolutionary complexity (Q848263) (← links)
- Complexity of software trustworthiness and its dynamical statistical analysis methods (Q848339) (← links)
- A development calculus for specifications (Q866032) (← links)
- A programmable approach to revising knowledge bases (Q866190) (← links)
- A structural operational semantics for an Edison-like language (Q1075044) (← links)
- Open logic based on total-ordered partition model (Q1286656) (← links)
- The open logic and its relation to circumscription (Q1297717) (← links)
- A programmable approach to maintenance of a finite knowledge base (Q1400054) (← links)
- Limits of theory sequences over algebraically closed fields and applications. (Q1421482) (← links)
- On the average similarity degree between solutions of random \(k\)-SAT and random CSPs. (Q1421490) (← links)
- Operational and complete approaches to belief revision (Q1579730) (← links)
- The SAT phase transition (Q1610035) (← links)
- The \(\mathbf{B}_4\)-valued propositional logic with unary logical connectives \(\sim_1/\sim_2/\neg\) (Q1712572) (← links)
- A mathematic-physical approach to the satisfiability problem (Q1805394) (← links)
- A structural operational semantics for an Edison like language. II (Q1821554) (← links)
- A logical framework for knowledge base maintenance (Q1894319) (← links)
- Parametric logic: Foundations (Q1902289) (← links)
- On \(k\)-positive satisfiability problem (Q1964360) (← links)
- An incremental approach to automatic algorithm design (Q1964361) (← links)
- A type-theoretic approach to program development (Q2277827) (← links)
- A formal semantics for debugging synchronous message passing-based concurrent programs (Q2348946) (← links)
- An average analysis of backtracking on random constraint satisfaction problems (Q2349811) (← links)
- An open logic system (Q2367852) (← links)
- Concurrent calculus (CC) and its properties (Q2368122) (← links)
- Many hard examples in exact phase transitions (Q2368999) (← links)
- A decomposition based algorithm for maximal contractions (Q2418656) (← links)
- A sound and complete \(R\)-calculi with respect to contraction and minimal change (Q2418664) (← links)
- (Q2824401) (← links)
- Open Geometry Textbook: A Case Study of Knowledge Acquisition via Collective Intelligence (Q2907344) (← links)
- (Q3462784) (← links)
- A SYMBOLIC CALCULUS ON DEFECT REVISIONS OF AXIOMATIC SYSTEMS (Q3620759) (← links)
- (Q3657414) (← links)
- (Q3725531) (← links)
- (Q4501600) (← links)
- (Q4943322) (← links)
- (Q4954175) (← links)
- R-CALCULUS: A Logic of Belief Revision (Q5007095) (← links)
- A representative model based algorithm for maximal contractions (Q5018142) (← links)
- R-Calculus, II: Many-Valued Logics (Q5035410) (← links)
- A theory of requirements capture and its applications (Q5044751) (← links)
- A heuristic algorithm for cube packing with time schedule (Q5046352) (← links)
- Logical verification of scientific discovery (Q5046390) (← links)
