Fundamenta Informaticae, Volume 79

Volume 79, Number 1-2, 2007

• Paul Bell:
  A Note on the Emptiness of Semigroup Intersections. 1-4
  
• Robert Cowen, Adam Kolany:
  Davis-Putnam Style Rules for Deciding Property S. 5-15
  
• Gregory J. Chaitin:
  An Algebraic Characterization of the Halting Probability. 17-23
  
• Thomas Eiter, Esra Erdem, Wolfgang Faber, Ján Senko:
  A Logic-Based Approach to Finding Explanations for Discrepancies in Optimistic Plan Execution. 25-69
  
• Grzegorz Herman, Tim Paterson, Michael Soltys:
  A Propositional Proof System with Quantification Over Permutations. 71-83
  
• Linh Anh Nguyen:
  Foundations of Modal Deductive Databases. 85-135
  
• Alexander Rabinovich:
  Composition Theorem for Generalized Sum. 137-167
  
• Zenon Sadowski:
  Optimal Proof Systems, Optimal Acceptors and Recursive Presentability. 169-185
  
• Joost Vennekens, Johan Wittocx, Maarten Mariën, Marc Denecker:
  Predicate Introduction for Logics with a Fixpoint Semantics. Part I: Logic Programming. 187-208
  
• Joost Vennekens, Johan Wittocx, Maarten Mariën, Marc Denecker:
  Predicate Introduction for Logics with Fixpoint Semantics. Part II: Autoepistemic Logic. 209-227
  
• Bozena Wozna, Andrzej Zbrzezny:
  Bounded Model Checking for the Existential Fragment of TCTL_-G and Diagonal Timed Automata. 229-256
  
• Wei-Guo Zhang, Ying-Luo Wang:
  A Comparative Analysis of Possibilistic Variances and Covariances of Fuzzy Numbers. 257-263
  

Volume 79, Number 3-4, 2007

• Antoni Mazurkiewicz:
  Compositional Systems over Reducible Networks. 265-282
  
• Ludwik Czaja:
  Interpreted Nets. 283-293
  
• Roxana Dietze, Manfred Kudlek, Olaf Kummer:
  Decidability Problems of a Basic Class of Object Nets. 295-302
  
• Berndt Farwer, Manfred Kudlek, Heiko Rölke:
  Concurrent Turing Machines. 303-317
  
• Anna Gomolinska:
  Approximation Spaces Based on Relations of Similarity and Dissimilarity of Objects. 319-333
  
• Damas P. Gruska:
  Observation Based System Security. 335-346
  
• Kees M. van Hee, Olivia Oanea, Alexander Serebrenik, Natalia Sidorova, Marc Voorhoeve, Irina A. Lomazova:
  Checking Properties of Adaptive Workflow Nets. 347-362
  
• Gizela Jakubowska, Wojciech Penczek:
  Modelling and Checking Timed Authentication of Security Protocols. 363-378
  
• Agata Janowska, Wojciech Penczek:
  Path Compression in Timed Automata. 379-399
  
• Michael Köhler:
  The Reachability Problem for Object Nets. 401-413
  
• Michael Köhler:
  A Formal Model of Multi-Agent Organisations. 415-430
  
• Sergiy Kryvyy, Lyudmila Matvyeyeva:
  Algorithm of Translation of MSC-specified System into Petri Net. 431-445
  
• Manfred Kudlek:
  On Semilinear Sets over Commutative Semirings. 447-452
  
• Miroslaw Kurkowski, Wojciech Penczek:
  Verifying Security Protocols Modelled by Networks of Automata. 453-471
  
• Alessio Lomuscio, Franco Raimondi, Bozena Wozna:
  Verification of the TESLA protocol in MCMAS-X. 473-486
  
• Antoni Mazurkiewicz:
  Local Properties of Triangular Graphs. 487-495
  
• James F. Peters, Andrzej Skowron, Jaroslaw Stepaniuk:
  Nearness of Objects: Extension of Approximation Space Model. 497-512
  
• Roman R. Redziejowski:
  Parsing Expression Grammar as a Primitive Recursive-Descent Parser with Backtracking. 513-524
  
• Jaroslaw Stepaniuk:
  Relational Data and Rough Sets. 525-539
  
• Zbigniew Suraj, Barbara Fryc:
  Analysis of Approximate Petri Nets by Means of Occurrence Graphs. 541-551
  
• Zbigniew Suraj, Krzysztof Pancerz:
  Towards Efficient Computing Consistent and Partially Consistent Extensions of Information Systems. 553-566
  
• Marcin Wolski:
  Approximation Spaces and Nearness Type Structures. 567-577
  
• Andrzej Zbrzezny, Agata Pólrola:
  SAT-Based Reachability Checking for Timed Automata with Discrete Data. 579-593