Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLogical Methods in Computer Science, Volume 2
Volume 2, Number 1, 2006
- Paul Taylor:
Computably Based Locally Compact Spaces. - Antonín Kucera
, Javier Esparza, Richard Mayr:
Model Checking Probabilistic Pushdown Automata. - Phuong Nguyen, Stephen A. Cook:
Theories for TC0 and Other Small Complexity Classes. - Vineet Gupta, Radha Jagadeesan, Prakash Panangaden:
Approximate reasoning for real-time probabilistic processes. - Willem Conradie, Valentin Goranko, Dimiter Vakarelov:
Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA. - Brijesh Dongol, Doug Goldson:
Extending the theory of Owicki and Gries with a logic of progress.
Volume 2, Number 2, 2006
- Kristian Støvring:
Extending the Extensional Lambda Calculus with Surjective Pairing is Conservative. - Bruno Courcelle:
The monadic second-order logic of graphs XVI : Canonical graph decompositions. - Daniel Hirschkoff, Étienne Lozes, Davide Sangiorgi:
On the Expressiveness of the Ambient Logic. - Alwen Tiu:
A System of Interaction and Structure II: The Need for Deep Inference. - Carsten Lutz, Frank Wolter:
Modal Logics of Topological Relations. - Arnaud Carayol, Antoine Meyer:
Context-Sensitive Languages, Rational Graphs and Determinism.
Volume 2, Number 3, 2006
- Frank Neven, Thomas Schwentick:
On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. - Leonid Libkin:
Logics for Unranked Trees: An Overview. - Masahito Hasegawa:
Relational Parametricity and Control. - Naoki Kobayashi, Kohei Suenaga, Lucian Wischik:
Resource Usage Analysis for the p-Calculus. - Tamara Babaian, James G. Schmolze:
Efficient Open World Reasoning for Planning. - Solomon Feferman:
Tarski's influence on computer science.
Volume 2, Number 4, 2006
- Víctor Dalmau:
Generalized Majority-Minority Operations are Tractable. - Le-Chi Tuan, Chitta Baral, Tran Cao Son:
A State-Based Regression Formulation for Domains with Sensing Actions and Incomplete Information. - François Lamarche, Lutz Straßburger:
From Proof Nets to the Free *-Autonomous Category. - Jeremy Avigad, Harvey Friedman:
Combining decision procedures for the reals. - Benedetto Intrigila, Richard Statman:
Solution of a Problem of Barendregt on Sensible lambda-Theories. - Erich Grädel, Igor Walukiewicz:
Positional Determinacy of Games with Infinitely Many Priorities.
Volume 2, Number 5, 2006
- Lars Birkedal, Noah Torp-Smith, Hongseok Yang:
Semantics of Separation-Logic Typing and Higher-order Frame Rules for Algol-like Languages. - Lars Birkedal, Rasmus Ejlers Møgelberg, Rasmus Lerchedahl Petersen:
Linear Abadi and Plotkin Logic. - Jean H. Gallier:
The Completeness of Propositional Resolution: A Simple and Constructive Proof. - Jirí Adámek, Stefan Milius, Jirí Velebil:
Elgot Algebras. - Armin Biere, Keijo Heljanko, Tommi A. Junttila, Timo Latvala, Viktor Schuppan:
Linear Encodings of Bounded LTL Model Checking.
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 20:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
