1144 search results - page 36 / 229 » Logic programming for combinatorial problems |
NMR
2004
Springer
14 years 1 months ago
2004
Springer
We develop an Answer Set Programming formalism based on Default Logic. We show that computing generating sets of extensions in this formalism captures all ΣP 2 search problems.
AAAI
1990
13 years 8 months ago
1990
We present a strategy for restricting the application of the inference rule paramodulation. The strategy applies to problems in first-order logic with equality and is designed to ...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
We consider a wireless network comprising a number of mutuallyinterfering links. We study the transmit power control problem that determines the egalitarian signal-to-interference...
SUM
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Action-probabilistic logic programs (ap-programs), a class of probabilistic logic programs, have been applied during the last few years for modeling behaviors of entities...
IANDC
2006
13 years 7 months ago
2006
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...