460 search results - page 31 / 92 » Revised Stable Models - A Semantics for Logic Programs |
TLDI
2009
ACM
14 years 4 months ago
2009
ACM
We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...
LPNMR
1999
Springer
14 years 2 days ago
1999
Springer
We introduce choice logic programs as negation-free datalog programs that allow rules to have exclusive-only (possibly empty) disjunctions in the head. Such programs naturally mod...
PRICAI
2000
Springer
13 years 11 months ago
2000
Springer
Defeasible logic is a simple but efficient rule-based non-monotonic logic. It has powerful implementations and shows promise to be applied in the areas of legal reasoning and the m...
WLP
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. In this paper we apply answer set programming to solve alternating Boolean equation systems. We develop a novel characterization of solutions for variables in disjunctive...
CORR
2002
Springer
13 years 7 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...