3671 search results - page 75 / 735 » On Garbage and Program Logic |
230
click to vote
POPL
2006
ACM
16 years 3 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...
132
Voted
ISMVL
2009
IEEE
15 years 10 months ago
2009
IEEE
Determining the equivalence of reversible circuits designed to meet a common specification is considered. The circuits’ primary inputs and outputs must be in pure logic states ...
152
Voted
RTA
2004
Springer
15 years 8 months ago
2004
Springer
Logical systems in natural deduction style are usually presented in the Gentzen style. A different definition of natural deduction, that corresponds more closely to proofs in ord...
131
click to vote
ICALP
1998
Springer
15 years 7 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...
122
click to vote
LPNMR
1999
Springer
15 years 7 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...