4328 search results - page 838 / 866 » A New Kind of Science |
133
click to vote
ICLP
1997
Springer
15 years 6 months ago
1997
Springer
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
117
click to vote
RE
1997
Springer
15 years 6 months ago
1997
Springer
The field of requirements engineering emerges out of tradition of research and engineering practice that stresses rtance of generalizations and abstractions. abstraction is essent...
140
click to vote
ICS
2010
Tsinghua U.
15 years 6 months ago
2010
Tsinghua U.
: We study the weight distribution and list-decoding size of Reed-Muller codes. Given a weight parameter, we are interested in bounding the number of Reed-Muller codewords with a w...
110
click to vote
CTRS
1990
15 years 6 months ago
1990
Completion procedures, originated from the seminal work of Knuth and Bendix, are wellknown as procedures for generating confluent rewrite systems, i.e. decision procedures for al ...
PODS
1989
ACM
15 years 6 months ago
1989
ACM
The alternating xpoint of a logic program with negation is de ned constructively. The underlying idea is monotonically to build up a set of negative conclusions until the least xp...