8232 search results - page 399 / 1647 » Dynamic Logic Programming |
190
click to vote
ICALP
2007
Springer
15 years 10 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...
180
Voted
ICALP
2000
Springer
15 years 10 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...
208
click to vote
IGPL
2006
15 years 6 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...
223
click to vote
LICS
1995
IEEE
15 years 10 months ago
1995
IEEE
We present new proofs of cut elimination for intuitionistic, classical, and linear sequent calculi. In all cases the proofs proceed by three nested structural inductions, avoiding...
184
click to vote
AAAI
2000
15 years 8 months ago
2000
The task of generating minimal models of a knowledge base is a significant computational problem in artificial intelligence. This task is at the computational heart of diagnosis s...