213 search results - page 15 / 43 » Logic programs with annotated disjunctions |
IJCAI
2007
14 years 11 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...
ASIAN
1999
Springer
15 years 2 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...
105
click to vote
IJCAI
2003
14 years 11 months ago
2003
We consider the problem of updating nonmonotonic knowledge bases represented by epistemic logic programs where disjunctive information and notions of knowledge and beliefs can be ...
CADE
2006
Springer
15 years 10 months ago
2006
Springer
Church's Higher Order Logic is a basis for proof assistants -- HOL and PVS. Church's logic has a simple set-theoretic semantics, making it trustworthy and extensible. We ...
108
click to vote
LPNMR
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. In this paper, we present a logic R for rule bases by introducing a set of rule connectives. We define both the models and extensions of a rule base. The semantics of ex...