| ||
| 1. | Alan Turing and Systems Biology
ERCIM NEWS Vol. 2012 Nr 91 yr. 2012, pp. (Article) Anna Gambin, Anna Marciniak-Czochra, Damian Niwiński | |
| 2. | An extension of data automata that captures XPath
LOGICAL METHODS IN COMPUTER SCIENCE Vol. 8 Nr 1 yr. 2012, pp. (Article) Mikołaj Bojańczyk, Sławomir Lasota | |
| 3. | Tav4SB: integrating tools for analysis of kinetic models of biological systems
BMC SYSTEMS BIOLOGY Vol. 6 Nr 1 yr. 2012, pp. (Article) 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 Vol. 218 yr. 2012, pp. 69-87 (Article) Ken-etsu Fujita, Aleksy Schubert | |
| 5. | A Cut-Free ExpTime Tableau Decision Procedure for the Description Logic SHI
LECTURE NOTES IN ARTIFICIAL INTELLIGENCE Vol. 6922 yr. 2011, pp. 572-581 (Conference article) Anh Linh Nguyen | |
| 6. | A Dozen Instructions Make Java Bytecode
Electronic Notes in Theoretical Computer Science Vol. 264 yr. 2011, pp. 19-34 (Article) 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 Vol. 21 Nr 1 yr. 2011, pp. 61-81 (Article) 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 Vol. 6804 yr. 2011, pp. 465-475 (Conference article) Anh Linh Nguyen | |
| 9. | Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes
LECTURE NOTES IN COMPUTER SCIENCE Vol. 6901 yr. 2011, pp. 528-542 (Conference article) 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 Vol. 98 Nr 3 yr. 2011, pp. 387-428 (Article) Anh Linh Nguyen, Andrzej Szałas | |
| 11. | Finite Combinatory Logic with Intersection Types
LECTURE NOTES IN COMPUTER SCIENCE Vol. 6690 yr. 2011, pp. 169-183 (Conference article) Jakob Rehof, Paweł Urzyczyn | |
| 12. | On the Web Ontology Rule Language OWL 2 RL
LECTURE NOTES IN ARTIFICIAL INTELLIGENCE Vol. 6922 yr. 2011, pp. 254-264 (Conference article) Son Cao, Anh Linh Nguyen, Andrzej Szałas | |
| 13. | Partially-commutative context-free processes: expressibility and tractability
INFORMATION AND COMPUTATION Vol. 209 Nr 5 yr. 2011, pp. 782-798 (Article) 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 Vol. 6907 yr. 2011, pp. 219-230 (Conference article) Jacek Chrz±szcz, Aleksy Schubert | |
| 15. | XPath evaluation in linear time
JOURNAL OF THE ACM Vol. 58 Nr 4 yr. 2011, pp. 17-17 (Article) Paweł Parys, Mikołaj Bojańczyk | |
| 16. | A Syntactic Embedding of Predicate Logic into Second-Order Propositional Logic
NOTRE DAME JOURNAL OF FORMAL LOGIC Vol. 51 Nr 4 yr. 2010, pp. 457-473 (Article) Morten Heine Sorensen, Paweł Urzyczyn | |
| 17. | Checking Consistency of an ABox w.r.t. Global Assumptions in PDL
FUNDAMENTA INFORMATICAE Vol. 102 Nr 1 yr. 2010, pp. 97-113 (Article) Andrzej Szałas, Anh Linh Nguyen | |
| 18. | Choice functions and well-orderings over the infinite binary tree
CENTRAL EUROPEAN JOURNAL OF MATHEMATICS Vol. 8 Nr 4 yr. 2010, pp. 662-682 (Article) Arnaud Carayol, Christof Loding, Damian Niwiński, Igor Walukiewicz | |
| 19. | Inductive Consequences in the Calculus of Constructions
LECTURE NOTES IN COMPUTER SCIENCE Vol. 6172 yr. 2010, pp. 450-465 (Article) Daria Walukiewicz-Chrz±szcz, Jacek Chrz±szcz | |
| 20. | Non-interleaving bisimulation equivalences on Basic Parallel Processes
INFORMATION AND COMPUTATION Vol. 208 Nr 1 yr. 2010, pp. 42-62 (Article) Sibylle B. Fröschle, Petr Jancar, Sławomir Lasota, Zdenek Sawa | |
| 21. | On the Borel Complexity of MSO Definable Sets of Branches
FUNDAMENTA INFORMATICAE Vol. 98 Nr 4 yr. 2010, pp. 337-349 (Article) Mikołaj Bojańczyk, Damian Niwiński, Alexander Rabinovich, Adam Radziwonczyk-Syta, Michał Skrzypczak | |
| 22. | Preface
FUNDAMENTA INFORMATICAE Vol. 103 Nr 1-4 yr. 2010, pp. (Article) Anna Gambin, Damian Niwiński, Paweł Urzyczyn | |
| 23. | Relational Abstract Domain of Weighted Hexagons
Electronic Notes in Theoretical Computer Science Vol. 267 Nr 1 yr. 2010, pp. 59-72 (Article) 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 Vol. 110 Nr 10 yr. 2010, pp. 396-398 (Article) Marcin Balcerzak, Damian Niwiński | |
| 25. | An Efficient Tableau Prover using Global Caching for the Description Logic ALC
FUNDAMENTA INFORMATICAE Vol. 93 yr. 2009, pp. 273-288 (Article) Anh Linh Nguyen | |