Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
AI
2012
Springer
9 years 9 months ago
Plan recognition in exploratory domains
This paper describes a challenging plan recognition problem that arises in environments in which agents engage widely in exploratory behavior, and presents new algorithms for eff...
Ya'akov Gal, Swapna Reddy, Stuart M. Shieber, Ande...
SIAMCOMP
2010
96views more  SIAMCOMP 2010»
10 years 8 months ago
Quantified Equality Constraints
An equality template (also equality constraint language) is a relational structure with infinite universe whose relations can be defined by boolean combinations of equalities. We ...
Manuel Bodirsky, Hubie Chen
CORR
2010
Springer
136views Education» more  CORR 2010»
10 years 10 months ago
Schaefer's theorem for graphs
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
Manuel Bodirsky, Michael Pinsker
CONSTRAINTS
2010
193views more  CONSTRAINTS 2010»
10 years 10 months ago
Constraint propagation on quadratic constraints
This paper considers constraint propagation methods for continuous constraint satisfaction problems consisting of linear and quadratic constraints. All methods can be applied after...
Ferenc Domes, Arnold Neumaier
EUSFLAT
2009
145views Fuzzy Logic» more  EUSFLAT 2009»
10 years 11 months ago
Valued Constraint Satisfaction Problems Applied to Functional Harmony
Harmonization with four voices is a musical problem which is subject to hard constraints, which absolutely need to be fulfilled, as well as to soft constraints, which preferably ho...
Nele Verbiest, Chris Cornelis, Yvan Saeys
SIAMDM
2010
140views more  SIAMDM 2010»
10 years 11 months ago
Retractions to Pseudoforests
For a fixed graph H, let Ret(H) denote the problem of deciding whether a given input graph is retractable to H. We classify the complexity of Ret(H) when H is a graph (with loops ...
Tomás Feder, Pavol Hell, Peter Jonsson, And...
SAT
2010
Springer
174views Hardware» more  SAT 2010»
10 years 11 months ago
A System for Solving Constraint Satisfaction Problems with SMT
Abstract. SAT Modulo Theories (SMT) consists of deciding the satisfiability of a formula with respect to a decidable background theory, such as linear integer arithmetic, bit-vect...
Miquel Bofill, Josep Suy, Mateu Villaret
SIAMDM
2008
90views more  SIAMDM 2008»
11 years 22 days ago
Maximizing Supermodular Functions on Product Lattices, with Application to Maximum Constraint Satisfaction
Recently, a strong link has been discovered between supermodularity on lattices and tractability of optimization problems known as maximum constraint satisfaction problems. The pre...
Andrei A. Krokhin, Benoit Larose
TEC
2002
163views more  TEC 2002»
11 years 28 days ago
Ants can solve constraint satisfaction problems
In this paper, we describe a new incomplete approach for solving constraint satisfaction problems (CSPs) based on the ant colony optimization (ACO) metaheuristic. The idea is to us...
Christine Solnon
AMAI
1999
Springer
11 years 29 days ago
Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is interesting because it bring advantages of logic prog...
Ilkka Niemelä
books