977 search results - page 65 / 196 » Logic programming with infinite sets |
131
Voted
MICRO
1998
IEEE
15 years 4 months ago
1998
IEEE
To achieve highly accurate branch prediction, it is necessary not only to allocate more resources to branch prediction hardware but also to improve the understanding of branch exe...
119
click to vote
ICLP
1997
Springer
15 years 4 months ago
1997
Springer
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
100
Voted
AICOM
2006
15 years 17 days ago
2006
In this work we present a backjumping technique for Disjunctive Logic Programming (DLP) under the Answer Set Semantics. It builds upon related techniques that had originally been p...
102
click to vote
ICLP
1997
Springer
15 years 4 months ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
102
click to vote
AI
2010
Springer
15 years 19 days ago
2010
Springer
Combining constraints using logical connectives such as disjunction is ubiquitous in constraint programming, because it adds considerable expressive power to a constraint language...