Nie jesteś zalogowany | Zaloguj się

Czasopismo: FUNDAMENTA INFORMATICAE

Liczba publikacji: 98

2024

Uli Fahrenberg, Krzysztof Ziemiański , Myhill-Nerode Theorem for Higher-Dimensional Automata, FUNDAMENTA INFORMATICAE, 192 (3-4) 2024, s. 219-259. Zobacz w PBN

2023

David Barozzini, Lorenzo Clemente , Thomas Colcombet, Paweł Parys , Cost Automata, Safe Schemes, and Downward Closures, FUNDAMENTA INFORMATICAE, 188 (3) 2023, s. 127-178. Zobacz w PBN

2022

Olivier Finkel, Michał Skrzypczak , On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words, FUNDAMENTA INFORMATICAE, 183 (3-4) 2022, s. 243-291. Zobacz w PBN

2021

Piotr Hofman , Michał Skrzypczak , Preface, FUNDAMENTA INFORMATICAE, 180 (4) 2021, s. i-ii. Zobacz w PBN
Dominik Ślęzak , Tzung-Pei Hong, Leon S.L. Wang, Preface: Information Granulation in Data Science and Scalable Computing, FUNDAMENTA INFORMATICAE, 182 (2) 2021, s. i-ii. Zobacz w PBN

2020

Eryk Kopczyński , Axiomatizing Rectangular Grids with no Extra Non-unary Relations, FUNDAMENTA INFORMATICAE, 176 (2) 2020, s. 129-138. Zobacz w PBN

2019

Marcin Michalak, Dominik Ślęzak , On boolean representation of continuous data biclustering, FUNDAMENTA INFORMATICAE, 167 (3) 2019, s. 193-217. Zobacz w PBN

2018

Anna Gambin , Monika Heiner, Advances in Biological processes and Petri nets (BioPPN) Preface, FUNDAMENTA INFORMATICAE, 160 (1-2) 2018, s. v-vii. Zobacz w PBN
Marcin Michalak, Dominik Ślęzak , Boolean representation for exact biclustering, FUNDAMENTA INFORMATICAE, 161 (3) 2018, s. 275-297. Zobacz w PBN
Anh Linh Nguyen , Computing Bisimulation-Based Comparisons, FUNDAMENTA INFORMATICAE, 157 (4) 2018, s. 385-401. Zobacz w PBN
Szymon Grabowski, Tomasz Kociumaka, Jakub Radoszewski , On Abelian Longest Common Factor with and without RLE, FUNDAMENTA INFORMATICAE, 2018. Zobacz w PBN
Grzegorz Bokota , Marek Grabowski, Andrzej M. Kierzek, Jacek Sroka , Verification of Dynamic Behaviour in Qualitative Molecular Networks Describing Gene Regulation, Signalling and Whole-cell Metabolism, FUNDAMENTA INFORMATICAE, 160 (1-2) 2018, s. 199-219. Zobacz w PBN

2017

Eryk Kopczyński , Computational Complexity on the Blackboard, FUNDAMENTA INFORMATICAE, 152 (4) 2017, s. 323-339. Zobacz w PBN
Damian Niwiński , Stella Orłowska, Helena Rasiowa's Heritage in Mathematical Logic, FUNDAMENTA INFORMATICAE, 156 (3-4) 2017, s. i-ii. Zobacz w PBN
Mikołaj Bojańczyk , It is Undecidable if Two Regular Tree Languages can be Separated by a Deterministic Tree-walking Automaton, FUNDAMENTA INFORMATICAE, 154 (1-4) 2017, s. 37-46. Zobacz w PBN
Jan Hidders, Jacek Sroka , On Determining the AND-OR Hierarchy in Workflow Nets, FUNDAMENTA INFORMATICAE, 156 (1) 2017, s. 95-123. Zobacz w PBN

2016

Anh Linh Nguyen , A Tractable Rule Language in the Modal and Description Logic that Combines CPDL with Regular Grammar Logic, FUNDAMENTA INFORMATICAE, 2016. Zobacz w PBN
Anh Linh Nguyen , ExpTime Tableaux with Global Caching for Graded Propositional Dynamic Logic, FUNDAMENTA INFORMATICAE, 2016. Zobacz w PBN
Davide Ciucci, Marcin Wolski, Dominik Ślęzak , Preface, FUNDAMENTA INFORMATICAE, 2016. Zobacz w PBN
Ludwik Czaja, Wojciech Penczek, Krzysztof Stencel , Preface, FUNDAMENTA INFORMATICAE, 2016. Zobacz w PBN
Ludwik Czaja, Wojciech Penczek, Krzysztof Stencel , Preface, FUNDAMENTA INFORMATICAE, 2016. Zobacz w PBN
Chris Cornelis, Hung Son Nguyen , Sankar K. Pal, Andrzej Skowron, Wei-Zhi Wu, Preface: Special issue on rough sets and fuzzy sets, FUNDAMENTA INFORMATICAE, 2016. Zobacz w PBN

2015

Robert Dąbrowski, Wojciech Plandowski , Complete characterization of zero-expressible functions, FUNDAMENTA INFORMATICAE, 138 (3) 2015, s. 339-350. Zobacz w PBN
Wojciech Czerwiński , Tomasz Gogacz, Eryk Kopczyński , Non-dominating Sequences of Vectors Using only Resets and Increments, FUNDAMENTA INFORMATICAE, 2015. Zobacz w PBN
Konrad Durnoga, Bartosz Źrałek , On Computing Discrete Logarithms in Bulk and Randomness Extractors, FUNDAMENTA INFORMATICAE, 2015. Zobacz w PBN
Piotr Chrząstowski-Wachtel, Jan Hidders, Jacek Sroka , On Generating Hierarchical Workflow Nets and their Extensions and Verifying Hierarchicality, FUNDAMENTA INFORMATICAE, 2015. Zobacz w PBN
William Kwok-Wai Cheung, Benjamin C. M. Fung, Dominik Ślęzak , Preface, FUNDAMENTA INFORMATICAE, 2015. Zobacz w PBN
Michał Meina, Hung Son Nguyen , Search Result Clustering Based on Query Context., FUNDAMENTA INFORMATICAE, 2015. Zobacz w PBN

2014

Krzysztof Kaczmarski, Piotr Przymus, Krzysztof Stencel , A Bi-objective Optimization Framework for Heterogeneous CPU/GPU Query Plans, FUNDAMENTA INFORMATICAE, 2014. Zobacz w PBN
Joanna Golińska-Pilarek, Anh Linh Nguyen , An ExpTime Tableau Method for Dealing with Nominals and Qualified Number Restrictions in Deciding the Description Logic SHOQ, FUNDAMENTA INFORMATICAE, 2014. Zobacz w PBN
Quang-Thuy Ha, Thi-Lan-Giao Hoang, Anh Linh Nguyen , Hung Son Nguyen , Thanh-Luong Tran, Bisimulation-Based Concept Learning in Description Logics, FUNDAMENTA INFORMATICAE, 2014. Zobacz w PBN
Andrzej Janusz , Hung Son Nguyen , Adam Krasuski, Wojciech Świeboda, Interactive Method for Semantic Document Indexing Based on Explicit Semantic Analysis, FUNDAMENTA INFORMATICAE, 132 (3) 2014, s. 423-438. Zobacz w PBN
Hongmei Chen, Tianrui Li, Hung Son Nguyen , Jingtao Yao, Preface: Special Issue in Advances on Rough Sets and Knowledge Technology, FUNDAMENTA INFORMATICAE, 2014. Zobacz w PBN
Hung Son Nguyen , Chi Mai Luong, Piuri Vincenzo, Preface: Special Issue in Computing and Communication Technologies., FUNDAMENTA INFORMATICAE, 130 (2) 2014. Zobacz w PBN
Krzysztof Stencel , Piotr Wiśniewski, Universal Query Language for Unified State Model, FUNDAMENTA INFORMATICAE, 2014. Zobacz w PBN

2013

Hung Son Nguyen , Thi sinh hoa Nguyen, Tuan Nguyen, Marcin Szczuka, An Approach to Pattern Recognition Based on Hierarchical Granular Computing, FUNDAMENTA INFORMATICAE, 2013. Zobacz w PBN
Patrick Doherty, Andrzej Szałas , Automated Generation of Logical Constraints on Approximation Spaces Using Quantifier Elimination, FUNDAMENTA INFORMATICAE, 2013. Zobacz w PBN
Hung Son Nguyen , Gloria Virginia, Lexicon-based Document Representation,, FUNDAMENTA INFORMATICAE, 124 (1,2) 2013, s. 27-46. Zobacz w PBN
Robert Dąbrowski, Krzysztof Stencel , Grzegorz Timoszuk, One Graph to Rule Them All Software Measurement and Management, FUNDAMENTA INFORMATICAE, Vol. 128, nr 1-2 2013, s. 67-63. Zobacz w PBN
Hung Son Nguyen , Andrzej Skowron, Guoyin Wang, Jingtao Yao, Preface, FUNDAMENTA INFORMATICAE, 2013. Zobacz w PBN
Jacek Sroka , Jan Van den Bussche, Jan Hidders, Paolo Missier, Preface, FUNDAMENTA INFORMATICAE, 128 (3) 2013. Zobacz w PBN
Jan Van den Bussche, Jan Hidders, Paolo Missier, Jacek Sroka , Preface, FUNDAMENTA INFORMATICAE, 2013. Zobacz w PBN
Dominik Ślęzak , Marcin Szczuka, Hung Son Nguyen , Preface, FUNDAMENTA INFORMATICAE, 2013. Zobacz w PBN
Piotr Synak, A. Wojna, Jakub Wróblewski, Dominik Ślęzak , Two Database Related Interpretations of Rough Approximations: Data Organization and Query Execution, FUNDAMENTA INFORMATICAE, 2013. Zobacz w PBN

2012

M. Burzańska, Krzysztof Stencel , P. Wiśniewski, The Impedance Mismatch in Light of the Unified State Model, FUNDAMENTA INFORMATICAE, 2012. Zobacz w PBN
Szczepan Hummel, Michał Skrzypczak , The Topological Complexity of MSO+U and Related Automata Models, FUNDAMENTA INFORMATICAE, 2012. Zobacz w PBN
Andrzej Janusz , Hung Son Nguyen , Dominik Ślęzak , Unsupervised Similarity Learning from Textual Data, FUNDAMENTA INFORMATICAE, 2012. Zobacz w PBN
Paweł Leszczyński, Krzysztof Stencel , Update Propagator for Joint Scalable Storage, FUNDAMENTA INFORMATICAE, 2012. Zobacz w PBN

2010

T.R. Hvidste, Bartosz Wilczyński , A Computer Scientist's Guide to the Regulatory Genome, FUNDAMENTA INFORMATICAE, 2010. Zobacz w PBN
Barbara Dunin-Kęplicz , Anh Linh Nguyen , Andrzej Szałas , A Framework for Graded Beliefs, Goals and Intentions, FUNDAMENTA INFORMATICAE, 2010. Zobacz w PBN
Norbert Dojer , An Efficient Algorithm for Learning Bayesian Networks from Data, FUNDAMENTA INFORMATICAE, 2010. Zobacz w PBN
Miron Kursa, Aleksander Jankowski , Witold Rudnicki, Boruta – A System for Feature Selection, FUNDAMENTA INFORMATICAE, 101 (4) 2010, s. 271–285. Zobacz w PBN
Anh Linh Nguyen , Andrzej Szałas , Checking Consistency of an ABox w.r.t. Global Assumptions in PDL, FUNDAMENTA INFORMATICAE, 2010. Zobacz w PBN
Jerzy Tyszkiewicz , Complexity of Type Inference, FUNDAMENTA INFORMATICAE, 2010. Zobacz w PBN
Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, Tomasz Waleń , Finding Patterns In Given Intervals, FUNDAMENTA INFORMATICAE, 2010. Zobacz w PBN
Anh Linh Nguyen , Horn Knowledge Bases in Regular Description Logics with PTIME Data Complexity, FUNDAMENTA INFORMATICAE, 2010. Zobacz w PBN
Paweł Górecki , H-trees: a Model of Evolutionary Scenarios with Horizontal Gene Transfer, FUNDAMENTA INFORMATICAE, 2010. Zobacz w PBN
Anna Gambin , Bogusław Kluge, Modeling Proteolysis from Mass Spectrometry Proteomic Data, FUNDAMENTA INFORMATICAE, 2010. Zobacz w PBN
Mikołaj Bojańczyk , Damian Niwiński , Alexander Rabinovich, Adam Radziwonczyk-Syta, Michał Skrzypczak , On the Borel Complexity of MSO Definable Sets of Branches, FUNDAMENTA INFORMATICAE, 2010. Zobacz w PBN
Anna Gambin , Damian Niwiński , Paweł Urzyczyn , Preface, FUNDAMENTA INFORMATICAE, 2010. Zobacz w PBN
Paweł Urzyczyn , The Logic of Persistent Intersection, FUNDAMENTA INFORMATICAE, 2010. Zobacz w PBN

2009

Anh Linh Nguyen , An Efficient Tableau Prover using Global Caching for the Description Logic ALC, FUNDAMENTA INFORMATICAE, 2009. Zobacz w PBN
Rajeev Gore, Anh Linh Nguyen , Clausal Tableaux for Multimodal Logics of Belief, FUNDAMENTA INFORMATICAE, 2009. Zobacz w PBN
Jan Małuszyński, Andrzej Szałas , Aida Vitória, Modeling and Reasoning with Paraconsistent Rough Sets, FUNDAMENTA INFORMATICAE, 2009. Zobacz w PBN
Witold Rudnicki, Aleksander Jankowski , Aleksander Modzelewski, Aleksander Piotrowski, Adam Zadrożny, The new SIMD implementation of the Smith-Waterman algorithm on Cell microprocessor, FUNDAMENTA INFORMATICAE, 96 (1-2) 2009, s. 181–194. Zobacz w PBN
Jan Hidders, Jacek Sroka , Towards a Formal Semantics for the Process Model of the Taverna Workbench. Part I, FUNDAMENTA INFORMATICAE, 2009. Zobacz w PBN
Jan Hidders, Jacek Sroka , Towards a Formal Semantics for the Process Model of the Taverna Workbench. Part II, FUNDAMENTA INFORMATICAE, 2009. Zobacz w PBN

2007

P. Doherty, Andrzej Szałas , A Correspondence Framework between Three-Valued Logics and Similarity-Based Approximate Reasoning, FUNDAMENTA INFORMATICAE, 2007. Zobacz w PBN
Barbara Dunin-Kęplicz , Marcin Dziubiński , Rineke Verbrugge, Complexity issues in multiagent logics, FUNDAMENTA INFORMATICAE, 2007. Zobacz w PBN
A. Arnold, Damian Niwiński , Continuous Separation of Game Languages, FUNDAMENTA INFORMATICAE, 2007. Zobacz w PBN
Anh Linh Nguyen , Foundations of Modal Deductive Databases, FUNDAMENTA INFORMATICAE, 2007. Zobacz w PBN
Ł. Bolikowski, Anna Gambin , New Metrics for Phylogenies, FUNDAMENTA INFORMATICAE, 2007. Zobacz w PBN

2006

P. Claire, Hung Son Nguyen , Thi sinh hoa Nguyen, Trung Nguyen, J. Paddon, Derek Willis, Learning sunspot classification, FUNDAMENTA INFORMATICAE, 2006. Zobacz w PBN
Anh Linh Nguyen , Negative Ordered Hyper-Resolution as a Proof Procedure for Disjunctive Logic Programming, FUNDAMENTA INFORMATICAE, 2006. Zobacz w PBN

2004

J. Bazan, Hung Son Nguyen , Marcin Szczuka, A view on rough set concept approximations, FUNDAMENTA INFORMATICAE, 2004. Zobacz w PBN
Norbert Dojer , Applying term rewriting to partial algebra theory, FUNDAMENTA INFORMATICAE, 2004. Zobacz w PBN
M. Karpinski, Mirosław Kowaluk , A. Lingas, Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs, FUNDAMENTA INFORMATICAE, 2004. Zobacz w PBN

2003

Anh Linh Nguyen , A Fixpoint Semantics and an SLD-Resolution Calculus for Modal Logic Programs, FUNDAMENTA INFORMATICAE, 2003. Zobacz w PBN
Maxime Crochemore, Costas Iliopoulos, Thierry Lecroq, Yoan Pinzon, Wojciech Plandowski , Wojciech Rytter , Occurrence and substring heuristics for delta-matching, FUNDAMENTA INFORMATICAE, 2003. Zobacz w PBN
M. Crochemore, C.S. Iliopoulos, T. Lecroq, Y.J. Pinzon, W. Plandowski, Wojciech Rytter , Occurrence and Substring Heuristics for [ro]-Matching, FUNDAMENTA INFORMATICAE, 2003. Zobacz w PBN
Patrick Doherty, Witold Lukaszewicz, Andrzej Skowron, Andrzej Szałas , Preface, FUNDAMENTA INFORMATICAE, 2003. Zobacz w PBN
P. Doherty, M. Grabowski, Andrzej Szałas , W. Łukaszewicz, Towards a Framework for Approximate Ontologies, FUNDAMENTA INFORMATICAE, 2003. Zobacz w PBN

2002

Dominik Ślęzak , Approximate Entropy Reducts, FUNDAMENTA INFORMATICAE, 2002. Zobacz w PBN

2001

Jerzy Tyszkiewicz , Computability by Sequences of Queries, FUNDAMENTA INFORMATICAE, 2001. Zobacz w PBN
M. Dietzfelbinger, Anna Gambin , Sławomir Lasota , On different models for packet flow in multistage interconnection networks, FUNDAMENTA INFORMATICAE, 2001. Zobacz w PBN
Hung Son Nguyen , On Efficient Handling of Continuous Attributes in Large Data Bases, FUNDAMENTA INFORMATICAE, 2001. Zobacz w PBN
Anh Linh Nguyen , The modal query language MDatalog, FUNDAMENTA INFORMATICAE, 2001. Zobacz w PBN

2000

Anh Linh Nguyen , Constructing the Least Models for Positive Modal Logic Programs, FUNDAMENTA INFORMATICAE, 2000. Zobacz w PBN
Dominik Ślęzak , Normalized Decision Functions and Measures for Inconsistent Decision Tables Analysis, FUNDAMENTA INFORMATICAE, 2000. Zobacz w PBN

1999

P Doherty, J Kachniarz, Andrzej Szałas , Meta-queries on deductive databases, FUNDAMENTA INFORMATICAE, 1999. Zobacz w PBN
Hung Son Nguyen , Thi sinh hoa Nguyen, Rough Sets and Association rule Generation, FUNDAMENTA INFORMATICAE, 1999. Zobacz w PBN

1998

P. Doherty, Andrzej Szałas , Witold Łukaszewicz, General Domain Circumscription and its effective reductions, FUNDAMENTA INFORMATICAE, 1998. Zobacz w PBN

1996

Patrick Doherty, Andrzej Szałas , Witold Łukaszewicz, A Reduction Result for Circumscribed Semi-Horn Formulas, FUNDAMENTA INFORMATICAE, 1996. Zobacz w PBN
Andrzej Szałas , On Natural Deduction in First-Order Fixpoint Logics, FUNDAMENTA INFORMATICAE, 1996. Zobacz w PBN

1989

Uwe Petermann, Andrzej Szałas , On Temporal Logic for Distributed Systems and Its Application to Processes Communicating by Interrupts, FUNDAMENTA INFORMATICAE, 1989. Zobacz w PBN