1485 search results - page 95 / 297 » Whole Program Paths |
CORR
2000
Springer
13 years 9 months ago
2000
Springer
For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded. A new method, easily incorporated in th...
ICLP
2010
Springer
14 years 1 months ago
2010
Springer
We define the Tight Semantics (TS), a new semantics for all NLPs complying with the requirements of: 2-valued semantics; preserving the models of SM; guarantee of model existence...
BMCBI
2004
13 years 9 months ago
2004
Background: All known genomes code for a large number of transcription factors. It is important to develop methods that will reveal how these transcription factors act on a genome...
ILP
2004
Springer
14 years 2 months ago
2004
Springer
For the last ten years a lot of work has been devoted to propositionalization techniques in relational learning. These techniques change the representation of relational problems t...
PLDI
1997
ACM
14 years 1 months ago
1997
ACM
Set-based analysis is a constraint-based whole program analysis that is applicable to functional and objectoriented programming languages. Unfortunately, the analysis is useless f...