499 search results - page 21 / 100 » Logic Programming in a Fragment of Intuitionistic Linear Log... |
133
click to vote
ACTA
2004
15 years 4 months ago
2004
We study the complexity of satisfiability and model-checking of the linear-time temporal logic with past (pltl). More precisely, we consider several fragments of pltl, depending o...
218
click to vote
POPL
2011
ACM
14 years 7 months ago
2011
ACM
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
127
click to vote
LICS
2008
IEEE
15 years 10 months ago
2008
IEEE
We revisit the correctness criterion for the multiplicative additive fragment of linear logic. We prove that deciding the correctness of corresponding proof structures is NLcomple...
128
click to vote
FSTTCS
2004
Springer
15 years 9 months ago
2004
Springer
We present a fragment of separation logic oriented to linked lists, and study decision procedures for validity of entailments. The restrictions in the fragment are motivated by the...
140
click to vote
PADL
2004
Springer
15 years 9 months ago
2004
Springer
Gentzen’s Hauptsatz – cut elimination theorem – in sequent calculi reveals a fundamental property on logic connectives in various logics such as classical logic and intuition...