Constraint-based Redundancy Resolution
Constraint-Based Redundancy Resolution is a methodological framework within redundancy resolution that employs formally defined constraints to systematically eliminate redundant elements by differentiating permissible from impermissible configurations in structured data or models.
48
Publications
1.8K
Citations
131
Authors
74
Institutions
Publications per year
2017–2026
13
Parents
48
Hamed Jamshidifar, Amir Khajepour, Barış Fi̇dan et al. · IEEE/ASME Transactions on Mechatronics · 2016 · 89 citations
Engineering, Mechanical Engineering, Robotics Engineering +17
Generating minimal definite descriptions
Claire Gardent · 2001 · 88 citations · Full text
1–5 of 48
131
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 131
74
Purdue University West Lafayette
West Lafayette, United States
2 h-index
2 publications
25 citations

Sapienza University of Rome
Rome, Italy
2 h-index
4 publications
152 citations

University of Naples Federico II
Naples, Italy
2 h-index
4 publications
102 citations
University of Technology Sydney
Sydney, Australia
2 h-index
3 publications
100 citations

Chinese Academy of Sciences
Beijing, China
2 h-index
2 publications
131 citations

Sun Yat-sen University
Guangzhou, China
2 h-index
4 publications
660 citations
Politecnico di Milano
Milan, Italy
2 h-index
5 publications
251 citations

Johns Hopkins University
Baltimore, United States
2 h-index
6 publications
180 citations
1–8 of 74
2 publications · 218 citations
2
h-index
2 publications · 135 citations
2
h-index
2 publications · 73 citations
2
h-index
Repository · 2 publications · 43 citations
2
h-index
Conference · 2 publications · 60 citations
2
h-index
1–5