4192 search results - page 252 / 839 » Probabilistic Logic Programming |
166
click to vote
ASP
2003
Springer
15 years 11 months ago
2003
Springer
In this paper we define the notion of a compatibility relation so as to have a common framework for three nonmonotonic reasoning systems: normal logic programming, extended logic ...
185
click to vote
DAGSTUHL
2003
15 years 8 months ago
2003
In this chapter, we summarize the research on querying inconsistent databases we have been conducting over the last five years. The formal framework we have used is based on two c...
214
click to vote
AAAI
1996
15 years 7 months ago
1996
This paper presents mathematical results that can sometimes be used to simplify the task of reasoning about a default theory, by \splitting it into parts." These so-called Sp...
166
click to vote
ENTCS
2007
15 years 6 months ago
2007
We define a rewrite strategy for a class of non-confluent constructor-based term graph rewriting systems and discuss its correctness. Our strategy and its extension to narrowing...
207
click to vote
AGENTS
2001
Springer
15 years 11 months ago
2001
Springer
Agents are intended to interact in open systems where the knowledge about others (reputation) is incomplete and uncertain. Also, this knowledge about other agents is subjective si...