5482 search results - page 116 / 1097 » Logic Programming and Databases |
115
Voted
ICALP
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We prove that the boundedness problem for monadic secondorder logic over the class of all finite words is decidable.
125
click to vote
VMCAI
2012
Springer
13 years 10 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...
125
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...
95
Voted
ICDT
1990
ACM
15 years 6 months ago
1990
ACM
Ordinary logical implication is not enough for answering queries in a logic database, since especially negative information is only implicitly represented in the database state. M...