662 search results - page 6 / 133 » Logic Programming with Ordered Disjunction |
KR
2004
Springer
14 years 24 days ago
2004
Springer
Disjunction is generally considered to add expressive power to logic programs under the stable model semantics, which have become a popular programming paradigm for knowledge repr...
LPKR
1997
Springer
13 years 11 months ago
1997
Springer
In this paper, we use autoepistemic reasoning semantics to classify various semantics for disjunctive logic programs with default negation. We have observed that two different typ...
ASP
2003
Springer
14 years 21 days ago
2003
Springer
Abstract. In general, disjunction is considered to add expressive power to propositional logic programs under stable model semantics, and to enlarge the range of problems which can...
ANOR
2005
13 years 7 months ago
2005
This paper presents a review of advances in the mathematical programming approach to discrete/continuous optimization problems. We first present a brief review of MILP and MINLP f...
LPNMR
2004
Springer
14 years 24 days ago
2004
Springer
Abstract. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and checkâ...