346 search results - page 56 / 70 » Solving quantified constraint satisfaction problems |
146
Voted
CONSTRAINTS
2007
15 years 3 months ago
2007
We give an approximate and often extremely fast method of building a particular kind of portfolio in finance, here called a portfolio design (PD), with applications in the credit ...
139
Voted
ILP
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Logic Programs with Annotated Disjunctions (LPADs) provide a simple and elegant framework for integrating probabilistic reasoning and logic programming. In this paper we ...
165
Voted
ECAI
1992
Springer
15 years 7 months ago
1992
Springer
Constraint satisfaction problems (CSPs) provide a model often used in Artificial Intelligence. Since the problem of the existence of a solution in a CSP is an NP-complete task, man...
151
Voted
CSCLP
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
131
Voted
AI
1998
Springer
15 years 7 months ago
1998
Springer
Abstract. The general timetabling problem is an assignment of activities to xed time intervals, adhering to a prede ned set of resource availabilities. Timetabling problems are di ...