977 search results - page 3 / 196 » Logic programming with infinite sets |
134
Voted
LOPSTR
2009
Springer
15 years 4 months ago
2009
Springer
Answer Set Programming (ASP) is a powerful paradigm of logic programming for non-monotonic reasoning. However, the restriction of “grounded range-restricted function-free normal ...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
80
Voted
SIGSOFT
2005
ACM
15 years 11 months ago
2005
ACM
We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when us...
73
Voted
ESOP
2000
Springer
15 years 1 months ago
2000
Springer
In order to deal efficiently with infinite regular trees (or other pointed graph structures), we give new algorithms to store such structures. The trees are stored in such a way th...
109
Voted
ITA
2007
14 years 10 months ago
2007
Abstract. Various static analyses of functional programming languages that permit infinite data structures make use of set constants like Top, Inf, and Bot, denoting all terms, al...