3738 search results - page 102 / 748 » Parametrized Logic Programming |
ICALP
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. We prove that the boundedness problem for monadic secondorder logic over the class of all finite words is decidable.
VMCAI
2012
Springer
12 years 3 months ago
2012
Springer
We describe a course on the semantics of a simple imperative programming language and on applications to compilers, type systems, static analyses and Hoare logic. The course is ent...
SLP
1994
13 years 9 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...
AIIA
1995
Springer
13 years 11 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...
ICANN
2009
Springer
14 years 2 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...