260 search results - page 20 / 52 » Merging Belief Bases Represented by Logic Programs |
129
click to vote
ICLP
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. In this paper we consider a logic programming framework for reasoning about imprecise probabilities. In particular, we propose a new semantics, for the Probabilistic Logi...
142
click to vote
PLPV
2009
ACM
15 years 10 months ago
2009
ACM
We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on Martin-L¨of’s intuitionistic ty...
103
click to vote
IJCAI
2001
15 years 3 months ago
2001
Recently, several approaches for updating knowledge bases represented as logic programs have been proposed. In this paper, we present a generic framework for declarative specifica...
107
click to vote
ICLP
1991
Springer
15 years 5 months ago
1991
Springer
Well Founded Semantics is adequate to capture nonmonotonic reasoning if we interpret the Well Founded model of a program P as a (possibly incomplete) view of the world. Thus the W...
101
click to vote
AI
2006
Springer
15 years 2 months ago
2006
Springer
We consider how to forget a set of atoms in a logic program. Intuitively, when a set of atoms is forgotten from a logic program, all atoms in the set should be eliminated from thi...