143 search results - page 9 / 29 » Fixed-Parameter Complexity of Semantics for Logic Programs |
ASP
2001
Springer
15 years 2 months ago
2001
Springer
Default Logic and Logic Programming with stable model semantics are recognized as powerful frameworks for incomplete information representation. Their expressive power are suitabl...
CORR
2002
Springer
14 years 9 months ago
2002
Springer
We study xpoints of operators on lattices. To this end we introduce the notion of an approximation of an operator. We order approximations by means of a precision ordering. We sho...
FOIKS
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. Ordered Choice Logic Programming (OCLP) allows for dynamic preference-based decision-making with multiple alternatives without the need for any form of negation. This com...
KR
2004
Springer
15 years 2 months 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...
FOSSACS
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. This paper develops a highly expressive semantic framework for program refinement that supports both temporal reasoning and reasoning about the knowledge of a single agen...