1179 search results - page 226 / 236 » Programming in Hybrid Constraint Languages |
CP
2005
Springer
14 years 1 months ago
2005
Springer
QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...
EDCC
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We present the PathCrawler prototype tool for the automatic generation of test-cases satisfying the rigorous all-paths criterion, with a user-defined limit on the number...
IFIP
2004
Springer
14 years 29 days ago
2004
Springer
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
KI
2004
Springer
14 years 28 days ago
2004
Springer
Abstract. We aim to demonstrate that automated deduction techniques, in particular those following the model computation paradigm, are very well suited for database schema/query re...
ATAL
2003
Springer
14 years 25 days ago
2003
Springer
Abstract. In this paper, we consider the process algebra ACPL, which models the basics of agent communication. This algebra combines the informationprocessing aspects of Concurrent...