93 search results - page 11 / 19 » From Disjunctive Programs to Abduction |
IJCAI
2007
13 years 8 months ago
2007
The definition of a stable model has provided a declarative semantics for Prolog programs with negation as failure and has led to the development of answer set programming. In th...
TCS
2010
13 years 5 months ago
2010
The refinement calculus of Back, Morgan, Morris, and others is based on monotone predicate transformers (weakest preconditions) where conjunctions stand for demonic choices betwee...
ASP
2005
Springer
14 years 19 days ago
2005
Springer
This paper studies compositional semantics of nonmonotonic logic programs. We suppose the answer set semantics of extended disjunctive programs and consider the following problem. ...
LPNMR
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. We study the complexity of consistency checking and query answering on incomplete databases for languages ranging from non-recursive Datalog to disjunctive Datalog with n...
MPC
1992
Springer
13 years 11 months ago
1992
Springer
A calculus for developing programs from specifications written as predicates that describe the relationship between the initial and final state is proposed. Such specifications are...