3693 search results - page 257 / 739 » Splitting a Logic Program |
155
Voted
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
We study the definability of constraint satisfaction problems (CSP) in various fixed-point and infinitary logics. We show that testing the solvability of systems of equations over...
140
Voted
ICALP
2000
Springer
15 years 8 months ago
2000
Springer
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
164
click to vote
CLIMA
2004
15 years 6 months ago
2004
In this paper, we present a dynamic logic for a propositional version of the agent programming language 3APL. A 3APL agent has beliefs and a plan. The execution of a plan changes a...
168
Voted
IGPL
2006
15 years 5 months ago
2006
Abstract. This paper addresses the problem of establishing temporal properties of programs written in languages, such as Java, that make extensive use of the heap to allocate-and d...
156
click to vote
OOPSLA
2009
Springer
15 years 11 months ago
2009
Springer
We present Chorus, a high-level parallel programming model suitable for irregular, heap-manipulating applications like mesh refinement and epidemic simulations, and JChorus, an i...