Sciweavers

3566 search results - page 203 / 714
» Signed Logic Programs
Sort
View
ASP
2003
Springer
15 years 4 months ago
Properties of maximal cliques of a pair-wise compatibility graph for three nonmonotonic reasoning system
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 ...
Robert E. Mercer, Vincent Risch
DAGSTUHL
2003
15 years 26 days ago
Query Answering in Inconsistent Databases
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...
Leopoldo E. Bertossi, Jan Chomicki
AAAI
1996
15 years 25 days ago
Splitting a Default Theory
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...
Hudson Turner
ENTCS
2007
104views more  ENTCS 2007»
14 years 11 months ago
Lazy Context Cloning for Non-Deterministic Graph Rewriting
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...
Sergio Antoy, Daniel W. Brown, Su-Hui Chiang
IADIS
2003
15 years 26 days ago
The Semantic + Pragmatic Web = The Semiotic Web
The desideratum for the concept of a semiotic web is proposed. It combines both the recent semantic web and the pragmatic web initiatives but surpasses them in being faithful to C...
Ahti-Veikko Pietarinen