| ||
51. | On the building of affine retractions
MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE Tom 18 Nr 4 r. 2008, str. 753-793 (Artykuł) Aleksy Schubert | |
52. | Strong cut-elimination in sequent calculus using Klop's
iota-translation and perpetual reductions
JOURNAL OF SYMBOLIC LOGIC Tom 73 Nr 3 r. 2008, str. 919-932 (Artykuł) Paweł Urzyczyn, Morten Heine Soerensen | |
53. | The Ackermann Award 2008
LECTURE NOTES IN COMPUTER SCIENCE Tom 5213 r. 2008, str. 508-512 (Artykuł) Johann A. Makowsky, Damian Niwiński | |
54. | Approximating Horn Knowledge Bases in Regular Description Logics to Have PTIME Data Complexity
LECTURE NOTES IN COMPUTER SCIENCE Tom 4670 r. 2007, str. 438-439 (Artykuł konferencyjny) Anh Linh Nguyen | |
55. | Causality Versus True-Concurrency
THEORETICAL COMPUTER SCIENCE Tom 386 r. 2007, str. 169-187 (Artykuł) Sibylle Froeschle, Sławomir Lasota | |
56. | Datatypes in Memory
LECTURE NOTES IN COMPUTER SCIENCE Tom 4624 r. 2007, str. 111-125 (Artykuł konferencyjny) David Aspinall, Piotr Hoffman | |
57. | Diversity and structure of PIF/Harbinger-like elements in the genome of Medicago truncatula
BMC GENOMICS Tom 8 r. 2007, str. 409-409 (Artykuł) D. Grzebelus, Sławomir Lasota, T. Gambin, G. Kucherov, Anna Gambin | |
58. | EXPTIME Tableaux with Global Caching for Description Logics with Transitive Roles, Inverse Roles and Role Hierarchies
LECTURE NOTES IN ARTIFICIAL INTELLIGENCE Tom 4548 r. 2007, str. 133-148 (Artykuł konferencyjny) Rajeev Gore, Anh Linh Nguyen | |
59. | Foundations of Modal Deductive Databases
FUNDAMENTA INFORMATICAE Tom 79 Nr 1 r. 2007, str. 85-135 (Artykuł) Anh Linh Nguyen | |
60. | Immutable Objects for a Java-Like Language
LECTURE NOTES IN COMPUTER SCIENCE Tom 4421 r. 2007, str. 347-362 (Artykuł konferencyjny) Christian Haack, Erik Poll, Jan Schaefer, Aleksy Schubert | |
61. | Reachability in Unions of Commutative Rewriting Systems Is Decidable
LECTURE NOTES IN COMPUTER SCIENCE Tom 4393 r. 2007, str. 622-633 (Artykuł konferencyjny) Piotr Hoffman, Mikołaj Bojańczyk | |
62. | Toward specifications for reconfigurable component systems
LECTURE NOTES IN COMPUTER SCIENCE Tom 4546 r. 2007, str. 24-28 (Artykuł konferencyjny) Andrzej Tarlecki | |
63. | Towards rewriting in Coq
LECTURE NOTES IN COMPUTER SCIENCE Tom 4600 r. 2007, str. 113-131 (Artykuł) Jacek Chrz±szcz, Daria Walukiewicz-Chrz±szcz | |
64. | A Bottom-up Method for the Deterministic Horn Fragment of the Description Logic ALC
LECTURE NOTES IN ARTIFICIAL INTELLIGENCE Tom 4160 r. 2006, str. 346-358 (Artykuł konferencyjny) Anh Linh Nguyen | |
65. | Analyzing stationary states of gene regulatory network using Petri nets
IN SILICO BIOLOGY Tom 6 r. 2006, str. 10-10 (Artykuł) Anna Gambin, Sławomir Lasota, Michal Rutkowski | |
66. | Careful With That Computer: On Creating Maps by Multidimensional Scaling of Papyri in Katja Mueller's Recent Studies on the Topography of the Fayum
THE JOURNAL OF JURISTIC PAPIROLOGY Tom XXXVI r. 2006, str. 67-90 (Artykuł) Piotr Hoffman, Bartosz Klin | |
67. | Causality Versus True-Concurrency
Electronic Notes in Theoretical Computer Science Tom 154 Nr 3 r. 2006, str. 3-18 (Artykuł konferencyjny) Sibylle Froeschle, Sławomir Lasota | |
68. | Consistency and completeness of rewriting in the Calculus of Constructions
LECTURE NOTES IN ARTIFICIAL INTELLIGENCE Tom 4130 r. 2006, str. 619-631 (Artykuł konferencyjny) Jacek Chrz±szcz, Daria Walukiewicz-Chrz±szcz | |
69. | Decidability of Performance Equivalence for Basic Parallel Processes
THEORETICAL COMPUTER SCIENCE Tom 360 r. 2006, str. 172-192 (Artykuł) Sławomir Lasota | |
70. | Faster algorithm for bisimulation equivalence of normed context-free processes
LECTURE NOTES IN COMPUTER SCIENCE Tom 4162 r. 2006, str. 646-657 (Artykuł konferencyjny) Sławomir Lasota, Wojciech Rytter | |
71. | From OBJ to ML to COQ
LECTURE NOTES IN COMPUTER SCIENCE Tom 4060 r. 2006, str. 216-234 (Artykuł) Jacek Chrz±szcz, Jean Jouannaud | |
72. | Horizontal composability revisited
LECTURE NOTES IN COMPUTER SCIENCE Tom 4060 r. 2006, str. 296-316 (Artykuł) Don Sannella, Andrzej Tarlecki | |
73. | Multimodal Logic Programming
THEORETICAL COMPUTER SCIENCE Tom 360 r. 2006, str. 247-288 (Artykuł) Anh Linh Nguyen | |
74. | Negative Ordered Hyper-Resolution as a Proof Procedure for Disjunctive Logic Programming
FUNDAMENTA INFORMATICAE Tom 70 Nr 4 r. 2006, str. 351-366 (Artykuł) Anh Linh Nguyen | |
75. | On the positional determinacy of edge-labeled games
THEORETICAL COMPUTER SCIENCE Tom 352 Nr 3 r. 2006, str. 190-196 (Artykuł) Thomas Colcombet, Damian Niwiński |