977 search results - page 6 / 196 » Logic programming with infinite sets |
CADE
2009
Springer
16 years 29 days ago
2009
Springer
Abstract. In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarant...
119
click to vote
CSL
2007
Springer
15 years 4 months ago
2007
Springer
We give a new proof showing that it is not possible to define in monadic second-order logic (MSO) a choice function on the infinite binary tree. This result was first obtained by G...
116
click to vote
FSTTCS
2010
Springer
14 years 10 months ago
2010
Springer
This paper focuses on first-order logic (FO) extended by reachability predicates such that the expressiveness and hence decidability properties lie between FO and monadic second-o...
108
Voted
IJCAI
1997
15 years 1 months ago
1997
In the paper, we consider the problem of supporting automated reasoning in a large class of knowledge representation formalisms, including terminological and epistemic logics, who...
103
click to vote
ECAI
2006
Springer
15 years 4 months ago
2006
Springer
An often problematic feature in answer set programming is that a program does not always produce an answer set, even for programs which represent default information in a seemingl...