Yuanhong Wang

Yuanhong Wang

Auto-generated profile, based on publicly available information

Yuanhong Wang

Beihang Univ, State Key Lab Complex & Crit Software Environm, Beijing, Peoples R China

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 February 2024 in Neurocomputing
Verified
Journal Article
Closed access
JPJuhua Pu
Juhua Pu
YWYuanhong Wang
Yuanhong Wang
FNFang Nan
Fang Nan
WLWU XING LIU
WU XING LIU

19 March 2024 in Artificial Intelligence
Verified
Journal Article
Closed access
YWYuanhong Wang
Yuanhong Wang
JPJuhua Pu
Juhua Pu
YWYuyi Wang
Yuyi Wang
OKOndřej Kuželka
Ondřej Kuželka

17 December 2021
Verified
Conference Paper
Open access
PDF file
YWYuanhong Wang
Yuanhong Wang
XWXiaoqiong Wang
Xiaoqiong Wang
YLYi Liu
Yi Liu
On the basis of studying the connotation of Rural Revitalization Strategy, the dilemma of talent training and development, and the orientation of new agricultural talent training, this paper discusses how to train new agricultural talents in local agricultural colleges and universities. Through literature review, investigation and analysis, the author believes that the core idea of new agricultural talent training is to cultivate new agricultural talents with modern university concept and innovative features. The path of new agricultural talent training is to promote discipline integration, consolidate the knowledge structure of “thick foundation and wide caliber”, guide cooperation and exchange, and build a practice platform of “strong practice and innovation”, we will strengthen social services and implement a testing mechanism of “wide adaptation and high quality”.

16 October 2024
Verified
Book Chapter
Open access
PDF file
QMQiaolan Meng
Qiaolan Meng
JTJan Tóth
Jan Tóth
YWYuanhong Wang
Yuanhong Wang
YWYuyi Wang
Yuyi Wang
OKOndřej Kuželka
Ondřej Kuželka
We consider the task of weighted first-order model counting (WFOMC), a fundamental problem of probabilistic inference in statistical relational learning. The goal of WFOMC is to compute the weighted sum of models of a given first-order logic sentence over a finite domain, where each model is assigned a weight by a pair of weighting functions. Past work has shown that WFOMC can be solved in polynomial time in the domain size if the sentence is in the two-variable fragment of first-order logic (FO2). This result is later extended to the case where the sentence is in FO2with the linear order axiom, which requires a binary predicate in the sentence to introduce a linear ordering of the domain elements. However, despite its polynomial theoretical complexity, the existing domain-liftable algorithm for WFOMC with the linear order often suffers from inefficiencies when applied to real-world problems. This paper introduces a novel domain-lifted algorithm for WFOMC with the linear order axiom. Compared to the existing approach, our proposed algorithm exploits the inherent symmetries within first-order logic sentences and weighting functions to minimize redundant computations. Experimental results verify the efficiency of our approach, demonstrating a significant speedup over the existing approach.