| ||
| 1. | Alan Turing and Systems Biology
ERCIM NEWS Tom 2012 Nr 91 r. 2012, str. (Artykuł) Anna Gambin, Anna Marciniak-Czochra, Damian Niwiński | |
| 2. | An extension of data automata that captures XPath
LOGICAL METHODS IN COMPUTER SCIENCE Tom 8 Nr 1 r. 2012, str. (Artykuł) Mikołaj Bojańczyk, Sławomir Lasota | |
| 3. | Tav4SB: integrating tools for analysis of kinetic models of biological systems
BMC SYSTEMS BIOLOGY Tom 6 Nr 1 r. 2012, str. (Artykuł) Anna Gambin, Mikołaj Rybiński, Michał Lula, Sławomir Lasota, Paweł Banasik | |
| 4. | The undecidability of type related problems in the type-free style System F with finitely stratified polymorphic types
INFORMATION AND COMPUTATION Tom 218 r. 2012, str. 69-87 (Artykuł) Ken-etsu Fujita, Aleksy Schubert | |
| 5. | A Cut-Free ExpTime Tableau Decision Procedure for the Description Logic SHI
LECTURE NOTES IN ARTIFICIAL INTELLIGENCE Tom 6922 r. 2011, str. 572-581 (Artykuł konferencyjny) Anh Linh Nguyen | |
| 6. | A Dozen Instructions Make Java Bytecode
Electronic Notes in Theoretical Computer Science Tom 264 r. 2011, str. 19-34 (Artykuł) Patryk Czarnik, Jacek Chrz±szcz, Aleksy Schubert | |
| 7. | Converse-PDL with Regular Inclusion Axioms: A Framework for MAS Logics
JOURNAL OF APPLIED NON-CLASSICAL LOGICS Tom 21 Nr 1 r. 2011, str. 61-81 (Artykuł) Barbara Dunin-Kęplicz, Anh Linh Nguyen, Andrzej Szałas | |
| 8. | Cut-Free ExpTime Tableaux for Checking Satisfiability of a Knowledge Base in the Description Logic ALCI
LECTURE NOTES IN ARTIFICIAL INTELLIGENCE Tom 6804 r. 2011, str. 465-475 (Artykuł konferencyjny) Anh Linh Nguyen | |
| 9. | Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes
LECTURE NOTES IN COMPUTER SCIENCE Tom 6901 r. 2011, str. 528-542 (Artykuł konferencyjny) Wojciech Czerwiński, Piotr Hofman, Sławomir Lasota | |
| 10. | ExpTime Tableau Decision Procedures for Regular Grammar Logics with Converse
STUDIA LOGICA. AN INTERNATIONAL JOURNAL FOR SYMBOLIC LOGIC Tom 98 Nr 3 r. 2011, str. 387-428 (Artykuł) Anh Linh Nguyen, Andrzej Szałas | |
| 11. | Finite Combinatory Logic with Intersection Types
LECTURE NOTES IN COMPUTER SCIENCE Tom 6690 r. 2011, str. 169-183 (Artykuł konferencyjny) Jakob Rehof, Paweł Urzyczyn | |
| 12. | On the Web Ontology Rule Language OWL 2 RL
LECTURE NOTES IN ARTIFICIAL INTELLIGENCE Tom 6922 r. 2011, str. 254-264 (Artykuł konferencyjny) Son Cao, Anh Linh Nguyen, Andrzej Szałas | |
| 13. | Partially-commutative context-free processes: expressibility and tractability
INFORMATION AND COMPUTATION Tom 209 Nr 5 r. 2011, str. 782-798 (Artykuł) Wojciech Czerwiński, Sibylle Froeschle, Sławomir Lasota | |
| 14. | The role of polymorphism in the characterisation of complexity by soft types
LECTURE NOTES IN COMPUTER SCIENCE Tom 6907 r. 2011, str. 219-230 (Artykuł konferencyjny) Jacek Chrz±szcz, Aleksy Schubert | |
| 15. | XPath evaluation in linear time
JOURNAL OF THE ACM Tom 58 Nr 4 r. 2011, str. 17-17 (Artykuł) Paweł Parys, Mikołaj Bojańczyk | |
| 16. | A Syntactic Embedding of Predicate Logic into Second-Order Propositional Logic
NOTRE DAME JOURNAL OF FORMAL LOGIC Tom 51 Nr 4 r. 2010, str. 457-473 (Artykuł) Morten Heine Sorensen, Paweł Urzyczyn | |
| 17. | Checking Consistency of an ABox w.r.t. Global Assumptions in PDL
FUNDAMENTA INFORMATICAE Tom 102 Nr 1 r. 2010, str. 97-113 (Artykuł) Andrzej Szałas, Anh Linh Nguyen | |
| 18. | Choice functions and well-orderings over the infinite binary tree
CENTRAL EUROPEAN JOURNAL OF MATHEMATICS Tom 8 Nr 4 r. 2010, str. 662-682 (Artykuł) Arnaud Carayol, Christof Loding, Damian Niwiński, Igor Walukiewicz | |
| 19. | Inductive Consequences in the Calculus of Constructions
LECTURE NOTES IN COMPUTER SCIENCE Tom 6172 r. 2010, str. 450-465 (Artykuł) Daria Walukiewicz-Chrz±szcz, Jacek Chrz±szcz | |
| 20. | Non-interleaving bisimulation equivalences on Basic Parallel Processes
INFORMATION AND COMPUTATION Tom 208 Nr 1 r. 2010, str. 42-62 (Artykuł) Sibylle B. Fröschle, Petr Jancar, Sławomir Lasota, Zdenek Sawa | |
| 21. | On the Borel Complexity of MSO Definable Sets of Branches
FUNDAMENTA INFORMATICAE Tom 98 Nr 4 r. 2010, str. 337-349 (Artykuł) Mikołaj Bojańczyk, Damian Niwiński, Alexander Rabinovich, Adam Radziwonczyk-Syta, Michał Skrzypczak | |
| 22. | Preface
FUNDAMENTA INFORMATICAE Tom 103 Nr 1-4 r. 2010, str. (Artykuł) Anna Gambin, Damian Niwiński, Paweł Urzyczyn | |
| 23. | Relational Abstract Domain of Weighted Hexagons
Electronic Notes in Theoretical Computer Science Tom 267 Nr 1 r. 2010, str. 59-72 (Artykuł) Jędrzej Fulara, Konrad Durnoga, Krzysztof Jakubczyk, Aleksy Schubert | |
| 24. | Two-way deterministic automata with two reversals are exponentially more succinct than with one reversal
INFORMATION PROCESSING LETTERS Tom 110 Nr 10 r. 2010, str. 396-398 (Artykuł) Marcin Balcerzak, Damian Niwiński | |
| 25. | An Efficient Tableau Prover using Global Caching for the Description Logic ALC
FUNDAMENTA INFORMATICAE Tom 93 r. 2009, str. 273-288 (Artykuł) Anh Linh Nguyen | |