As AI becomes more ubiquitous there is increasing interest in computers being able to provide explanations for their conclusions. This paper proposes exploring the relationship between the structure of a problem and its explanation. The nature of this challenge is introduced through a series of simple constraint satisfaction problems
Research in constraint programming typically focuses on problem solving efficiency. However, the way...
Research in constraint programming typically focuses on problem solving efficiency. However, the way...
Dottorato di Ricerca in Ingegneria dei Sistemi e Informatica XXVIII Ciclo, a.a. 2015-2016A fundament...
As AI becomes more ubiquitous there is increasing interest in computers being able to provide explan...
The Constraint Satisfaction Problem (CSP) is ubiquitous in artificial intelligence. It has a wide ap...
Many computational problems arising in artificial intelligence, computer science and elsewhere can b...
The aim of this paper is to identify and to characterize the features that render one class of the C...
Many computational problems arising in artificial intelligence, computer science and elsewhere can b...
In this paper we present a general representation for constraint satisfaction problems (CSP) and a -...
Abstract. Recent work have exhibited specific structure among combinatorial problem instances that c...
Constraint programming is a research topic benefiting from many other areas: discrete mathematics, n...
Constraint satisfaction is a fundamental artificial intelligence technique offering a simple yet pow...
• Standard Search Problems – State is a “black box ” with no discernible internal structure – Access...
: This paper describes a framework for expressing and solving combinatorial problems. The framework ...
In the constraint satisfaction problem (CSP) formulation used in artificial intelligence, the variab...
Research in constraint programming typically focuses on problem solving efficiency. However, the way...
Research in constraint programming typically focuses on problem solving efficiency. However, the way...
Dottorato di Ricerca in Ingegneria dei Sistemi e Informatica XXVIII Ciclo, a.a. 2015-2016A fundament...
As AI becomes more ubiquitous there is increasing interest in computers being able to provide explan...
The Constraint Satisfaction Problem (CSP) is ubiquitous in artificial intelligence. It has a wide ap...
Many computational problems arising in artificial intelligence, computer science and elsewhere can b...
The aim of this paper is to identify and to characterize the features that render one class of the C...
Many computational problems arising in artificial intelligence, computer science and elsewhere can b...
In this paper we present a general representation for constraint satisfaction problems (CSP) and a -...
Abstract. Recent work have exhibited specific structure among combinatorial problem instances that c...
Constraint programming is a research topic benefiting from many other areas: discrete mathematics, n...
Constraint satisfaction is a fundamental artificial intelligence technique offering a simple yet pow...
• Standard Search Problems – State is a “black box ” with no discernible internal structure – Access...
: This paper describes a framework for expressing and solving combinatorial problems. The framework ...
In the constraint satisfaction problem (CSP) formulation used in artificial intelligence, the variab...
Research in constraint programming typically focuses on problem solving efficiency. However, the way...
Research in constraint programming typically focuses on problem solving efficiency. However, the way...
Dottorato di Ricerca in Ingegneria dei Sistemi e Informatica XXVIII Ciclo, a.a. 2015-2016A fundament...
DOI
Add to ORKG