Sciweavers

ATAL
2010
Springer
13 years 5 months ago
Cooperative problem solving against adversary: quantified distributed constraint satisfaction problem
In this paper, we extend the traditional formalization of a Distributed Constraint Satisfaction Problems (DisCSP) to a Quantified DisCSP. A Quantified DisCSP includes several unive...
Satomi Baba, Atsushi Iwasaki, Makoto Yokoo, Marius...
CSCLP
2006
Springer
13 years 8 months ago
Complexity of a CHR Solver for Existentially Quantified Conjunctions of Equations over Trees
Abstract. Constraint Handling Rules (CHR) is a concurrent, committed-choice, rule-based language. One of the first CHR programs is the classic constraint solver for syntactic equal...
Marc Meister, Khalil Djelloul, Thom W. Frühwi...
ECAI
2004
Springer
13 years 8 months ago
Encoding Quantified CSPs as Quantified Boolean Formulae
Quantified Constraint Satisfaction Problems (QCSPs) are CSPs in which some variables are universally quantified. For each possible value of such variables, we have to find ways to ...
Ian P. Gent, Peter Nightingale, Andrew G. D. Rowle...
AISC
1998
Springer
13 years 8 months ago
Instantiation of Existentially Quantified Variables in Inductive Specification Proofs
Abstract. We present an automatic approach for instantiating existentially quantified variables in inductive specifications proofs. Our approach uses first-order meta-variables in ...
Brigitte Pientka, Christoph Kreitz