1144 search results - page 44 / 229 » Logic programming for combinatorial problems |
CCL
1994
Springer
13 years 11 months ago
1994
Springer
Abstract: This paper describes the application of CLP (constraint logic programming) to several digital circuit design problems. It is shown that logic programming together with ef...
IEEESCC
2005
IEEE
14 years 1 months ago
2005
IEEE
This paper presents Abacus, a service-oriented programming language designed for the development of grid applications. Abacus considers that all the grid resources constitute a un...
ICLP
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Pruning operators, such as cut, are important to develop efficient logic programs as they allow programmers to reduce the search space and thus discard unnecessary compu...
LPNMR
2001
Springer
14 years 4 days ago
2001
Springer
Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class ...
ICLP
2007
Springer
14 years 1 months ago
2007
Springer
We propose a novel technique that maps decision problems in WS1S (weak monadic second-order logic with n successors) to the problem of query evaluation of Complex-value Datalog que...