4513 search results - page 761 / 903 » Logic programming with satisfiability |
177
click to vote
PKDD
2007
Springer
16 years 12 days ago
2007
Springer
This paper presents a novel method for multi-relational classification via an aggregation-based Inductive Logic Programming (ILP) approach. We extend the classical ILP representati...
161
click to vote
RR
2007
Springer
16 years 12 days ago
2007
Springer
The well-founded semantics (WFS) for logic programs is one of the few major paradigms for closed-world reasoning. With the advent of the Semantic Web, it is being used as part of r...
153
click to vote
SAS
2007
Springer
16 years 12 days ago
2007
Springer
Existing shape analysis algorithms infer descriptions of data structures at program points, starting from a given precondition. We describe an analysis that does not require any pr...
177
click to vote
TLCA
2007
Springer
16 years 11 days ago
2007
Springer
We propose type systems that abstractly interpret small-step rather than big-step operational semantics. We treat an expression or evaluation context as a structure in a linear log...
133
click to vote
DATE
2006
IEEE
16 years 10 days ago
2006
IEEE
Scheduling is an important step in high-level synthesis (HLS). In our tool, we perform scheduling in two steps: coarse-grain scheduling, in which we take into account the whole co...