2410 search results - page 33 / 482 » Multiset Ordering Constraints |
133
click to vote
ESOP
2009
Springer
15 years 8 months ago
2009
Springer
This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operatio...
145
click to vote
AAAI
1994
15 years 5 months ago
1994
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...
194
click to vote
PTS
2010
15 years 2 months ago
2010
We present a novel algorithm for test data generation that is based on techniques used in formal software verification. Prominent examples of such formal techniques are symbolic ex...
132
click to vote
CSCLP
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We propose to use bilattice as a constraint valuation structure in order to represent truth and belief at the same time. A bilattice is a set which owns two lattices orde...
242
click to vote
ICDE
2002
IEEE
16 years 5 months ago
2002
IEEE
Difference, intersection, semi-join and anti-semi-join may be considered binary subset operators, in that they all return a subset of their left-hand argument. These operators are...