3693 search results - page 84 / 739 » Splitting a Logic Program |
ICALP
2009
Springer
14 years 1 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 4 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...
PPAM
2007
Springer
14 years 3 months ago
2007
Springer
There are several parallel programming models available for numerical computations at diļ¬erent levels of expressibility and ease of use. For the development of new domain speciļ¬...
CPAIOR
2010
Springer
14 years 2 months ago
2010
Springer
We present a new method to compute upper bounds of the number of solutions of binary integer programming (BIP) problems. Given a BIP, we create a dynamic programming (DP) table for...
SLP
1994
13 years 10 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...