Sciweavers

12745 search results - page 2426 / 2549
» Automating test automation
Sort
View
117
Voted
KR
2004
Springer
15 years 9 months ago
Historical Remarks on Nonmonotonic Reasoning, Especially Circumscription
Humans have always done nonmonotonic reasoning, but rigorous monotonic reasoning in reaching given conclusions has been deservedly more respected and admired. Euclid contains the ...
John McCarthy
147
Voted
KR
2004
Springer
15 years 9 months ago
A Split-Combination Method for Merging Inconsistent Possibilistic Knowledge Bases
In this paper, a new method for merging multiple inconsistent knowledge bases in the framework of possibilistic logic is presented. We divide the fusion process into two steps: on...
Guilin Qi, Weiru Liu, David H. Glass
133
Voted
LOPSTR
2004
Springer
15 years 9 months ago
A Generic Framework for Context-Sensitive Analysis of Modular Programs
Abstract. Context-sensitive analysis provides information which is potentially more accurate than that provided by context-free analysis. Such information can then be applied in or...
Germán Puebla, Jesús Correas, Manuel...
LPAR
2004
Springer
15 years 9 months ago
Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
Dietmar Berwanger, Erich Grädel
122
Voted
MATES
2004
Springer
15 years 9 months ago
Paraconsistent Assertions
Classical logic predicts that everything (thus nothing useful at all) follows from inconsistency. A paraconsistent logic is a logic where inconsistency does not lead to such an exp...
Jørgen Villadsen
« Prev « First page 2426 / 2549 Last » Next »