7892 search results - page 206 / 1579 » Programming with Models |
114
click to vote
ASIAN
1999
Springer
15 years 5 months ago
1999
Springer
Unfold/fold transformation systems for logic programs have been extensively investigated. Existing unfold/fold transformation systems for normal logic programs allow only Tamaki-Sa...
SIAMJO
2008
15 years 1 months ago
2008
We propose a new class of stochastic integer programs whose special features are dominance constraints induced by mixed-integer linear recourse. For these models, we establish clo...
100
click to vote
CCIA
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating...
143
click to vote
ECSQARU
2005
Springer
15 years 7 months ago
2005
Springer
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating as well t...
121
click to vote
LPNMR
2001
Springer
15 years 6 months 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 ...