133
click to vote
LICS
15 years 6 months ago
2008 IEEE 
We introduce a systematic procedure to transform large classes of (Hilbert) axioms into equivalent inference rules in sequent and hypersequent calculi. This allows for the automat...
110
Voted
LICS
15 years 6 months ago
2008 IEEE 
Collapsible pushdown automata (CPDA) are a new kind of higher-order pushdown automata in which every symbol in the stack has a link to a stack situated somewhere below it. In addi...
99
Voted
LICS
15 years 6 months ago
2008 IEEE 
We present a syntax for MALL (multiplicative additive linear logic without units) proof nets which refines Girard’s one. It is also based on the use of monomial weights for ide...
96
Voted
LICS
15 years 6 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...
110
click to vote
LICS
15 years 6 months ago
2008 IEEE
Separation logic involves two dual forms of modularity: local reasoning makes part of the store invisible within a static scope, whereas hiding local state makes part of the store...
|
Automated Reasoning