4513 search results - page 252 / 903 » Logic programming with satisfiability |
132
click to vote
ASP
2003
Springer
15 years 9 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 ...
140
click to vote
DAGSTUHL
2003
15 years 5 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...
171
click to vote
AAAI
1996
15 years 5 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...
119
click to vote
ENTCS
2007
15 years 4 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...
135
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
We study logical properties that concern the preservation of futuredirected obligations that have not been fulfilled yet. Our starting point is a product of temporal and deontic ...