3566 search results - page 247 / 714 » Signed Logic Programs |
136
Voted
ICALP
2007
Springer
15 years 6 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...
115
Voted
ICALP
2000
Springer
15 years 6 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...
135
Voted
CLIMA
2004
15 years 4 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...
148
Voted
IGPL
2006
15 years 2 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...
167
Voted
LICS
1995
IEEE
15 years 6 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...