4370 search results - page 294 / 874 » Algebra of Logic Programming |
134
click to vote
TYPES
1995
Springer
15 years 4 months ago
1995
Springer
Natural Deduction style presentations of program logics are useful in view of the implementation of such logics in interactive proof development environments, based on type theory,...
104
Voted
ASP
2003
Springer
15 years 6 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 ...
116
click to vote
DAGSTUHL
2003
15 years 2 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...
138
Voted
AAAI
1996
15 years 2 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...
91
Voted
ENTCS
2007
15 years 21 days 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...