4513 search results - page 314 / 903 » Logic programming with satisfiability |
132
click to vote
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...
155
click to vote
CLIMA
2004
15 years 5 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...
165
click to vote
IGPL
2006
15 years 4 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...
180
click to vote
LICS
1995
IEEE
15 years 8 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...
133
click to vote
AAAI
2000
15 years 5 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...