3535 search results - page 88 / 707 » Logic Program Specialisation |
122
Voted
ICALP
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We prove that the boundedness problem for monadic secondorder logic over the class of all finite words is decidable.
132
Voted
SLP
1994
15 years 4 months ago
1994
In this paper we explore the notion of a \signing" of a logic program, in the framework of the answer set semantics. In particular, we generalize and extend the notion of a s...
172
click to vote
AIIA
1995
Springer
15 years 7 months ago
1995
Springer
Genetic Programming (GP) is a method of automatically inducing programs by representing them as parse trees. In theory, programs in any computer languages can be translated to par...
114
click to vote
ICANN
2009
Springer
15 years 10 months ago
2009
Springer
We propose to model human reasoning tasks using completed logic programs interpreted under the three-valued Lukasiewicz semantics. Given an appropriate immediate consequence operat...
168
click to vote
AGP
2010
IEEE
15 years 7 months ago
2010
IEEE
We present an overview of the program transformation techniques which have been proposed over the past twenty-five years in the context of logic programming. We consider the appro...