Sciweavers

4047 search results - page 117 / 810
» Some Properties and Some Problems on Set Functors
Sort
View
AIEDAM
1999
79views more  AIEDAM 1999»
15 years 4 months ago
An algorithmic approach to knowledge evolution
Intelligent agents must update their knowledge base as they acquire new information about their environment. The modal logic S5n has been designed for representing knowledge bases...
Alessio Lomuscio, Mark Ryan
143
Voted
WG
2005
Springer
15 years 10 months ago
Computation of Chromatic Polynomials Using Triangulations and Clique Trees
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...
Pascal Berthomé, Sylvain Lebresne, Kim Nguy...
ASIAN
2009
Springer
274views Algorithms» more  ASIAN 2009»
15 years 5 months ago
Reducing Equational Theories for the Decision of Static Equivalence
Abstract. Static equivalence is a well established notion of indistinguishability of sequences of terms which is useful in the symbolic analysis of cryptographic protocols. Static ...
Steve Kremer, Antoine Mercier 0002, Ralf Treinen
JUCS
2006
97views more  JUCS 2006»
15 years 4 months ago
Plagiarism - A Survey
: Plagiarism in the sense of "theft of intellectual property" has been around for as long as humans have produced work of art and research. However, easy access to the We...
Hermann A. Maurer, Frank Kappe, Bilal Zaka
118
Voted
AI
2005
Springer
15 years 4 months ago
First order LUB approximations: characterization and algorithms
One of the major approaches to approximation of logical theories is the upper and lower bounds approach introduced in (Selman and Kautz, 1991, 1996). In this paper, we address the...
Alvaro del Val