194 search results - page 22 / 39 » Tabular Constraint-Satisfaction Problems and Answer Set Prog... |
115
click to vote
EC
2008
14 years 12 months ago
2008
The development of successful metaheuristic algorithms such as local search for a difficult problems such as satisfiability testing (SAT) is a challenging task. We investigate an ...
103
click to vote
CORR
2002
Springer
14 years 11 months ago
2002
Springer
In this paper we consider three di erent kinds of domain dependent control knowledge (temporal, procedural and HTN-based) that are useful in planning. Our approach is declarative ...
SAC
2009
ACM
15 years 6 months ago
2009
ACM
In this work, our objective is to heuristically discover a simplified form of functional dependencies between variables called weak dependencies. Once discovered, these relations...
116
click to vote
EDOC
2007
IEEE
15 years 3 months ago
2007
IEEE
The decentralized process of configuring enterprise applications is complex and error-prone, involving multiple participants/roles and numerous configuration changes across multipl...
ICLP
2005
Springer
15 years 5 months ago
2005
Springer
This paper presents experimental comparisons between declarative encodings of various computationally hard problems in both Answer Set Programming (ASP) and Constraint Logic Progra...