1153 search results - page 95 / 231 » The Complexity of Revision, Revised |
KR
2010
Springer
15 years 2 months ago
2010
Springer
If compliance with a norm does not achieve its purpose, then its applicability must dynamically be restricted or expanded. Legal interpretation is a mechanism from law allowing no...
GD
2001
Springer
15 years 2 months ago
2001
Springer
We give a characterization of DFS cotree-critical graphs which is central to the linear time Kuratowski finding algorithm implemented in PIGALE (Public Implementation of a Graph ...
WADS
2001
Springer
15 years 2 months ago
2001
Springer
We show that there exists a linear time algorithm for deciding whether a graph of bounded tree-width has clique-width k for some fixed integer k. Communicated by Giuseppe Liotta ...
140
click to vote
ELPUB
1999
ACM
15 years 2 months ago
1999
ACM
The state-of-the-art of electronic publishing in science and its nearest perspectives with the emphasis on technical issues are discussed. The discussion is based on the real-life...
ECAI
1998
Springer
15 years 2 months ago
1998
Springer
In probabilistics, reasoning at optimum entropy (ME-reasoning) has proved to be a most sound and consistent method for inference. This paper investigates its properties in the fram...