8232 search results - page 94 / 1647 » Dynamic Logic Programming |
221
Voted
POPL
2006
ACM
16 years 2 months ago
2006
ACM
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
124
click to vote
ICALP
1998
Springer
15 years 6 months ago
1998
Springer
The complexity of LTrL, a global linear time temporal logic over traces is investigated. The logic is global because the truth of a formula is evaluated in a global state, also ca...
110
Voted
FCT
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We introduce a uniform framework for reasoning about infinitestate systems with unbounded control structures and unbounded data domains. Our framework is based on constr...
111
click to vote
LPNMR
1999
Springer
15 years 6 months ago
1999
Springer
We introduce choice logic programs as negation-free datalog programs that allow rules to have exclusive-only (possibly empty) disjunctions in the head. Such programs naturally mod...
134
Voted
SIGSOFT
2007
ACM
16 years 3 months ago
2007
ACM
Checkpointing and replaying is an attractive technique that has been used widely at the operating/runtime system level to provide fault tolerance. Applying such a technique at the...