7868 search results - page 395 / 1574 » Learning by Answer Sets |
158
click to vote
ICTCS
2005
Springer
16 years 6 days ago
2005
Springer
Given a vertex-weighted graph G = (V, E; w), w(v) ≥ 0 for any v ∈ V , we consider a weighted version of the coloring problem which consists in finding a partition S = (S1, . ...
163
click to vote
TABLEAUX
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. The clause linking technique of Lee and Plaisted proves the unsatisfiability of a set of first-order clauses by generating a sufficiently large set of instances of thes...
195
click to vote
TLCA
2005
Springer
16 years 5 days ago
2005
Springer
This work sets the formal bases for building tools that help retrieve classes in object-oriented libraries. In such systems, the user provides a query, formulated as a set of class...
185
click to vote
ICSE
1997
IEEE-ACM
15 years 11 months ago
1997
IEEE-ACM
By determining, statically, where the structure of a program requires sets of variables to share a common tation, we can identify abstract data types, detect ion violations, find ...
154
click to vote
ACIVS
2008
Springer
15 years 8 months ago
2008
Springer
Several image mosaicing algorithms claiming to advance the state of the art have been proposed so far. Though sometimes improvements can be recognised without quantitative evidence...