557 search results - page 50 / 112 » Useful Transformations in Answer set programming |
125
click to vote
ASP
2001
Springer
15 years 7 months ago
2001
Springer
Being able to declaratively specify control within a planning (or theorem-proving) paradigm is necessary if we are to build intelligent machines. This paper introduces an implemen...
133
click to vote
DAC
2004
ACM
15 years 8 months ago
2004
ACM
Silicon compilers are often used in conjunction with Field Programmable Gate Arrays (FPGAs) to deliver flexibility, fast prototyping, and accelerated time-to-market. Many of these...
PODS
1989
ACM
15 years 6 months ago
1989
ACM
The alternating xpoint of a logic program with negation is de ned constructively. The underlying idea is monotonically to build up a set of negative conclusions until the least xp...
111
click to vote
PEPM
1994
ACM
15 years 6 months ago
1994
ACM
our results using the Fast Fourier Transformation, the N-body attraction problem, and the cubic splines interpolation as examples.We investigate the application of partial evaluati...
144
click to vote
ASP
2005
Springer
15 years 8 months ago
2005
Springer
Possibilistic Stable model Semantics is an extension of Stable Model Semantics that allows to merge uncertain and non monotonic reasoning into a unique framework. To achieve this a...