[图书][B] Handbook of constraint programming

F Rossi, P Van Beek, T Walsh - 2006 - books.google.com
Constraint programming is a powerful paradigm for solving combinatorial search problems
that draws on a wide range of techniques from artificial intelligence, computer science …

Discovering diverse athletic jumping strategies

Z Yin, Z Yang, M Van De Panne, KK Yin - ACM Transactions on Graphics …, 2021 - dl.acm.org
We present a framework that enables the discovery of diverse and natural-looking motion
strategies for athletic skills such as the high jump. The strategies are realized as control …

Generating diverse plans to handle unknown and partially known user preferences

TA Nguyen, M Do, AE Gerevini, I Serina, B Srivastava… - Artificial Intelligence, 2012 - Elsevier
Current work in planning with preferences assumes that user preferences are completely
specified, and aims to search for a single solution plan to satisfy these. In many real world …

Tractability of explaining classifier decisions

MC Cooper, J Marques-Silva - Artificial Intelligence, 2023 - Elsevier
Explaining decisions is at the heart of explainable AI. We investigate the computational
complexity of providing a formally-correct and minimal explanation of a decision taken by a …

Analysis of evolutionary diversity optimization for permutation problems

A Do, M Guo, A Neumann, F Neumann - ACM Transactions on …, 2022 - dl.acm.org
Generating diverse populations of high-quality solutions has gained interest as a promising
extension to the traditional optimization tasks. This work contributes to this line of research …

On the tractability of explaining decisions of classifiers

MC Cooper, J Marques-Silva - 27th International Conference on …, 2021 - drops.dagstuhl.de
Explaining decisions is at the heart of explainable AI. We investigate the computational
complexity of providing a formally-correct and minimal explanation of a decision taken by a …

Preference-based search using example-critiquing with suggestions

P Viappiani, B Faltings, P Pu - Journal of artificial intelligence Research, 2006 - jair.org
We consider interactive tools that help users search for their most preferred item in a large
collection of options. In particular, we examine example-critiquing, a technique for enabling …

Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory

J Baste, MR Fellows, L Jaffke, T Masařík… - Artificial Intelligence, 2022 - Elsevier
When modeling an application of practical relevance as an instance of a combinatorial
problem X, we are often interested not merely in finding one optimal solution for that …

[PDF][PDF] Domain Independent Approaches for Finding Diverse Plans.

B Srivastava, TA Nguyen, A Gerevini, S Kambhampati… - IJCAI, 2007 - academia.edu
In many planning situations, a planner is required to return a diverse set of plans satisfying
the same goals which will be used by the external systems collectively. We take a domain …

Computing diverse shortest paths efficiently: A theoretical and experimental study

T Hanaka, Y Kobayashi, K Kurita, SW Lee… - Proceedings of the AAAI …, 2022 - ojs.aaai.org
Finding diverse solutions in combinatorial problems recently has received considerable
attention (Baste et al. 2020; Fomin et al. 2020; Hanaka et al. 2021). In this paper we study …