607 search results - page 7 / 122 » Unifying Exact Completions |
AAAI
1994
14 years 12 months ago
1994
We present a method of representing some classes of default theories as normal logic programs. The main point is that the standard semantics (i.e. SLDNF-resolution) computes answe...
CPC
1998
14 years 10 months ago
1998
We determine the asymptotic behaviour of the number of eulerian circuits in a complete graph of odd order. One corollary of our result is the following. If a maximum random walk, ...
JNW
2007
14 years 10 months ago
2007
— Our research goal is to measure the exact size of the World Wide Web (i.e., a census). The measure we are interested in is the number of publicly accessible web servers on port...
EURODAC
1995
IEEE
15 years 2 months ago
1995
IEEE
The presented fault model uniquely describes all structural changes in the transistor net list that can be caused by spot defects, including faults that connect more than two nets...
ISTA
2004
15 years 1 days ago
2004
: The article proposes a conceptual modeling technique based on Semantically Complete model, the main property of which is that relations carry complete information about interconn...