10910 search results - page 1953 / 2182 » Input modeling using a computer algebra system |
156
click to vote
ECP
1997
Springer
15 years 8 months ago
1997
Springer
We present a framework for encoding planning problems in logic programs with negation as failure, having computational e ciency as our major consideration. In order to accomplish o...
148
Voted
LFCS
1994
Springer
15 years 8 months ago
1994
Springer
In a previous paper [4], we introduced a non-deterministic -calculus (-LK) whose type system corresponds exactly to Gentzen's cut-free LK [9]. This calculus, however, cannot b...
133
click to vote
DNA
2007
Springer
15 years 8 months ago
2007
Springer
Reliable DNA computing requires a large pool of oligonucleotides that do not produce cross-hybridize. In this paper, we present a transformed algorithm to calculate the maximum wei...
109
click to vote
ICLP
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Bottom-up evaluation is a central part of query evaluation / program execution in deductive databases. It is used after a source code optimization like magic sets or SLDm...
169
click to vote
ATVA
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically bas...