8232 search results - page 52 / 1647 » Dynamic Logic Programming |
118
click to vote
FOSSACS
2007
Springer
15 years 8 months ago
2007
Springer
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...
149
click to vote
CORR
1998
Springer
15 years 2 months ago
1998
Springer
In this paper we reexamine the place and role of stable model semantics in logic programming and contrast it with a least Herbrand model approach to Horn programs. We demonstrate ...
147
click to vote
DALT
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We describe a model-checking based approach to verification of programs written in the agent programming language Dribble. We define a logic (an extension of the branch...
143
Voted
FSTTCS
1999
Springer
15 years 6 months ago
1999
Springer
We present a (the rst?) sound and relatively complete Hoare logic for a simple imperative programming language including mutually recursive procedures with call-by-value parameters...
103
Voted
CSL
2003
Springer
15 years 7 months ago
2003
Springer
The semantics of class-based languages can be defined in terms of objects only [8, 7, 1] if classes are viewed as objects with a constructor method. One obtains a store in which m...