文章名稱引用次數(shù)

• A review of the relations between logical argumentation and reasoning with maximal consistency3
• Relative deviation learning bounds and generalization with unbounded loss functions2
• Fundamental conditions on the sampling pattern for union of low-rank subspaces retrieval2
• The complexity of satisfiability in non-iterated and iterated probabilistic logics2
• Complexity of control by partitioning veto elections and of control by adding candidates to plurality elections1
• A labelling framework for probabilistic argumentation1
• From informal to formal proofs in Euclidean geometry1
• The SAT plus CAS method for combinatorial search with applications to best matrices0
• Proof-checking Euclid0
• A subdivision algorithm to reason on high-degree polynomial constraints over finite domains0