105 search results - page 13 / 21 » Automated Reasoning in Some Local Extensions of Ordered Stru... |
133
click to vote
LPAR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Permutative logic (PL) is a noncommutative variant of multiplicative linear logic (MLL) arising from recent investigations concerning the topology of linear proofs. Permu...
114
Voted
CSL
2001
Springer
15 years 8 months ago
2001
Springer
We show in this paper a special extended logic, partition logic based on so called partition quantifiers, is able to capture some important complexity classes NP, P and NL by its ...
144
click to vote
LICS
2010
IEEE
15 years 1 months ago
2010
IEEE
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...
140
click to vote
CSL
1992
Springer
15 years 8 months ago
1992
Springer
We develop the rst steps of a theory of concurrency within the framework of evolving algebras of Gurevich, with the aim of investigating its suitability for the role of a general f...
150
click to vote
LPAR
2010
Springer
15 years 1 months ago
2010
Springer
Pointer analysis statically approximates the heap pointer structure during a program execution in order to track heap objects or to establish alias relations between references, a...