977 search results - page 26 / 196 » Logic programming with infinite sets |
72
Voted
CORR
2010
Springer
15 years 16 days ago
2010
Springer
In our paper "Uniformity and the Taylor expansion of ordinary lambda-terms" (with Laurent Regnier), we studied a translation of lambda-terms as infinite linear combinati...
103
click to vote
ECAI
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. We describe an approach for compiling dynamic preferences into logic programs under the answer set semantics. An ordered logic program is an extended logic program in whi...
115
Voted
CSL
2010
Springer
15 years 1 months ago
2010
Springer
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
134
Voted
JAPLL
2007
15 years 10 days ago
2007
We extend answer set programming (ASP) with, possibly infinite, open domains. Since this leads to undecidable reasoning, we restrict the syntax of programs, while carefully guard...
98
Voted
JUCS
2008
15 years 12 days ago
2008
: In the representation approach to computable analysis (TTE) [Grz55, i00], abstract data like rational numbers, real numbers, compact sets or continuous real functions are represe...