Results 1  10
of
220,018
Preferred Explanations for Quantified Constraint Satisfaction Problems
"... Abstract—The Quantified Constraint Satisfaction Problem (QCSP) is a generalization of the classical constraint satisfaction problem in which some variables can be universally quantified. This additional expressiveness can help model problems in which a subset of the variables take value assignments ..."
Abstract
 Add to MetaCart
the requirements of a QCSP, and an approach to finding most preferred explanations of inconsistency based on preferences over relaxations of quantifiers and constraints. This paper unifies work from the fields of constraint satisfaction, explanation generation, and reasoning under preferences and uncertainty. I.
The lexical nature of syntactic ambiguity resolution
 Psychological Review
, 1994
"... Ambiguity resolution is a central problem in language comprehension. Lexical and syntactic ambiguities are standardly assumed to involve different types of knowledge representations and be resolved by different mechanisms. An alternative account is provided in which both types of ambiguity derive fr ..."
Abstract

Cited by 557 (24 self)
 Add to MetaCart
processing. The central processing mechmultiple levels simultaneously, including lexical, phonological, anism we invoke is the constraint satisfaction process that has morphological, syntactic, and text or discourse levels. At any been realized in interactiveactivation models (e.g., Elman &
Valued constraint satisfaction problems: Hard and easy problems
 IJCAI’95: PROCEEDINGS INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE
, 1995
"... In order to deal with overconstrained Constraint Satisfaction Problems, various extensions of the CSP framework have been considered by taking into account costs, uncertainties, preferences, priorities...Each extension uses a specific mathematical operator (+, max...) to aggregate constraint violat ..."
Abstract

Cited by 331 (42 self)
 Add to MetaCart
In order to deal with overconstrained Constraint Satisfaction Problems, various extensions of the CSP framework have been considered by taking into account costs, uncertainties, preferences, priorities...Each extension uses a specific mathematical operator (+, max...) to aggregate constraint
Quantified Constraint Satisfaction Problems: from relaxations to explanations
 In Proc. of Int. Joint. Conf. on Artificial Intelligence (IJCAI
, 2007
"... The Quantified Constraint Satisfaction Problem (QCSP) is a generalisation of the classical CSP in which some of variables can be universally quantified. In this paper, we extend two wellknown concepts in classical constraint satisfaction to the quantified case: problem relaxation and explanation of ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
The Quantified Constraint Satisfaction Problem (QCSP) is a generalisation of the classical CSP in which some of variables can be universally quantified. In this paper, we extend two wellknown concepts in classical constraint satisfaction to the quantified case: problem relaxation and explanation
Relaxations and Explanations for Quantified Constraint Satisfaction Problems ⋆
"... The Quantified CSP (QCSP) is a generalisation of the classical CSP in which some of the variables are universally quantified [3]. We consider the problem of relaxing an instance of the QCSP when it is unsatisfiable. We propose several novel forms of problem relaxations for the QCSP and present an al ..."
Abstract
 Add to MetaCart
The Quantified CSP (QCSP) is a generalisation of the classical CSP in which some of the variables are universally quantified [3]. We consider the problem of relaxing an instance of the QCSP when it is unsatisfiable. We propose several novel forms of problem relaxations for the QCSP and present
Quantified Weighted Constraint Satisfaction Problems
, 2011
"... Soft constraints are functions returning costs, and are essential in modeling overconstrained and optimization problems. Weighted constraint satisfaction is a soft constraint framework, aiming to find a complete assignment with minimum costs. Recently, we are interested in exploring constraint fram ..."
Abstract
 Add to MetaCart
frameworks with adversaries. Quantified constraint satisfaction, which associates ∃ and ∀ quantifiers with variables, is one of these frameworks. We are interested in tackling soft constrained problems with adversarial conditions. Aiming at generalizing the weighted and quantified constraint satisfaction
Bucket Elimination: A Unifying Framework for Reasoning
"... Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problemsolving and reasoning tasks. Algorithms such as directionalresolution for propositional satisfiability, adaptiveconsistency for constraint satisfaction, Fourier and Gaussian elimination ..."
Abstract

Cited by 298 (58 self)
 Add to MetaCart
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problemsolving and reasoning tasks. Algorithms such as directionalresolution for propositional satisfiability, adaptiveconsistency for constraint satisfaction, Fourier and Gaussian
Quantified Constraint Satisfaction Problems: From Relaxations to Explanations Content Areas: Constraint Satisfaction Problems and Constraint Programming
, 1342
"... The Quantified Constraint Satisfaction Problem (QCSP) is a generalisation of the classical CSP in which some of variables can be universally quantified. The classical CSP can be seen as a QCSP in which all variables are existentially quantified. The QCSP has attracted significant attention over the ..."
Abstract
 Add to MetaCart
the past several years, building upon earlier work on Quantified Boolean Formulae. In this paper, we extend two wellknown concepts in classical constraint satisfaction to the quantified case: problem relaxation, and explanation of inconsistency. We show that the generality of the QCSP allows for a number
Algorithms for quantified constraint satisfaction problems
 In Proceedings of CP2004
, 2004
"... Abstract. Many propagation and search algorithms have been developed for constraint satisfaction problems (CSPs). In a standard CSP all variables are existentially quantified. The CSP formalism can be extended to allow universally quantified variables, in which case the complexity of the basic reaso ..."
Abstract

Cited by 21 (2 self)
 Add to MetaCart
Abstract. Many propagation and search algorithms have been developed for constraint satisfaction problems (CSPs). In a standard CSP all variables are existentially quantified. The CSP formalism can be extended to allow universally quantified variables, in which case the complexity of the basic
Consistency and the Quantified Constraint Satisfaction Problem
, 2007
"... Constraint satisfaction is a very well studied and fundamental artificial intelligence technique. Various forms of knowledge can be represented with constraints, and reasoning techniques from disparate fields can be encapsulated within constraint reasoning algorithms. However, problems involving unc ..."
Abstract

Cited by 16 (1 self)
 Add to MetaCart
uncertainty, or which have an adversarial nature (for example, games), are difficult to express and solve in the classical constraint satisfaction problem. This thesis is concerned with an extension to the classical problem: the Quantified Constraint Satisfaction Problem (QCSP). QCSP has recently attracted
Results 1  10
of
220,018