Exploiting incomparability in solution dominance : improving general purpose constraint-based mining
- Submitting institution
-
University of St Andrews
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 269726317
- Type
- E - Conference contribution
- DOI
-
10.3233/FAIA200110
- Title of conference / published proceedings
- ECAI 2020 : 24th European Conference on Artificial Intelligence
- First page
- 331
- Volume
- 325
- Issue
- -
- ISSN
- 0922-6389
- Open access status
- Compliant
- Month of publication
- August
- Year of publication
- 2020
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
3
- Research group(s)
-
A - Artificial Intelligence
- Citation count
- -
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Constraint Dominance Programming (CDP) is a general technique for solving a class of enumeration problems that have (dominance) constraints among solutions. This paper presents a novel method for exploiting a property called incomparability, which drastically improves the performance of some of these problems.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
