Last update:
Mon Dec 16 07:59:54 MST 2019
John Goutsias and
Henk Heijmans Preface . . . . . . . . . . . . . . . . ??
John Goutsias and
Henk J. A. M. Heijmans Fundamenta Morphologicae Mathematicae 1--31
Renato Keshet (Kresch) Mathematical Morphology on Complete
Semilattices and its Applications to
Image Processing . . . . . . . . . . . . 33--56
Luc Vincent Granulometries and Opening Trees . . . . 57--90
Petros Maragos and
Muhammad Akmal Butt Curve Evolution, Differential
Morphology, and Distance Transforms
Applied to Multiscale and Eikonal
Problems . . . . . . . . . . . . . . . . 91--129
Pierre Soille From Binary to Grey Scale Convex Hulls 131--146
Jean Serra Connections for sets and functions . . . 147--186
Jos B. T. M. Roerdink and
Arnold Meijster The Watershed Transform: Definitions,
Algorithms and Parallelization
Strategies . . . . . . . . . . . . . . . 187--228
J. Barrera and
R. Terada and
R. Hirata, Jr. and
N. S. T. Hirata Automatic Programming of Morphological
Machines by PAC Learning . . . . . . . . 229--258
Christel Baier and
Marta Kwiatkowska On Topological Hierarchies of Temporal
Properties . . . . . . . . . . . . . . . 259--294
Mikhail Moshkov and
Igor Chikalov On Algorithm for Constructing of
Decision Trees with Minimal Depth . . . 295--299
Mikhail Moshkov Deterministic and Nondeterministic
Decision Trees for Rough Computing . . . 301--311
Gheorghe P\uaun and
Grzegorz Rozenberg and
Arto Salomaa Membrane Computing with External Output 313--340
Z. Tsiatsoulis and
J. Y. Cotronis Testing and Debugging Message Passing
Programs in Synergy with their
Specifications . . . . . . . . . . . . . 341--366
V. Bos and
J. J. T. Kleijn Formalisation of a Production System
Modelling Language: The operational
semantics of $ \chi $ Core . . . . . . . 367--392
Ferrante Formato and
Giangiacomo Gerla and
Maria I. Sessa Similarity-based Unification . . . . . . 393--414
H.-M. Hanisch and
A. Lüder A Signal Extension for Petri Nets and
its Use in Controller Design . . . . . . 415--431
Ryszard S. Michalski and
Kenneth A. Kaufman Building Knowledge Scouts Using KGL
Metalanguage . . . . . . . . . . . . . . 433--447
Mikhail Moshkov Decision Trees for Regular Language Word
Recognition . . . . . . . . . . . . . . 449--461
Wendy MacCaull A Proof System for Dependencies for
Information Relations . . . . . . . . . 1--27
Linh Anh Nguyen Constructing the Least Models for
Positive Modal Logic Programs . . . . . 29--60
Yongge Wang and
Yvo Desmedt and
Mike Burmester Models For Dependable Computation with
Multiple Inputs and Some Hardness
Results . . . . . . . . . . . . . . . . 61--73
Józef Winkowski An Algebra of Data Flows . . . . . . . . 75--104
Pascal Boldini Formalizing Context in Intuitionistic
Type Theory . . . . . . . . . . . . . . 105--127
Marcin Inkielman A Method for Hierarchical Description of
Images Using Multiscale Analysis . . . . 129--148
Azaria Paz and
Robert Y. Geva and
Milan Studený Representation of Irrelevance Relations
by Annotated Graphs . . . . . . . . . . 149--199
A. Rabinovich Succinctness Gap between Monadic Logic
and Duration Calculus . . . . . . . . . 201--210
Stéphane Demri The Nondeterministic Information Logic
NIL is PSPACE-complete . . . . . . . . . 211--234
Piotr Denejko and
Krzysztof Diks and
Andrzej Pelc and
Marek Piotrów Reliable Minimum Finding Comparator
Networks . . . . . . . . . . . . . . . . 235--249
Marcin Engel and
Artur Kret and
Janina Mincer-Daszkiewicz Towards Automated Consistency Checking
of Module Interface Specifications . . . 251--278
Masahiro Inuiguchi and
Tetsuzo Tanino Necessity Measures and Parametric
Inclusion Relations of Fuzzy Sets . . . 279--302
Michael Kaminski and
Guy Rey First-order Non-monotonic Modal Logics 303--333
Markus Kohn and
Hartmut Schmeck Formal Asynchronous Systems Modelling 335--389
Karl Schlechta and
Laurent Gourmelen and
Stéphanie Motré and
Olivier Rolland and
Bensalah Tahar A New Approach to Preferential
Structures . . . . . . . . . . . . . . . 391--410
Hans-Dieter Burkhard and
Peter Starke and
Ludwik Czaja Preface . . . . . . . . . . . . . . . . ??
Maria V. Andreeva and
Elena N. Bozhenkova and
Irina B. Virbitskaite Analysis of Timed Concurrent Models
Based on Testing Equivalence . . . . . . 1--20
Marek A. Bednarczyk and
Andrzej M. Borzyszkowski and
Rafa\l Somla Finite Completeness of Categories of
Petri Nets . . . . . . . . . . . . . . . 21--48
Ludwik Czaja and
Manfred Kudlek Rational, Linear and Algebraic Process
Languages and Iteration Lemmata . . . . 49--60
Berndt Farwer A Multi-region Linear Logic Based
Calculus for Dynamic Petri Net
Structures . . . . . . . . . . . . . . . 61--79
Adrianna Foremniak and
Peter H. Starke Structural Analysis of Signal-Event
Systems . . . . . . . . . . . . . . . . 81--104
Stefan Haar Occurrence Net Logics . . . . . . . . . 105--127
Markus Hannebauer A Formalization of Autonomous Dynamic
Reconfiguration in Distributed
Constraint Satisfaction . . . . . . . . 129--151
Ruggero Lanotte and
Andrea Maggiolo-Schettini and
Adriano Peron Timed Cooperating Automata . . . . . . . 153--173
Timo Latvala and
Keijo Heljanko Coping With Strong Fairness . . . . . . 175--193
Irina A. Lomazova Nested Petri Nets --- a Formalism for
Specification and Verification of
Multi-Agent Distributed Systems . . . . 195--214
Ines Münch and
Gabriela Lindemann-v.Trzebiatowski ChariTime --- Concepts of Analysis and
Design of an Agent-Oriented System for
Appointment Management . . . . . . . . . 215--226
Anna S. Nepomniaschaya and
Maria A. Dvoskina A Simple Implementation of Dijkstra's
Shortest Path Algorithm on Associative
Parallel Processors . . . . . . . . . . 227--243
Wojciech Penczek and
Maciej Szreter and
Rob Gerth and
Ruurd Kuiper Improving Partial Order Reductions for
Universal Branching Time Properties . . 245--267
James F. Peters and
Andrzej Skowron and
Zbigniew Suraj An Application of Rough Set Methods in
Control Design . . . . . . . . . . . . . 269--290
Lech Polkowski and
Andrzej Skowron Rough Mereology in Information Systems
with Applications to Qualitative Spatial
Reasoning . . . . . . . . . . . . . . . 291--320
Stephan Roch Analyzing and Reducing Simultaneous
Firing in Signal-Event Nets . . . . . . 321--330
Kay Schröter and
Gabriela Lindemann-v.Trzebiatowski and
Lutz Fritsche TBase2 --- a Web--Based Electronic
Patient Record . . . . . . . . . . . . . 343--353
Kimmo Varpaaniemi Stable Models for Stubborn Sets . . . . 355--375
Isto Aho Interactive Knapsacks . . . . . . . . . 1--23
Martin Büchi and
Emil Sekerinski A Foundation for Refining Concurrent
Objects . . . . . . . . . . . . . . . . 25--61
Stanis\law Chrobot Sharing Variables in Distributed Memory 63--81
Erzsébet Csuhaj-Varjú and
Victor Mitrana Dynamical Teams in Eco-Grammar Systems 83--94
Patrick Doherty and
Witold \Lukaszewicz and
Ewa Madali\'nska-Bugaj The PMA and Relativizing Minimal Change
for Action Update . . . . . . . . . . . 95--131
Benedetto Intrigila and
Anna R. Laurenzi Two Problems on Reduction Graphs in
Lambda Calculus . . . . . . . . . . . . 133--144
Lyubomir Ivanov Platek Spaces . . . . . . . . . . . . . 145--181
Lyubomir Ivanov Boldface Recursion on Platek Spaces . . 183--208
Nadia Busi and
G. Michele Pinna Comparing Truly Concurrent Semantics for
Contextual Place/Transition Nets . . . . 209--244
Pavel Martinek On a Construction of Context-free
Grammars . . . . . . . . . . . . . . . . 245--264
Étienne Payet Thue Specifications, Infinite Graphs and
Synchronized Product . . . . . . . . . . 265--290
Dominik \'Slezak Normalized Decision Functions and
Measures for Inconsistent Decision
Tables Analysis . . . . . . . . . . . . 291--319
Anastasia Analyti and
Nicolas Spyratos and
Panos Constantopoulos Deriving and Retrieving Contextual
Categorical Information through Instance
Inheritance . . . . . . . . . . . . . . 321--351
Jürgen Dassow and
Carlos Martín-Vide and
Gheorghe P\uaun and
Alfonso Rodríguez-Patón Conditional Concatenation . . . . . . . 353--372
Stéphane Demri and
Jaros\law Stepaniuk Computational Complexity of Multimodal
Logics \newline Based on Rough Sets . . 373--396
Agnes Kurucz and
István Németi Representability of Pairing Relation
Algebras Representability of Pairing
Relation Algebras Depends on our
Ontology . . . . . . . . . . . . . . . . 397--420
Jean-Yves Girard and
Pawe\l Urzyczyn Preface . . . . . . . . . . . . . . . . ??
Patrick Baillot and
Marco Pedicini Elementary Complexity and Geometry of
Interaction . . . . . . . . . . . . . . 1--31
Sabine Broda and
Luís Damas Counting a Type's (Principal)
Inhabitants . . . . . . . . . . . . . . 33--51
René David Computing with Böhm Trees . . . . . . . . 53--77
Masahiko Sato and
Takafumi Sakurai and
Rod Burstall Explicit Environments . . . . . . . . . 79--115
Rick Statman Marginalia to a Theorem of Jacopini . . 117--121
C. Urban and
G. M. Bierman Strong Normalisation of Cut-Elimination
in Classical Logic . . . . . . . . . . . 123--155
János Apró and
Sándor Vágvölgyi The Ground Tree Transducer Game with
Identical Tree Automata . . . . . . . . 157--172
Philippe Balbiani and
Dimiter Vakarelov Iteration-free PDL with Intersection: a
Complete Axiomatization . . . . . . . . 173--194
Jean-Marc Champarnaud and
Djelloul Ziadi From Mirkin's Prebases to Antimirov's
Word Partial Derivatives . . . . . . . . 195--205
Petr Hájek and
Sauro Tulipani Complexity of Fuzzy Probability Logics 207--213
Padmanabhan Krishnan Decomposing Timed Push Down Automata . . 215--229
Alexander Meduna Uniform Generation of Languages by
Scattered Context Grammars . . . . . . . 231--235
Bengt J. Nilsson Approximating a Shortest Watchman Route 235--281
Robert Saxon Milnikel Skeptical Reasoning in FC-Normal Logic
Programs is $ \pi^1_1$-complete . . . . 237--252
Junior Barrera and
Ronaldo Fumio Hasimoto Sup-Compact and Inf-Compact
Representations of $W$-Operators . . . . 283--294
Andries P. Engelbrecht Sensitivity Analysis for Selective
Learning by Feedforward Neural Networks 295--328
Henning Fernau and
Ralf Stiebe Valences in Lindenmayer Systems . . . . 329--358
Damas P. Gruska and
Andrea Maggiolo-Schettini Process Algebras for Network
Communication . . . . . . . . . . . . . 359--378
Antonino Salibra Nonmodularity Results for Lambda
Calculus . . . . . . . . . . . . . . . . 379--392
Xishun Zhao and
Decheng Ding Complexity Results for 2CNF Default
Theories . . . . . . . . . . . . . . . . 393--404
Ivo Düntsch Preface . . . . . . . . . . . . . . . . ??
A. G. Cohn and
S. M. Hazarika Qualitative Spatial Representation and
Reasoning: An Overview . . . . . . . . . 1--29
Ernest Davis Continuous Shape Transformation and
Metrics on Regions . . . . . . . . . . . 31--54
Antony Galton Dominance Diagrams: A Tool for
Qualitative Reasoning About Continuous
Systems . . . . . . . . . . . . . . . . 55--70
Ivo Düntsch and
Ewa Or\lowska and
Hui Wang Algebras of Approximating Regions . . . 71--82
Lech Polkowski On Connection Synthesis via Rough
Mereology . . . . . . . . . . . . . . . 83--96
Thomas Bittner The Qualitative Structure of Built
Environments . . . . . . . . . . . . . . 97--128
Dominik J. Schoop Points in Point-Free Mereotopology . . . 129--143
Brandon Bennett A Categorical Axiomatisation of
Region-Based Geometry . . . . . . . . . 145--158
Ian Pratt-Hartmann Empiricism and Rationalism in
Region-based Theories of Space . . . . . 159--186
Sergio A. Celani A Fragment of Intuitionistic Dynamic
Logic . . . . . . . . . . . . . . . . . 187--197
Churn-Jung Liau and
Duen-Ren Liu A Possibilistic Decision Logic with
Applications . . . . . . . . . . . . . . 199--217
Andries P. Engelbrecht Sensitivity Analysis for Selective
Learning by Feedforward Neural Networks 219--252
Ferucio Lauren\ctiu \cTiplea and
Erkki Mäkinen A Note on SE-Systems and Regular
Canonical Systems . . . . . . . . . . . 253--256
Rakesh M. Verma and
Michael Rusinowitch and
Denis Lugiez Algorithms and Reductions for Rewriting
Problems . . . . . . . . . . . . . . . . 257--276
Radim B\velohlávek Reduction and a Simple Proof of
Characterization of Fuzzy Concept
Lattices . . . . . . . . . . . . . . . . 277--285
Martin Dietzfelbinger and
Anna Gambin and
S\lawomir Lasota On Different Models for Packet Flow in
Multistage Interconnection Networks . . 287--314
Linh Anh Nguyen The Modal Query Language MDatalog . . . 315--342
Jan Ostravský Prelanguages Versus Submonoids . . . . . 343--348
Christian Ronse and
Jean Serra Geodesy and connectivity in lattices . . 349--395
E. El-Kwae and
Z. Ra\'s Preface . . . . . . . . . . . . . . . . ??
Stefan Kramer and
Gerhard Widmer and
Bernhard Pfahringer and
Michael De Groeve Prediction of Ordinal Classes Using
Regression Trees . . . . . . . . . . . . 1--13
Floriana Esposito and
Nicola Fanizzi and
Stefano Ferilli and
Giovanni Semeraro A Generalization Model Based on
OI-implication for Ideal Theory
Refinement . . . . . . . . . . . . . . . 15--33
Tapio Elomaa and
Juho Rousu On the Computational Complexity of
Optimal Multisplitting . . . . . . . . . 35--52
Mohand-Sa\"\id Hacid and
Farouk Toumani and
Ahmed K. Elmagarmid Constraint-Based Approach to
Semistructured Data . . . . . . . . . . 53--73
Park Sang Hyun and
Wesley W. Chu Discovering and Matching Elastic Rules
from Sequence Databases . . . . . . . . 75--90
Seppo Puuronen and
Alexey Tsymbal Local Feature Selection with Dynamic
Integration of Classifiers . . . . . . . 91--117
Minkoo Kim and
Jitender S. Deogun and
Vijay V. Raghavan Concept Based Retrieval Using
Generalized Retrieval Functions . . . . 119--135
Chris Fernandes and
Lawrence Henschen Discovering and Resolving User Intent in
Heterogeneous Databases . . . . . . . . 137--154
Elisa Bertino and
Barbara Catania and
Gian Piero Zarri Metadata, Intelligent Indexing, and
Repository Management for Multimedia
Digital Libraries . . . . . . . . . . . 155--173
Alicja Wieczorkowska Musical Sound Classification based on
Wavelet Analysis . . . . . . . . . . . . 175--188
Hans-Dieter Burkhard and
Peter Starke and
Ludwik Czaja Preface . . . . . . . . . . . . . . . . ??
Roberto Barbuti and
Nicoletta De Francesco and
Luca Tesei Timed Automata with non-Instantaneous
Actions . . . . . . . . . . . . . . . . 189--200
Hans-Dieter Burkhard Similarity and Distance in Case Based
Reasoning . . . . . . . . . . . . . . . 201--215
Ludwik Czaja and
Manfred Kudlek $ \omega $-Process Languages for
Place/Transition Nets . . . . . . . . . 217--229
Javier Esparza and
Claus Schröter Unfolding Based Algorithms for the
Reachability Problem . . . . . . . . . . 231--245
Bernd Farwer Comparing Concepts of Object Petri Net
Formalisms . . . . . . . . . . . . . . . 247--258
Stefan Haar Clusters, Confusion and Unfoldings . . . 259--270
Ruggero Lanotte and
Andrea Maggiolo-Schettini and
Simone Tini and
Adriano Peron Transformations of Timed Cooperating
Automata . . . . . . . . . . . . . . . . 271--282
Irina A. Lomazova Nested Petri Nets: Multi-level and
Recursive Systems . . . . . . . . . . . 283--293
Klaus-Peter Neuendorf and
Dong-Ho Lee and
Dimitris Kiritsis and
Paul Xirouchakis Disassembly Scheduling with Parts
Commonality Using Petri Nets with
Timestamps . . . . . . . . . . . . . . . 295--306
James F. Peters and
S. Ramanna and
M. Borkowski and
Andrzej Skowron and
Zbigniew Suraj Sensor, Filter, and Fusion Models with
Rough Petri Nets . . . . . . . . . . . . 307--323
Karsten Schmidt Narrowing Petri Net State Spaces Using
the State Equation . . . . . . . . . . . 325--335
Andrzej Skowron and
Jaros\law Stepaniuk Information Granule Decomposition . . . 337--350
Jakub Wróblewski Ensembles of Classifiers Based on
Approximate Reducts . . . . . . . . . . 351--360
Joscha Bach Supporting Textual Input by Using
Multiple Entropy Models . . . . . . . . 1--7
Pierluigi Frisco and
Claudio Zandron On Variants of Communicating Distributed
$H$ Systems . . . . . . . . . . . . . . 9--20
Maciej Koutny and
Giuseppe Pappalardo Behaviour Abstraction for Communicating
Sequential Processes . . . . . . . . . . 21--54
Aleksander Meduna and
Petr Vurm Multisequential Grammars with
Homogeneous Selectors . . . . . . . . . 55--60
Hung Son Nguyen On Efficient Handling of Continuous
Attributes in Large Data Bases . . . . . 61--81
George Tourlakis Computability in Type-2 Objects with
Well-Behaved Type-1 Oracles is
$p$-Normal . . . . . . . . . . . . . . . 83--91
Xishun Zhao and
Decheng Ding Some Algorithms for Extension
Computation of Nonmonotonic Rule Systems 93--106
Robert Demolombe and
Risto Hilpinen Preface . . . . . . . . . . . . . . . . ??
Jan Broersen and
Roel Wieringa and
John-Jules Meyer A Fixed-point Characterization of a
Deontic Logic of Regular Action . . . . 107--128
José Carmo and
Olga Pacheco Deontic and Action Logics for Organized
Collective Agency, Modeled through
Institutionalized Agents and Roles . . . 129--163
Jose Carmo and
Robert Demolombe and
Andrew J. I. Jones An Application of Deontic Logic to
Information System Constraints . . . . . 165--181
Laurence Cholvy and
Christophe Garion An Attempt to Adapt a Logic of
Conditional Preferences for Reasoning
with Contrary-To-Duties . . . . . . . . 183--204
Jörg Hansen Sets, Sentences, and Some Logics about
Imperatives . . . . . . . . . . . . . . 205--226
Ray E. Jennings Natural Frames and Self-dual Logics . . 227--236
Xavier Parent Cumulativity, Identity and Time in
Deontic Logic . . . . . . . . . . . . . 237--252
Henry Prakken Modelling Defeasibility in Law: Logic or
Procedure? . . . . . . . . . . . . . . . 253--271
Marek Sergot and
Fiona Richards On the Representation of Action and
Agency in the Theory of Normative
Positions . . . . . . . . . . . . . . . 273--293
Ngoc Thanh Nguyen Using Distance Functions to Solve
Representation Choice Problems . . . . . 295--314
Franz Puntigam and
Christof Peter Types for Active Objects with Static
Deadlock Prevention . . . . . . . . . . 315--341
Hiroshi Sakai Effective Procedures for Handling
Possible Equivalence Relations in
Non-deterministic Information Systems 343--362
Zbigniew Stachniak Non-Clausal Reasoning with Definite
Theories . . . . . . . . . . . . . . . . 363--388
Jerzy Tyszkiewicz Computability by Sequences of Queries 389--414
Carlos Martín-Vide and
Gheorghe P\uaun Foreword . . . . . . . . . . . . . . . . ??
Carlos Martín-Vide and
Andrei P\uaun and
Gheorghe P\uaun and
Grzegorz Rozenberg Membrane Systems with Coupled Transport:
Universality and Normal Forms . . . . . 1--15
Joaquin Aguado and
Tudor Balanescu and
Tony Cowling and
Marian Gheorghe and
Mike Holcombe and
Florentin Ipate $P$ Systems with Replicated Rewriting
and Stream $X$-Machines (Eilenberg
Machines) . . . . . . . . . . . . . . . 17--33
Ioan I. Ardelean The Relevance of Cell Membranes for $P$
Systems. General Aspects . . . . . . . . 35--43
Adrian Atanasiu and
Carlos Martín-Vide Recursive Calculus with Membranes . . . 45--59
Gabriel Ciobanu and
Dorin Paraschiv $P$ System Software Simulator . . . . . 61--66
Gabriel Ciobanu and
Bogdan Tanas\ua Gene Expression by Software Mechanisms 67--80
Rudolf Freund and
Marion Oswald GP Systems with Forbidding Context . . . 81--102
Pierluigi Frisco and
Hendrik Jan Hoogeboom and
Paul Sant A Direct Construction of a Universal $P$
System . . . . . . . . . . . . . . . . . 103--122
Jean-Louis Giavitto and
Olivier Michel The Topological Structures of Membrane
Computing . . . . . . . . . . . . . . . 123--145
Sungchul Ji The Bhopalator: An Information/Energy
Dual Model of the Living Cell (II) . . . 147--165
S. N. Krishna and
K. Lakshmanan and
R. Rama On the Power of $P$ Systems with
Contextual Rules . . . . . . . . . . . . 167--178
Kamala Krithivasan and
Mutyam Madhu Contextual $P$ Systems . . . . . . . . . 179--189
Manfred Kudlek and
Victor Mitrana Closure Properties of Multiset Language
Families . . . . . . . . . . . . . . . . 191--203
Vincenzo Manca DNA and Membrane Algorithms for SAT . . 205--221
Salomon Marcus Membranes Versus DNA . . . . . . . . . . 223--227
José L. Maté and
A. Rodríguez-Patón and
Andrés Silva On the Power of $P$ Systems with
DNA-Worm-Objects . . . . . . . . . . . . 229--239
Dan V. Nicolau, Jr. and
Gerardin Solana and
Florin Fulga and
Dan V. Nicolau A C Library for Simulating $P$ Systems 241--248
Taishin Yasunobu Nishida Simulations of Photosynthesis by a
$K$-Subset Transforming System with
Membrane . . . . . . . . . . . . . . . . 249--259
Mario J. Pérez-Jiménez and
Fernando Sancho-Caparrini A Formalization of Transition $P$
Systems . . . . . . . . . . . . . . . . 261--271
Álvaro Romero-Jiménez and
Mario J. Pérez-Jiménez Simulating Turing Machines by $P$
Systems with External Output . . . . . . 273--287
Adrian Atanasiu and
Carlos Martín-Vide and
Alexandru Mateescu On the Injectivity of the Parikh Matrix
Mapping . . . . . . . . . . . . . . . . 289--299
Hans L. Bodlaender and
Michael J. Dinneen and
Bakhadyr Khoussainov Relaxed Update and Partition Network
Games . . . . . . . . . . . . . . . . . 301--312
Barbara Dziemidowicz Optimal Unification and Learning
Algorithms for Categorial Grammars . . . 313--324
C. A. Johnson Processing Indefinite Deductive
Databases under the Possible Model
Semantics . . . . . . . . . . . . . . . 325--347
Mieczys\law Alojzy K\lopotek A New Bayesian Tree Learning Method with
Reduced Time and Space Complexity . . . 349--367
Tadeusz Pankowski PathLog: a Query Language for Schemaless
Databases of Partially Labeled Objects 369--395
Dani\`ele Beauquier Markov Decision Processes and
Deterministic Büchi Automata . . . . . . 1--13
Magdalena Kacprzak A Complete Axiomatization of Process
Temporal Logic . . . . . . . . . . . . . 15--31
Hanna Klaudel and
Franck Pommereau A Class of Composable and Preemptible
High-level Petri Nets with an
Application to Multi-Tasking Systems . . 33--55
Mikhail Ju. Moshkov On Decision Trees for $ (1, 2)$-Bayesian
Networks . . . . . . . . . . . . . . . . 57--76
Claude Sureson Analytic sets in Descriptive Set Theory
and NP sets in Complexity Theory . . . . 77--110
Ryszard Janicki Preface . . . . . . . . . . . . . . . . ??
Michael Baldamus and
Klaus Schneider The BDD Space Complexity of Different
Forms of Concurrency . . . . . . . . . . 111--133
Josep Carmona and
Jordi Cortadella and
Enric Pastor A structural encoding technique for the
synthesis of asynchronous circuits . . . 135--154
O. Garnic and
J. Lanchares and
R. Hermida Optimization of Asynchronous
Delay-Insensitive Pipeline Latency Using
Stage Reorganization and Optimal Stage
Parameter Estimation . . . . . . . . . . 155--174
Marta Pietkiewicz-Koutny Synthesising Elementary Net Systems with
Inhibitor Arcs from Step Transition
Systems . . . . . . . . . . . . . . . . 175--203
Fei Xia and
Ian Clark Algorithms for Signal and Message
Asynchronous Communication Mechanisms
and their Analysis . . . . . . . . . . . 205--222
W. M. Zuberek Analysis of Performance Bottlenecks in
Multithreaded Multiprocessor Systems . . 223--241
Philippe Balbiani A Modal Logic for Indiscernibility and
Complementarity in Information Systems 243--263
Igor Chikalov On Average Depth of Decision Trees
Implementing Boolean Functions . . . . . 265--284
Maurice Margenstern and
Yurii Rogozhin Self-describing Turing machines . . . . 285--303
Lech Polkowski On Fractal Dimension in Information
Systems. Toward Exact Sets in Infinite
Information Systems . . . . . . . . . . 305--314
Timo Poranen and
Jyrki Nummenmaa A Linear Time Special Case for MC Games 315--324
Brian Postow and
Kenneth Regan and
Carl H. Smith UPSILON: Universal Programming System
with Incomplete Lazy Object Notation . . 325--359
Michel Reniers and
J. F. Groote and
M. B. van der Zwaag and
J. van Wamel Completeness of Timed $ \mu $CRL . . . . 361--402
Ludwik Czaja and
Hans-Dieter Burkhard and
Peter Starke Preface . . . . . . . . . . . . . . . . ??
Roberto Barbuti and
Nocoletta De Francesco and
Antonella Santone and
Luca Tesei A Notion of Non-Interference for Timed
Automata . . . . . . . . . . . . . . . . 1--11
Viviana Bono and
Jerzy Tiuryn Products and Polymorphic Subtypes . . . 13--41
Ludwik Czaja Place/Transition Petri net Evolutions:
Recording Ways, Analysis and Synthesis 43--58
Piotr Dembi\'nski and
Agata Pó\lrola Verification of Timed Automata Based on
Similarity . . . . . . . . . . . . . . . 59--89
Bernard Farwer Dynamic Modification of Object Petri
Nets. An Application to Modelling
Protocols with Fork-Join Structures . . 91--101
Anna Gomoli\'nska A Comparative Study of Some Generalized
Rough Approximations . . . . . . . . . . 103--119
Irina A. Lomazova Modeling Dynamic Objects in Distributed
Systems with Nested Petri Nets . . . . . 121--133
Wojciech Penczek and
Bo\.zena Wo\'zna and
Andrzej Zbrzezny Bounded Model Checking for the Universal
Fragment of CTL . . . . . . . . . . . . 135--156
James F. Peters and
Andrzej Skowron and
Jaros\law Stepaniuk and
Sheela Ramanna Towards an Ontology of Approximate
Reason . . . . . . . . . . . . . . . . . 157--173
Zbigniew W. Ra\'s and
Shishir Gupta Global Action Rules in Distributed
Knowledge Systems . . . . . . . . . . . 175--184
Jan Richling and
Louchka Popova-Zeugmann and
Matthias Werner Verification of Non-functional
Properties of a Composable Architecture
with Petrinets . . . . . . . . . . . . . 185--200
Zbigniew Suraj and
J. F. Peters and
W. Rzasa A Comparison of Different Decision
Algorithms Used in Volumetric Storm
Cells Classification . . . . . . . . . . 201--214
Kimmo Varpaaniemi Minimizing the Number of Successor
States in the Stubborn Set Method . . . 215--234
Józef Winkowski Reachability in Contextual Nets . . . . 235--250
Hans-Dieter Burkhard Real Time Control for Autonomous Mobile
Robots . . . . . . . . . . . . . . . . . 251--270
Barbara Dunin-K\ceplicz and
Rineke Verbrugge Collective Intentions . . . . . . . . . 271--295
Costas D. Koutras and
Pavlos Pappas Weaker Axioms, More Ranges . . . . . . . 297--310
Jayanta Sen and
Mihir K. Chakraborty A Study of Interconnections Between
Rough and $3$-Valued \Lukasiewicz Logics 311--324
Verónica Becher and
Gregory Chaitin Another Example of Higher Order
Randomness . . . . . . . . . . . . . . . 325--338
François Denis and
Aurélien Lemay and
Alain Terlutte Residual Finite State Automata . . . . . 339--368
Grzegorz Góra and
Arkadiusz Wojna RIONA: A New Classification System
Combining Rule Induction and
Instance-Based Learning . . . . . . . . 369--390
Ivan Kope\vcek and
Miroslav Novotný On Equations Including Strings . . . . . 391--398
Alexander Meduna and
Du\vsan Kolá\vr One-Turn Regulated Pushdown Automata and
Their Reduction . . . . . . . . . . . . 399--405
Gianpiero Cattaneo and
Bruno Durand and
Giancarlo Mauri and
Thomas Worsch Introduction . . . . . . . . . . . . . . ??
Nino Boccara and
Henryk Fuk\'s Number-conserving cellular automaton
rules . . . . . . . . . . . . . . . . . 1--13
Thomas Buchholz and
Andreas Klein and
Martin Kutrib On Interacting Automata with Limited
Nondeterminism . . . . . . . . . . . . . 15--38
Gianpiero Cattaneo and
Alberto Dennunzio and
Luciano Margara Chaotic Subshifts and Related Languages
Applications to one-dimensional Cellular
Automata . . . . . . . . . . . . . . . . 39--80
Marianne Delorme and
Jacques Mazoyer Pebble Automata. Figures Families
Recognition and Universality . . . . . . 81--132
Katsunobu Imai and
Kenichi Morita and
Kenji Sako Firing Squad Synchronization Problem in
Number-Conserving Cellular Automata . . 133--141
Petr K\rurka and
Alejandro Maass Stability of subshifts in cellular
automata . . . . . . . . . . . . . . . . 143--155
Bruno Martin A Geometrical Hierarchy on Graphs via
Cellular Automata . . . . . . . . . . . 157--181
Daniel Merkle and
Thomas Worsch Formal language recognition by
stochastic cellular automata . . . . . . 183--201
Codrin M. Nichitiu and
Eric Rémila Effective Simulations on Hyperbolic
Networks . . . . . . . . . . . . . . . . 203--231
Peter Sanders and
Roland Vollmar and
Thomas Worsch Cellular Automata: Energy Consumption
and Physical Feasibility . . . . . . . . 233--248
K. Sutner Cellular Automata and Intermediate
Reachability Problems . . . . . . . . . 249--256
Hiroshi Umeo and
Naoki Kamikawa A Design of Real-Time Non-Regular
Sequence Generation Algorithms and Their
Implementations on Cellular Automata
with $1$-Bit Inter-Cell Communications 257--275
Jörg R. Weimar Three-dimensional Cellular Automata for
Reaction-Diffusion Systems . . . . . . . 277--284
Sabyasachi Dey and
Bhargab B. Bhattacharya and
Malay K. Kundu and
Tinku Acharya Acharya A Simple Architecture for Computing
Moments and Orientation of an Image . . 285--295
Rik Eshuis and
Maarten M. Fokkinga Comparing Refinements for Failure and
Bisimulation Semantics . . . . . . . . . 297--321
Tuan-Fang Fan and
Churn-Jung Liau and
Yiyu Yao On Modal and Fuzzy Decision Logics Based
on Rough Set Theory . . . . . . . . . . 323--344
Miroslav Novotný Construction of Pure Grammars . . . . . 345--360
Alexander Okhotin and
Kai Salomaa and
Michael Domaratzki One-Visit Caterpillar Tree Automata . . 361--375
Tomasz Terlikowski A Logical Approach to Control. Some New
Logical Concepts and their Application
to the Notion of Safety for Control
Variants . . . . . . . . . . . . . . . . 377--394
Stéphane Demri and
Ulrike Sattler Automata-Theoretic Decision Procedures
for Information Logics . . . . . . . . . 1--22
George Georgescu and
Andrei Popescu Concept lattices and similarity in
non-commutative fuzzy logic . . . . . . 23--54
Kees A. Middelburg Process Algebra with Nonstandard Timing 55--77
Xishun Zhao and
Paolo Liberatore Complexity of the Unique Extension
Problem in Default Logic . . . . . . . . 79--104
Roberto Amadio and
Gerard Boudol and
Cedric Lhoussaine On message deliverability and
non-uniform receptivity . . . . . . . . 105--129
Min-Shiang Hwang and
Cheng-Ch Lee and
Shin-Jia Hwang Cryptanalysis of the Hwang-Shi Proxy
Signature Scheme . . . . . . . . . . . . 131--134
Jouni Järvinen On the Structure of Rough Approximations 135--153
Herman Midelfart and
Jan Komorowski and
Kristin Nòrsett and
Fekadu Yadetie and
Arne K. Sandovik and
Astrid Lægreid Learning Rough Set Classifiers from Gene
Expressions and Clinical Data . . . . . 155--183
Ferucio \cTiplea and
Erkki Mäkinen and
Dragos Trinc\ua and
Costel Enea Characterization Results for
Time-Varying Codes . . . . . . . . . . . 185--198
Isto Aho New polynomial-time instances to various
knapsack-type problems . . . . . . . . . 199--228
Yun Bai and
Vijay Varadharajan Object Oriented Database with
Authorization Policies . . . . . . . . . 229--250
Salem Benferhat and
Didier Dubois and
Sylvain Lagrue and
Odile Papini Making revision reversible: an approach
based on polynomials . . . . . . . . . . 251--280
Stefan Haar Probabilistic Cluster Unfoldings . . . . 281--314
Juha Honkala A new class of algebraic series having a
decidable equivalence problem . . . . . 315--320
A. Mani Rough Equalities From Posets and Rough
Difference Orders . . . . . . . . . . . 321--333
Lech Polkowski and
Boles\law Araszkiewicz A Rough Set Approach to Estimating the
Game Value and the Shapley Value from
Data . . . . . . . . . . . . . . . . . . 335--343
Krzysztof S\lowi\'nski and
Jerzy Stefanowski and
Dariusz Siwi\'nski Application of Rule Induction and Rough
Sets to Verification of Magnetic
Resonance Diagnosis . . . . . . . . . . 345--363
Dominik \'Slezak Approximate Entropy Reducts . . . . . . 365--390
Tomasz Terlikowski A logical approach to control. The
concept of Inner Implication . . . . . . 391--397
Rafa\l Latkowski On Decomposition for Incomplete Data . . 1--16
Nicolas Peltier Constructing Decision Procedures in
Equational Clausal Logic . . . . . . . . 17--65
Lech Polkowski Rough Mereology: A Rough Set Paradigm
for Unifying Rough Set Theory and Fuzzy
Set Theory . . . . . . . . . . . . . . . 67--88
Marcin Wojnarski LTF-C: Architecture, Training Algorithm
and Applications of New Neural
Classifier . . . . . . . . . . . . . . . 89--105
Hans-Dieter Burkhard and
Gabriela Lindemann and
Peter Starke and
Ludwik Czaja Preface . . . . . . . . . . . . . . . . ??
Uri Abraham and
Tamar Pinhas Exercises in Style (Alpha
Specifications) . . . . . . . . . . . . 107--135
Roberto Barbuti and
Luca Tesei A Decidable Notion of Timed
Non-Interference . . . . . . . . . . . . 137--150
Amin Coja-Oghlan and
Mark-Olivier Stehr Revisiting the Algebra of Petri Net
Processes under the Collective Token
Philosophy . . . . . . . . . . . . . . . 151--164
Ludwik Czaja Proving Nets Correct via Cause-Effect
Structures (An Experiment) . . . . . . . 165--183
Berndt Farwer and
Manfred Kudlek and
Kundan Misra Some Considerations on Higher-Order
Petri Nets . . . . . . . . . . . . . . . 185--193
Nicolette De Francesco and
Antonella Santone and
Luca Tesei Abstract Interpretation and Model
Checking for Checking Secure Information
Flow in Concurrent Systems . . . . . . . 195--211
Magdalena Kacprzak Undecidability of a Multi-Agent Logic 213--220
Michael Köhler and
Heiko Rölke Concurrency in Mobile Object Net Systems 221--235
Ruggero Lanotte and
Andrea Maggiolo-Schettini and
Adriano Peron and
Simone Tini Dynamic Hierarchical Machines . . . . . 237--252
Karsten Schmidt Distributed Verification with LoLA . . . 253--262
Andrzej Skowron and
Jaros\law Stepaniuk and
James F. Peters Rough Sets and Infomorphisms: Towards
Approximation of Relations in
Distributed Environments . . . . . . . . 263--277
Kimmo Varpaaniemi Towards Ambitious Approximation
Algorithms in Stubborn Set Optimization 279--294
Raymond Devillers and
Hanna Klaudel and
Maciej Koutny and
Franck Pommereau Asynchronous Box Calculus . . . . . . . 295--344
Mikhail Ju. Moshkov Classification of Infinite Information
Systems Depending on Complexity of
Decision Trees and Decision Rule Systems 345--368
Tomasz Terlikowski Descriptional independence and the
formal definition of sequential control
structure . . . . . . . . . . . . . . . 369--385
Alicja Wakulicz-Deja and
Piotr Peszek Applying Rough Set Theory to Multi Stage
Medical Diagnosing . . . . . . . . . . . 387--408
Stephen L. Bloom and
Zoltán Ésik Deciding whether the frontier of a
regular tree is scattered . . . . . . . 1--21
Jean-Marc Champarnaud and
Fabien Coulon Theoretical study and implementation of
the canonical automaton . . . . . . . . 23--38
Liviu P. Dinu On the Classification and Aggregation of
Hierarchies with Different Constitutive
Elements . . . . . . . . . . . . . . . . 39--50
Mikhail Ju. Moshkov Compressible Infinite Information
Systems . . . . . . . . . . . . . . . . 51--61
Linh Anh Nguyen A Fixpoint Semantics and an
SLD-Resolution Calculus for Modal Logic
Programs . . . . . . . . . . . . . . . . 63--100
Hans-Dieter Burkhard and
Gabriela Lindemann and
Peter Starke and
Ludwik Czaja Preface . . . . . . . . . . . . . . . . ??
Vladimir A. Bashkin and
Irina A. Lomazova Petri nets and resource bisimulation . . 101--114
Marco Bellia and
Eugenia M. Occhiuto $N$-axioms Parallel Unification . . . . 115--128
Berndt Farwer and
Kundan Misra Modelling with Hierarchical Object Petri
Nets . . . . . . . . . . . . . . . . . . 129--147
Krzysztof Pancerz and
Zbigniew Suraj Synthesis of Petri Net Models: A Rough
Set Approach . . . . . . . . . . . . . . 149--165
Wojciech Penczek and
Alessio Lomuscio Verifying Epistemic Properties of
Multi-agent Systems via Bounded Model
Checking . . . . . . . . . . . . . . . . 167--185
Louchka Popova-Zeugmann and
Matthias Werner and
Jan Richling Using State Equation to Prove
Non-Reachability in Timed Petrinets . . 187--202
Agata Pó\lrola and
Wojciech Penczek and
Maciej Szreter Reachability Analysis for Timed Automata
Using Partitioning Algorithms . . . . . 203--221
Bo\.zena Wo\'zna and
Andrzej Zbrzezny and
Wojciech Penczek Checking Reachability Properties for
Timed Automata via SAT . . . . . . . . . 223--241
Suna Aydin and
Henning Bordihn Sequential Versus Parallel Grammar
Formalisms with Respect to Measures of
Descriptional Complexity . . . . . . . . 243--254
Gianpiero Cattaneo and
Davide Ciucci Shadowed Sets and Related Algebraic
Structures . . . . . . . . . . . . . . . 255--284
Bogdan S. Chlebus and
Leszek Gasieniec and
Andrzej Pelc Deterministic Computations on a PRAM
with Static Processor and Memory Faults 285--306
Cheng-Chi Lee and
Wei-Pang Yang and
Min-Shiang Hwang Untraceable Blind Signature Schemes
Based on Discrete Logarithm Problem . . 307--320
R\uazvan Diaconescu Institution-independent Ultraproducts 321--348
Maciej Kandulski Derived Tree Languages of Nonassociative
Lambek Categorial Grammars with Product 349--362
Sanjiang Li and
Mingsheng Ying Extensionality of the RCC8 Composition
Table . . . . . . . . . . . . . . . . . 363--385
Karsten Weicker and
Nicole Weicker Basic principles for understanding
evolutionary algorithms . . . . . . . . 387--403
Bill Smyth Foreword . . . . . . . . . . . . . . . . ??
Maxime Crochemore and
Costas S. Iliopoulos and
Thierry Lecroq and
Yoan J. Pinzon and
Wojciech Plandowski and
Wojciech Rytter Occurrence and Substring Heuristics for
$ \delta $-Matching . . . . . . . . . . 1--21
Josué Kuri and
Gonzalo Navarro and
Ludovic Mé Fast Multipattern Search Algorithms for
Intrusion Detection . . . . . . . . . . 23--49
Stefan Burkhardt and
Juha Kärkkäinen Better Filtering with Gapped $q$-Grams 51--70
Pierre Nicod\`eme Regexpcount, a symbolic package for
counting problems on regular expressions
and words . . . . . . . . . . . . . . . 71--88
Maxime Crochemore and
Costas S. Iliopoulous and
Yoan J. Pinzon Speeding-up Hirschberg and
Hunt--Szymanski LCS Algorithms . . . . . 89--103
Jesper Jansson and
Andrzej Lingas A Fast Algorithm for Optimal Alignment
between Similar Ordered Trees . . . . . 105--120
Marie-Pierre Béal and
Maxime Crochemore and
Filippo Mignosi and
Antonio Restivo and
Marinella Sciortino Computing forbidden words of regular
languages . . . . . . . . . . . . . . . 121--135
Leszek Gasieniec and
Igor Potapov Time/Space Efficient Compressed Pattern
Matching . . . . . . . . . . . . . . . . 137--154
Foto Afrati and
Hans Leiß and
Michel de Rougemont Definability and Compression . . . . . . 155--180
Inbok Lee and
Kunsoo Park and
Yanghee Choi and
Sung Kwon Chung A Simple and Scalable Algorithm for the
IP Address Lookup Problem . . . . . . . 181--190
Veli Mäkinen Compact Suffix Array --- A
Space-Efficient Full-Text Index . . . . 191--210
Philippe Balbiani Eliminating Unorthodox Derivation Rules
in an Axiom System for Iteration-free
PDL with Intersection . . . . . . . . . 211--242
Hui-Feng Huang and
Chin-Chen Chang An Efficient and Practical (t, n)
Threshold Proxy Signature Scheme with
Known Signers . . . . . . . . . . . . . 243--253
Maurice Margenstern On the Infinigons of the Hyperbolic
Plane, A combinatorial approach . . . . 255--272
Toby Ord and
Tien D. Kieu On the existence of a new family of
Diophantine equations for $ \Omega $ . . 273--284
Arkadiusz Wojna Center-Based Indexing in Vector and
Metric Spaces . . . . . . . . . . . . . 285--310
Rodica Ceterchi and
Radu Gramatovici and
Nata\vsa Jonoska and
K. G. Subramanian Tissue-like $P$ Systems with Active
Membranes for Picture Generation . . . . 311--328
Barbara Dunin-K\ceplicz and
Rineke Verbrugge Evolution of Collective Commitment
during Teamwork . . . . . . . . . . . . 329--371
Tomasz Terlikowski On the Notion of Elementary Description 373--387
Bianca Truthe On the Finiteness of Picture Languages
of synchronous, simple non-deterministic
Chain Code Picture Systems . . . . . . . 389--409
Robert Demolombe An Extended Relational Algebra on
Abstract Objects for Summarizing Answers
to Queries . . . . . . . . . . . . . . . 1--15
Sanjay Jain The Intrinsic Complexity of Learning: A
Survey . . . . . . . . . . . . . . . . . 17--37
Donato Malerba Learning Recursive Theories in the
Normal ILP Setting . . . . . . . . . . . 39--77
Shu-Ching Wang and
Chieng-Fu Cheng Eventually Dual Failure Agreement . . . 79--99
Patrick Doherty and
Andrzej Skowron and
Witold \Lukaszewicz and
Andrzej Sza\las Preface . . . . . . . . . . . . . . . . ??
Didier Dubois and
Sébastien Konieczny and
Henri Prade Quasi-Possibilistic Logic and its
Measures of Information and Conflict . . 101--125
Lluís Godo and
Petr Hájek and
Francesc Esteva A Fuzzy Modal Logic for Belief Functions 127--146
Patrick Doherty and
Micha\l Grabowski and
Witold \Lukaszewicz and
Andrzej Sza\las Towards a Framework for Approximate
Ontologies . . . . . . . . . . . . . . . 147--165
Henrik Grosskreutz and
Gerhard Lakemeyer Probabilistic Complex Actions in GOLOG 167--192
Ewa Madali\'nska-Bugaj and
Witold \Lukaszewicz Formalizing Defeasible Logic in CAKE . . 193--213
Aida Vitória and
Carlos Viegas Damásio and
Jan Ma\luszy\'nski From Rough Sets to Rough Knowledge Bases 215--246
Franz Baader and
Jan Hladik and
Carsten Lutz and
Frank Wolter From Tableaux to Automata for
Description Logics . . . . . . . . . . . 247--279
Paul Harrenstein and
Wiebe van der Hoek and
John-Jules Meyer and
Cees Witteveen A Modal Characterization of Nash
Equilibrium . . . . . . . . . . . . . . 281--321
Andreas Herzig Modal Probability, Belief, and Actions 323--344
Jürgen Dix and
Thomas Eiter and
Michael Fink and
Axel Polleres and
Yingqian Zhang Monitoring Agents using Declarative
Planning . . . . . . . . . . . . . . . . 345--370
Matthias Fichtner and
Axel Großmann and
Michael Thielscher Intelligent Execution Monitoring in
Dynamic Environments . . . . . . . . . . 371--392
Kathrin Konczak and
Torsten Schaub and
Thomas Linke Graphs and Colorings for Answer Set
Programming with Preferences . . . . . . 393--421
Andrea Corradini and
Hans-Jörg Kreowski Preface . . . . . . . . . . . . . . . . ??
Szilvia Gyapay and
Dániel Varró and
Reiko Heckel Graph Transformation with Time . . . . . 1--22
Jurriaan Hage and
Tero Harju and
Emo Welzl Euler Graphs, Triangle-Free Graphs and
Bipartite Graphs in Switching Classes 23--37
Berthold Hoffmann Abstraction and Control for Shapely
Nested Graph Transformation . . . . . . 39--65
Artiom Alhazov and
Carlos Martín-Vide and
Linqiang Pan Solving a PSPACE-Complete Problem by
Recognizing $P$ Systems with Restricted
Active Membranes . . . . . . . . . . . . 67--77
Radim B\velohlávek Fuzzy Closure Operators Induced by
Similarity . . . . . . . . . . . . . . . 79--91
Chao-Wen Chan and
Chin-Chen Chang A New Channel for Image Hiding Based on
Interpolating polynomials . . . . . . . 93--104
Mieczys\law K\llopotek Reasoning and Learning in Extended
Structured Bayesian Networks . . . . . . 105--137
Hui Kou and
Maokang Luo On (weakly) local approximation spaces
of information systems . . . . . . . . . 139--150
Tomasz Terlikowski Risk in Control. On the Notion of Risk
Function . . . . . . . . . . . . . . . . 151--165
Chwei-Shyong Tsai and
Chin-Chen Chang An Improvement to Image Segment Based on
Human Visual System for Object-based
Coding . . . . . . . . . . . . . . . . . 167--178
Chwei-Shyong Tsai and
Chin-Chen Chang A DWT-based Deblocking Technique Based
on Edge Detection and Zero Masking for
Reducing Blocking Effect . . . . . . . . 179--188
Hsien-Chu Wu and
Chin-Chen Chang Hiding Digital Watermarks Using Fractal
Compression Technique . . . . . . . . . 189--202
Martin Kutrib and
Maurice Margenstern and
Hiroshi Umeo Foreword . . . . . . . . . . . . . . . . ??
Petr K\rurka Cellular automata with vanishing
particles . . . . . . . . . . . . . . . 203--221
Klaus Sutner Almost Periodic Configurations on Linear
Cellular Automata . . . . . . . . . . . 223--240
Thomas Worsch Simulations Between Cellular Automata on
Trees Extended by Horizontal Edges . . . 241--260
Chuzo Iwamoto and
Katsuyuki Tateishi and
Kenichi Morita and
Katsunobu Imai Simulations Between Multi-dimensional
Deterministic and Alternating Cellular
Automata . . . . . . . . . . . . . . . . 261--271
Martin Kutrib and
Jan-Thomas Löwe Space- and Time-Bounded Nondeterminism
for Cellular Automata . . . . . . . . . 273--293
Jia Lee and
Susumu Adachi and
Ferdinand Peper and
Kenichi Morita Embedding Universal Delay-Insensitive
Circuits in Asynchronous Cellular Spaces 295--320
Pradipta Maji and
Chandrama Shaw and
Niloy Ganguly and
Biplab K. Sikdar and
P. Pal Chaudhuri Theory and Application of Cellular
Automata For Pattern Classification . . 321--354
Andreas Malcher On One-Way Cellular Automata with a
Fixed Number of Cells . . . . . . . . . 355--368
Maurice Margenstern and
Gencho Skordev Tools for devising cellular automata in
the hyperbolic $3$D space . . . . . . . 369--398
Hidenosuke Nishio and
Takashi Saito Information Dynamics of Cellular
Automata I --- An Algebraic Study . . . 399--420
Hiroshi Umeo and
Naoki Kamikawa Real-Time Generation of Primes by a
$1$-Bit-Communication Cellular Automaton 421--435
Jonathan Burton and
Maciej Koutny and
Giuseppe Pappalardo Relating Communicating Processes with
Different Interfaces . . . . . . . . . . 1--37
Sujata Ghosh and
Mihir Kr. Chakraborty Nonmonotonic Proof Systems: Algebraic
Foundations . . . . . . . . . . . . . . 39--65
Nata\vsa Jonoska and
Maurice Margenstern Tree Operations in $P$ Systems and $
\lambda $-Calculus . . . . . . . . . . . 67--90
Tomasz Terlikowski Risk-type Description of Control
Variants . . . . . . . . . . . . . . . . 91--106
Guoyin Wang and
Qing Liu and
Tsau Young Lin and
Yi Yu Yao and
Lech Polkowski Preface . . . . . . . . . . . . . . . . ??
Jan Bazan and
Hung Son Nguyen and
Marcin Szczuka A View on Rough Set Concept
Approximations . . . . . . . . . . . . . 107--118
J. W. Guan and
D. Y. Liu and
D. A. Bell Discovering Motifs in DNA Sequences . . 119--134
Xiaohua Hu and
T. Y. Lin and
Jianchao Han A New Rough Sets Model Based on Database
Systems . . . . . . . . . . . . . . . . 135--152
Dan Li and
Jitender S. Deogun Interpolation Models for Spatiotemporal
Association Mining . . . . . . . . . . . 153--172
Hongsong Li and
Houkuan Huang and
Youfang Lin DSD: Maintain Data Cubes More
Efficiently . . . . . . . . . . . . . . 173--190
Lawrence J. Mazlack Imperfect Causality . . . . . . . . . . 191--201
Duoqian Miao and
Lishan Hou A Comparison of Rough Set Methods and
Representative Inductive Learning
Algorithms . . . . . . . . . . . . . . . 203--219
Piero Pagliani Pretopologies and Dynamic Spaces . . . . 221--239
Andrzej Skowron and
Piotr Synak Reasoning in Information Maps . . . . . 241--259
Tuan Trung Nguyen Rough Set Approach to Domain Knowledge
Approximation . . . . . . . . . . . . . 261--270
Shusaku Tsumoto Extraction of Structure of Medical
Diagnosis from Clinical Data . . . . . . 271--285
Ling Zhang and
Bo Zhang The Quotient Space Theory of Problem
Solving . . . . . . . . . . . . . . . . 287--298
Zheng Zheng and
Guoyin Wang RRIA: A Rough Set and Rule Tree Based
Incremental Knowledge Acquisition
Algorithm . . . . . . . . . . . . . . . 299--313
Matthias Baaz and
Agata Ciabattoni and
Franco Montagna Analytic Calculi for Monoidal $T$-norm
Based Logic . . . . . . . . . . . . . . 315--332
Stefan Dobrev and
Andrzej Pelc Leader Election in Rings with Nonunique
Labels . . . . . . . . . . . . . . . . . 333--347
Michael Domaratzki Trajectory-Based Embedding Relations . . 349--363
Sven Hartmann and
Sebastian Link and
Klaus-Dieter Schewe and
Bernhard Thalheim Error-Robust Functional Dependencies . . 365--372
Sotiris Moschoyiannis and
Michael W. Shields A Set-Theoretic Framework for Component
Composition . . . . . . . . . . . . . . 373--396
Hans-Dieter Burkhard and
Gabriela Lindemann and
Ludwik Czaja and
Zbigniew Suraj Preface . . . . . . . . . . . . . . . . ??
Antoni Mazurkiewicz Bilateral Ranking Negotiations . . . . . 1--16
Peter D. Mosses Exploiting Labels in Structural
Operational Semantics . . . . . . . . . 17--31
Zdzis\law Pawlak Decision Rules and Dependencies . . . . 33--39
Stanis\law Ambroszkiewicz Entish: A Language for Describing Data
Processing in Open Distributed Systems 41--66
Roberto Barbuti and
Stefano Cataudella and
Luca Tesei Abstract Interpretation Against Races 67--79
Cinzia Bernardeschi and
Nicoletta De Francesco and
Giuseppe Lettieri Concrete and Abstract Semantics to Check
Secure Information Flow in Concurrent
Programs . . . . . . . . . . . . . . . . 81--98
Analoliy Doroshenko and
Georgy Tseitlin Models and Parallel Programming
Abstractions to Enhance Concurrency of
Parallel Programs . . . . . . . . . . . 99--111
Berndt Farwer and
Michael Köhler Mobile Object-Net Systems and their
Processes . . . . . . . . . . . . . . . 113--129
Berndt Farwer and
Manfred Kudlek A New Synchronisation Model for
Multi-Level Object Petri Nets . . . . . 131--142
B. Fryc and
K. Pancerz and
J. F. Peters and
Z. Suraj On Fuzzy Reasoning Using Matrix
Representation of Extended Fuzzy Petri
Nets . . . . . . . . . . . . . . . . . . 143--157
Anna Gomoli\'nska A Graded Meaning of Formulas in
Approximation Spaces . . . . . . . . . . 159--172
Martin Heckel and
Jaroslav Zendulka Data Mining and Its Use in Texture
Analysis . . . . . . . . . . . . . . . . 173--186
Agata Janowska and
Pawe\l Janowski Slicing Timed Systems . . . . . . . . . 187--210
Beata Konikowka and
Wojciech Penczek On Designated Values in Multi-valued
CTL$^*$ Model Checking . . . . . . . . . 211--224
Irina A. Lomazowa Communities of Interacting Automata for
Modelling Distributed Systems with
Dynamic Structure . . . . . . . . . . . 225--235
Edward Ochma\'nski Best Fairness Hierarchy in Elementary
Nets . . . . . . . . . . . . . . . . . . 237--250
Krzysztof Pancerz and
Zbigniew Suraj Discovering Concurrent Models from Data
Tables with the ROSECON System . . . . . 251--268
Micha\l Polak and
Pawe\l Majdzik and
Zbigniew Banaszak and
Robert Wójcik The Performance Evaluation Tool for
Automated Prototyping of Concurrent
Cyclic Processes . . . . . . . . . . . . 269--289
Lech Polkowski and
Maria Semeniuk-Polkowska Some Remarks on Sets of Communicating
Sequential Processes in Topological
Rough Set Framework . . . . . . . . . . 291--305
Agata Pó\lrola and
Wojciech Penczek Minimization Algorithms for Time Petri
Nets . . . . . . . . . . . . . . . . . . 307--331
Roman R. Redziejowski On Associative Omega-Products . . . . . 333--350
Andrzej Skowron and
Piotr Synak Complex Patterns . . . . . . . . . . . . 351--366
Simone Tini and
Andrea Maggiolo-Schettini Compositional Synthesis of Generalized
Mealy Machines . . . . . . . . . . . . . 367--382
Irina B. Virbitskaite and
Natalya S. Gribovskaya Open Maps and Observational Equivalences
for Timed Partial Order Models . . . . . 383--399
Marcin Wolski Galois Connections and Data Analysis . . 401--415
Andrzej Zbrzezny Improvements in SAT-based Reachability
Analysis for Timed Automata . . . . . . 417--434
Stefania Bandini and
Carla Simone Integrating Forms of Interaction in a
Distributed Model . . . . . . . . . . . 1--17
Serge Grigorieff and
Maurice Margenstern Register Cellular Automata in the
Hyperbolic Plane . . . . . . . . . . . . 19--27
Aleksandra Ki\'slak-Malinowska Conjoinability in Pregroups . . . . . . 29--36
Lech Polkowski A Note on $3$-valued Rough Logic
Accepting Decision Rules . . . . . . . . 37--45
Roman R. Redziejowski Asynchronous Circuits, Communicating
Processes, and Muller Automaton . . . . 47--59
Sergiu Rudeanu and
Drago\cs Vaida Semirings in Operations Research and
Computer Science: More Algebra . . . . . 61--85
Zbigniew Suraj Preface . . . . . . . . . . . . . . . . ??
Mikhail Ju. Moshov and
Igor V. Chikalov Consecutive Optimization of Decision
Trees Concerning Various Complexity
Measures . . . . . . . . . . . . . . . . 87--96
Krzysztof Pancerz and
Zbigniew Suraj Discovery of Asynchronous Concurrent
Models from Experimental Tables . . . . 97--116
Roman Pindur and
Robert Susmaga and
Jerzy Stefanowski Hyperplane Aggregation of Dominance
Decision Rules . . . . . . . . . . . . . 117--137
Jaros\law Stepaniuk and
Piotr Ho\'nko Learning First-Order Rules: A Rough Set
Approach . . . . . . . . . . . . . . . . 139--157
Robert Susmaga Reducts and Constructs in Attribute
Reduction . . . . . . . . . . . . . . . 159--181
Jan A. Bergstra and
Cornelis A. Middelburg Located Actions in Process Algebra with
Timing . . . . . . . . . . . . . . . . . 183--211
Yung-Kuan Chan and
Her-Fa Wang and
Chin-Fan Lee A Refined VQ-Based Image Compression
Method . . . . . . . . . . . . . . . . . 213--221
Irina Georgescu Consistency Conditions in Fuzzy
Consumers Theory . . . . . . . . . . . . 223--245
David Janin and
Giacomo Lenzi On the Rlationship Between Monadic and
Weak Monadic Second Order Logic on
Arbitrary Trees, with Applications to
the mu-Calculus . . . . . . . . . . . . 247--265
Ryszard Kozera Asymptotics for Length and Trajectory
from Cumulative Chord Piecewise-Quartics 267--283
Ryszard Kozera and
Lyle Noakes $ C^1 $ Interpolation with Cumulative
Chord Cubics . . . . . . . . . . . . . . 285--301
W\ladys\law Skarbek and
Krzysztof Kucharski and
Miros\law Bober Dual LDA for Face Recognition . . . . . 303--334
W\ladys\law Skarbek and
Thomas Sikora and
Grzegorz Galinski Fast Index Filtering in Vector
Approximation File . . . . . . . . . . . 335--349
Matthias Werner and
Louchka Popova-Zeugmann and
Jan Richling A Method to Prove Non-Reachability in
Priority Duration Petri Nets . . . . . . 351--368
Karol Wnukowicz Image Indexing by Distributed Color
Temperature Descriptions . . . . . . . . 369--378
Yuan-Hui Yu and
Chin-Chen Chang Scenery Image Segmentation Using Support
Vector Machines . . . . . . . . . . . . 379--388
Min-Shiang Hwang and
Jung-Wen Lo and
Chia-Hsin Liu Enhanced of Key Agreement Protocols
Resistant to a Denial-of-Service Attack 389--398
Boris A. Trakhtenbrot Preface . . . . . . . . . . . . . . . . ??
Yoram Hirshfeld and
Alexander Rabinovich Logics for Real Time: Decidability and
Complexity . . . . . . . . . . . . . . . 1--28
Anatol Slissenko A Logic Framework for Verification of
Timed Algorithms . . . . . . . . . . . . 29--67
B. A. Trakhtenbrot Understanding Basic Automata Theory in
the Continuous Time Setting . . . . . . 69--121
D. Pardo and
A. Rabinovich and
B. A. Trakhtenbrot Synchronous Circuits over Continuous
Time: Feedback Reliability and
mpleteness . . . . . . . . . . . . . . . 123--137
Ryszard Janicki Preface . . . . . . . . . . . . . . . . ??
Yves Bontemps and
Pierre-Yves Schobbens and
Christof Löding Synthesis of Open Reactive Systems from
Scenario-Based Specifications . . . . . 139--169
Jordi Cortadella and
Alex Kondratyev and
Luciano Lavagno and
Alexander Taubin and
Yosinori Watanabe Quasi-static Scheduling for Concurrent
Architectures . . . . . . . . . . . . . 171--196
Javier Esparza A Polynomial-Time Algorithm for Checking
Consistency of Free-Choice Signal
Transition Graphs . . . . . . . . . . . 197--220
Victor Khomenko and
Maciej Koutny and
Alex Yakovlev Detecting State Encoding Conflicts in
STG Unfoldings Using SAT . . . . . . . . 221--241
Jean-Pierre Talpin and
Paul Le Guernic and
Sandeep Kumar Shukla and
Frédéric Doucet and
Rajesh Gupta Formal Refinement Checking in a
System-level Design Methodology . . . . 243--273
Chin-Chen Chang and
Piyu Tsai and
Min-Hui Lin An Adaptive Steganographic Scheme for
Color Images . . . . . . . . . . . . . . 275--289
Franck Cassez and
Claire Pagetti and
Olivier Roux A Timed Extension for ALTARICA . . . . . 291--332
Olivier Finkel An $ \omega $-Power of a Finitary
Language Which is a Borel Set of
Infinite Rank . . . . . . . . . . . . . 333--342
Chris A. Johnson Query Compilation under the disjunctive
well-founded semantics . . . . . . . . . 343--368
Marek Karpinski and
Miros\law Kowaluk and
Andrzej Lingas Approximation Algorithms for
MAX-BISECTION on Low Degree Regular
Graphs . . . . . . . . . . . . . . . . . 369--375
Paolo Liberatore and
Marco Schaerf The Compactness of Belief Revision and
Update Operators . . . . . . . . . . . . 377--393
Jacek Marciniec Optimal Unification of Infinite Sets of
Types . . . . . . . . . . . . . . . . . 395--407
Supriya Kumar De A Rough Set Theoretic Approach to
Clustering . . . . . . . . . . . . . . . 409--417
Kimmo Fredriksson and
Jorma Tarhio Efficient String Matching in Huffman
Compressed Texts . . . . . . . . . . . . 1--16
Richard Holzer Knowledge Acquisition under Incomplete
Knowledge using Methods from Formal
Concept Analysis: Part I . . . . . . . . 17--39
Richard Holzer Knowledge Acquisition under Incomplete
Knowledge using Methods from Formal
Concept Analysis: Part II . . . . . . . 41--63
Bo\.zena Wo\'zna ACTLS properties and Bounded Model
Checking . . . . . . . . . . . . . . . . 65--87
Hsien-Chu Wu and
Chin-Chen Chang Embedding Invisible Watermarks into
Digital Images Based on Side-Match
Vector Quantization . . . . . . . . . . 89--106
Anonymous Preface . . . . . . . . . . . . . . . . ??
Onn Shehory Coalition Formation: Towards Feasible
Solutions . . . . . . . . . . . . . . . 107--124
Danny Weyns and
Tom Holvoet A Formal Model for Situated Multi-Agent
Systems . . . . . . . . . . . . . . . . 125--158
Huib Aldewereld and
Wiebe van der Hoek and
John-Jules Meyer Rational Teams: Logical Aspects of
Multi-Agent Systems . . . . . . . . . . 159--183
Wojciech Jamroga and
Wiebe van der Hoek Agents that Know How to Play . . . . . . 185--219
M. Kacprzak and
A. Lomuscio and
W. Penczek From Bounded to Unbounded Model Checking
for Temporal Epistemic Logic . . . . . . 221--240
Antoni Mazurkiewicz Multilateral Ranking Negotiations . . . 241--258
Hendrik Wietze de Haan and
Wim H. Hesselink and
Gerard R. Renardel de Lavalette Knowledge-Based Asynchronous Programming 259--281
Barbara Dunin-K\ceplicz and
Rineke Verbrugge A Tuning Machine for Cooperative Problem
Solving . . . . . . . . . . . . . . . . 283--307
Frank S. de Boer and
Maurizio Gabbrielli and
Maria C. Meo A Timed Linda Language and its
Denotational Semantics . . . . . . . . . 309--330
Gianpiero Cattaneo and
Davide Ciucci and
Roberto Giuntini and
Martin Konig Algebraic Structures Related to Many
Valued Logical Systems. Part I:
Heyting--Wajsberg Algebras . . . . . . . 331--355
Gianpiero Cattaneo and
Davide Ciucci and
Roberto Giuntini and
Martin Konig Algebraic Structures Related to Many
Valued Logical Systems. Part II:
Equivalence Among some Widespread
Structures . . . . . . . . . . . . . . . 357--373
Norbert Dojer Applying term rewriting to partial
algebra theory . . . . . . . . . . . . . 375--384
Marjan Sirjani and
Ali Movaghar and
Amin Shali and
Frank S. de Boer Modeling and Verification of Reactive
Systems using Rebeca . . . . . . . . . . 385--410
C. Calude and
Gh. P\uaun and
G. Rozenberg Contagious Creativity . . . . . . . . . ??
Alexandru T. Balaban Mathematical Chemistry: $ (3, g)$-Cages
with Girth $g$, Topological Indices, and
Other Graph-Theoretical Problems . . . . 1--16
Gemma Bel Enguix and
Maria Dolores Jiménez López Biosyntax. An Overview . . . . . . . . . 17--28
Francesco Bernardini and
Marian Gheorghe and
Vincenzo Manca On $P$ Systems and Almost Periodicity 29--42
Cristian S. Calude and
Sergiu Rudeanu Proving as a Computable Procedure . . . 43--52
Cezar Câmpeanu and
Lila Kari and
Andrei P\uaun Results on Transforming NFA into DFCA 53--63
Matteo Cavaliere and
Drago\cs Sburlan Time and Synchronization in Membrane
Systems . . . . . . . . . . . . . . . . 65--77
Rodica Ceterchi and
Radu Gramatovici On Total Contextual Grammars with
Restricted Choice . . . . . . . . . . . 79--91
Gabriel Ciobanu and
Mihai Gontineac An Automata Description of the Genetic
Message Translation . . . . . . . . . . 93--107
Jürgen Dassow Contextual Grammars with Subregular
Choice . . . . . . . . . . . . . . . . . 109--118
Michael Davidson and
Lucian Ilie Fast Data Compression with
Antidictionaries . . . . . . . . . . . . 119--134
Liviu P. Dinu Rank Distance with Applications in
Similarity of Natural Languages . . . . 135--149
Pál Dömösi and
Manfred Kudlek New Iteration Lemmata for Regular
Languages . . . . . . . . . . . . . . . 151--157
Henning Fernau and
Rudolf Freund and
Markus Holzer Representations of Recursively
Enumerable Array Languages by Contextual
Array Grammars . . . . . . . . . . . . . 159--170
Radu Gramatovici and
Florin Manea Parsing Local Internal Contextual
Languages with Context-Free Choice . . . 171--183
Tom Head Does Light Direct Life Toward Cosmic
Awareness? . . . . . . . . . . . . . . . 185--189
Florentin Ipate and
Tudor B\ual\uanescu Refinement in Finite State Machine
Testing . . . . . . . . . . . . . . . . 191--203
Florentin Ipate and
Mike Holcombe Complete Testing from a Stream
$X$-Machine Specification . . . . . . . 205--216
Tomasz Jurdzi\'nski and
Friedrich Otto and
Franti\vsek Mráz and
Martin Plátek Deterministic Two-Way Restarting
Automata and Marcus Contextual Grammars 217--228
Martin Kappes On the Relationship Between Multiple
Brackets and Selector Languages in
Bracketed Contextual Grammars . . . . . 229--239
Shankara Narayanan Krishna and
R. Rama and
H. Ramesh Further Results on Contextual and
Rewriting $P$ Systems . . . . . . . . . 241--253
Manfred Kudlek On Probabilistic Contextual Grammars . . 255--260
Vincenzo Manca On the Logic and Geometry of Bilinear
Forms . . . . . . . . . . . . . . . . . 261--273
Radu Mardare and
Corrado Priami Logical Analysis of Biological Systems 275--289
Maurice Margenstern and
Sergey Verlan and
Yurii Rogozhin Time-Varying Distributed $H$ Systems: An
Overview . . . . . . . . . . . . . . . . 291--306
Victor Mitrana Marcus External Contextual Grammars:
From One to Many Dimensions . . . . . . 307--316
Madhu Mutyam and
Kamala Krithivasan and
A. Siddhartha Reddy On Characterizing Recursively Enumerable
Languages by Insertion Grammars . . . . 317--324
Miroslav Novotný Construction of Contextual Grammars . . 325--340
Alexander Okhotin and
Kai Salomaa Contextual Grammars with Uniform Sets of
Trajectories . . . . . . . . . . . . . . 341--351
Gheorghe P\uaun and
Mario J. Pérez-Jiménez and
Juan Pazos and
Alfonso Rodríguez-Patón Symport/Antiport $P$ Systems with Three
Objects Are Universal . . . . . . . . . 353--367
Zdzis\law Pawlak Flow Graphs and Intelligent Data
Analysis . . . . . . . . . . . . . . . . 369--377
Lech Polkowski and
Maria Semeniuk-Polkowska On Rough Set Logics Based on Similarity
Relations . . . . . . . . . . . . . . . 379--390
Arto Salomaa On the Injectivity of Parikh Matrix
Mappings . . . . . . . . . . . . . . . . 391--404
Giuseppe Scollo $ \omega $-rewriting the Collatz Problem 405--416
Andrzej Skowron Rough Sets and Vague Concepts . . . . . 417--431
Doina Tatar Word Sense Disambiguation by Machine
Learning Approach: A Short Survey . . . 433--442
Mark R. Titchener and
Radu Nicolescu and
Ludwig Staiger and
Aaron Gulliver and
Ulrich Speidel Deterministic Complexity and Entropy . . 443--461
Ioan Tomescu Asymptotic Properties of the Factors of
Words Over a Finite Alphabet . . . . . . 463--470
Sheng Yu State Complexity: Recent Results and
Open Problems . . . . . . . . . . . . . 471--480
Martin Hofmann and
Pawe\l Urzyczyn Typed Lambda Calculi and Applications
2003, Selected Papers . . . . . . . . . ??
Michael Abbott and
Thorsten Altenkirch and
Conor McBride and
Neil Ghani $ \partial $ for Data: Differentiating
Data Structures . . . . . . . . . . . . 1--28
Roberto M. Amadio Synthesis of max-plus
quasi-interpretations . . . . . . . . . 29--60
Frédéric Blanqui Inductive types in the Calculus of
Algebraic Constructions . . . . . . . . 61--86
Paolo Coppola and
Simona Ronchi della Rocca Principal Typing for Lambda Calculus in
Elementary Affine Logic . . . . . . . . 87--112
Thierry Coquand and
Randy Pollack and
Makoto Takeyama A Logical Framework with Dependently
Typed Records . . . . . . . . . . . . . 113--134
Thierry Joly On $ \lambda $-Definability I: the Fixed
Model Problem and Generalizations of the
Matching Problem . . . . . . . . . . . . 135--151
Yoshihiko Kakutani and
Masahito Hasegawa Parameterizations and Fixed-Point
Operators on Control Categories . . . . 153--172
Jim Laird Sequentiality in Bounded Biorders . . . 173--191
Ernst-Erich Doberkat Tracing Relations Probabilistically . . 193--209
Hartmut Ehrig Behaviour and Instantiation of
High-Level Petri Net Processes . . . . . 211--247
A. Mani Super Rough Semantics . . . . . . . . . 249--261
Jerzy Mycka Real Recursive Functions and Baire
Classes . . . . . . . . . . . . . . . . 263--278
Sergey Verlan and
Maurice Margenstern About Splicing $P$ Systems with One
Membrane . . . . . . . . . . . . . . . . 279--290
Chi-Shiang Chan and
Chin-Chen Chang An Image Hiding Scheme Based on
Multi-bit-reference Substitution Table
Using Dynamic Programming Strategy . . . 291--305
Irina Georgescu Revealed Preference, Congruence and
Rationality: A Fuzzy Approach . . . . . 307--328
Sanjiang Li and
Mingsheng Ying and
Yongming Li On countable RCC models . . . . . . . . 329--351
Tzu-Chuen Lu and
Chin-Chen Chang Data Compressor for VQ Index Tables . . 353--371
Adrien Richard and
Jean-Paul Comet and
Gilles Bernot R. Thomas' Modeling of Biological
Regulatory Networks: Introduction of
Singular States in the Qualitative
Dynamics . . . . . . . . . . . . . . . . 373--392
Takashi Washio and
Luc De Raedt and
Joost N. Kok Advances in Mining Graphs, Trees and
Sequences . . . . . . . . . . . . . . . ??
Sébastien Ferré and
Ross D. King A Dichotomic Search Algorithm for Mining
and Learning in Domain-Specific Logics 1--32
Mohammed J. Zaki Efficiently Mining Frequent Embedded
Unordered Trees . . . . . . . . . . . . 33--52
Akihiro Inokuchi and
Takashi Washio and
Hiroshi Motoda A General Framework for Mining Frequent
Subgraphs from Labeled Graphs . . . . . 53--82
Lawrence Holder and
Diane Cook and
Jeff Coble and
Maitrayee Mukherjee Graph-based Relational Learning with
Application to Security . . . . . . . . 83--101
Amaury Habrard and
Marc Bernard and
Marc Sebban Detecting Irrelevant Subtrees to Improve
Probabilistic Learning from
Tree-structured Data . . . . . . . . . . 103--130
Warodom Geamsakul and
Tetsuya Yoshida and
Kouzou Ohara and
Hiroshi Motoda and
Hideto Yokoi and
Katsuhiko Takabayashi Constructing a Decision Tree for
Graph-Structured Data and its
Applications . . . . . . . . . . . . . . 131--160
Yun Chi and
Richard R. Muntz and
Siegfried Nijssen and
Joost N. Kok Frequent Subtree Mining --- An Overview 161--198
Tomasz Borzyszkowski Generalized Interpolation in First Order
Logic . . . . . . . . . . . . . . . . . 199--219
Raymond Devillers and
Hanna Klaudel Synchronous and Asynchronous
Communications in Composable
Parameterized High-Level Petri Nets . . 221--257
Ernst-Erich Doberkat Tracing Relations Probabilistically . . 259--275
Olivier Finkel On Winning Conditions of High Borel
Complexity in Pushdown Games . . . . . . 277--298
Albina Moshkova On Effective Methods for Diagnosis of
Retaining Faults in Circuits . . . . . . 299--313
Alberto Pettorossi and
Maurizio Proietti Program Transformation: Theoretical
Foundations and Basic Techniques. Part 1 ??
Alcino Cunha and
Jorge Sousa Pinto Point-free Program Transformation . . . 315--352
Jeremy Gibbons and
Graham Hutton Proof Methods for Corecursive Programs 353--366
Robert Glück and
Masahiko Kawabe A Method for Automatic Program Inversion
Based on LR(0) Parsing . . . . . . . . . 367--395
Olivier Danvy and
Mayer Goldberg There and Back Again . . . . . . . . . . 397--413
Bjórn Lisper Infinite Unfolding and Transformations
of Nondeterministic Programs . . . . . . 415--439
Hans-Dieter Burkhard and
Ludwik Czaja and
Gabriela Lindemann and
Zbigniew Suraj Concurrency Specification and
Programming . . . . . . . . . . . . . . ??
Roberto Barbuti and
Stefano Cataudella Abstract Interpretation of an Object
Calculus for Synchronization
Optimizations . . . . . . . . . . . . . 1--12
Roberto Barbuti and
Stefano Cataudella and
Andrea Maggiolo-Schettini and
Paolo Milazzo and
Angelo Troina A Probabilistic Model for Molecular
Systems . . . . . . . . . . . . . . . . 13--27
Marco Bellia and
M. Eugenia Occhiuto Higher order Programming in Java:
Introspection, Subsumption and
Extraction . . . . . . . . . . . . . . . 29--44
Ludwik Czaja An Axiomatic Framework for Proving
Correctness of Nets . . . . . . . . . . 45--64
Berndt Farwer and
Michael Köhler Petri Net Processes for Zero-Safe Nets 65--75
Anna Gomoli\'nska Satisfiability and Meaning of Formulas
and Sets of Formulas in Approximation
Spaces . . . . . . . . . . . . . . . . . 77--92
Barbara Klunder and
Edward Ochma\'nski and
Krystyna Stawikowska On Star-Connected Flat Languages . . . . 93--105
Sergiy Kryvyy and
Lyudmila Matvyeyeva and
Mariya Lopatina Automatic Modeling and Analysis of
MSC-specified Systems . . . . . . . . . 107--120
Manfred Kudlek Probability in Petri Nets . . . . . . . 121--130
Rafa\l Latkowski Flexible Indiscernibility Relations for
Missing Attribute Values . . . . . . . . 131--147
Louchka Popova-Zeugmann and
Monika Heiner and
Ina Koch Time Petri Nets for Modelling and
Analysis of Biochemical Networks . . . . 149--162
Louchka Popova-Zeugmann and
Matthias Werner Extreme Runtimes of Schedules Modelled
by Time Petri Nets . . . . . . . . . . . 163--174
Roman R. Redziejowski Associative Omega-products of Traces . . 175--185
Kay Schröter and
Diemo Urbig and
Nora Hans Social Formation of Negotiation Space
and Groups for Non-Isolated Multilateral
Negotiations . . . . . . . . . . . . . . 187--201
Jaros\law Stepaniuk and
Jan G. Bazan and
Andrzej Skowron Modelling Complex Patterns by
Information Systems . . . . . . . . . . 203--217
Zbigniew Suraj and
James F. Peters and
Piotr Grochowalski A Controller Design for the Khepera
Robot: A Rough Set Approach . . . . . . 219--231
Zbigniew Suraj and
Krzysztof Pancerz Restriction-Based Concurrent System
Design Using the Rough Set Formalism . . 233--247
Piotr Synak and
Jan G. Bazan and
Andrzej Skowron and
James F. Peters Spatio-Temporal Approximate Reasoning
over Complex Objects . . . . . . . . . . 249--269
Diemo Urbig Weight-Based Negotiation Mechanisms:
Balancing Personal Utilities . . . . . . 271--285
Dobies\law Wróblewski Universal Semi-local Election Protocol
Using Forward Links . . . . . . . . . . 287--301
Andrzej Zbrzezny SAT-based Reachability Checking for
Timed Automata with Diagonal Constraints 303--322
Françoise Gire and
Corinne Plourde A New Partial Semantics for Disjunctive
Deductive Databases . . . . . . . . . . 323--342
Ryszard Janicki and
Alan Wassyng Tabular Expressions and Their Relational
Semantics . . . . . . . . . . . . . . . 343--370
Ionu\ct Popa KDS-transformation for Data Compression 371--375
Jian Xu and
Jeffery Zucker First and Second Order Recursion on
Abstract Data Types . . . . . . . . . . 377--419
Mariusz Boryczka Eliminating Introns in Ant Colony
Programming . . . . . . . . . . . . . . 1--19
Alfredo Burrieza and
Manuel Ojeda-Aciego A Multimodal Logic Approach to Order of
Magnitude Qualitative Reasoning with
Comparability and Negligibility
Relations . . . . . . . . . . . . . . . 21--46
Eugene Eberbach \$-Calculus of Bounded Rational Agents:
Flexible Optimization as Search under
Bounded Resources in Interactive Systems 47--102
Harald Fecher and
Mila Majster-Cederbaum Event Structures for Arbitrary
Disruption . . . . . . . . . . . . . . . 103--130
Mark-Oliver Stehr The Open Calculus of Constructions (Part
I): An Equational Type Theory with
Dependent Types for Programming,
Specification, and Interactive Theorem
Proving . . . . . . . . . . . . . . . . 131--174
Józef Winkowski Towards a Framework for Modelling
Systems with Rich Internal Structures of
States and Processes . . . . . . . . . . 175--206
Chin-Chen Chang and
Chi-Shiang Chan An Inverse Halftoning Technique Using
Modified Look-Up Tables . . . . . . . . 207--220
Ewa Palka On Finite Model Property of the
Equational Theory of Kleene Algebras . . 221--230
Michael Stay Very Simple Chaitin Machines for
Concrete AIT . . . . . . . . . . . . . . 231--247
Mark-Oliver Stehr The Open Calculus of Constructions (Part
II): An Equational Type Theory with
Dependent Types for Programming,
Specification, and Interactive Theorem
Proving . . . . . . . . . . . . . . . . 249--288
Guoyin Y. Wang and
Jun Zhao and
Jiujiang An and
Yu Wu A Comparative Study of Algebra Viewpoint
and Information Viewpoint in Attribute
Reduction . . . . . . . . . . . . . . . 289--301
Igor Bocharov and
Pavel Lukin Information Divergence Criterion in
Speech Signal Recognition . . . . . . . 303--313
Chih-Yang Lin and
Chin-Chen Chang and
Chia-Chen Lin A New Density-Based Scheme for
Clustering Based on Genetic Algorithm 315--331
Timo Poranen A Genetic Hillclimbing Algorithm for the
Optimal Linear Arrangement Problem . . . 333--356
Guilin Qi and
Peter Milligan and
Paul Sage Incidence Calculus on \Lukasiewicz's
Three-valued Logic . . . . . . . . . . . 357--378
Marcin Sydow Random Surfer with Back Step . . . . . . 379--398
Hsien-Chu Wu and
Min-Shiang Hwang and
Chia-Hsin Liu A Secure Strong-Password Authentication
Protocol . . . . . . . . . . . . . . . . 399--406
Alberto Pettorossi and
Maurizio Proietti Program Transformation: Theoretical
Foundations and Basic Techniques. Part 2 ??
Wei-Ngan Chin and
Siau-Cheng Khoo and
Neil Jones Redundant Call Elimination via Tupling 1--37
Geoff W. Hamilton Higher Order Deforestation . . . . . . . 39--61
Patricia Johann and
Janis Voigtländer The Impact of seq on Free Theorems-Based
Program Transformations . . . . . . . . 63--102
Chiyan Chen and
Rui Shi and
Hongwei Xi Implementing Typeful Program
Transformations . . . . . . . . . . . . 103--121
Martin Bravenboer and
Arthur van Dam and
Karina Olmos and
Eelco Visser Program Transformation with Scoped
Dynamic Rewrite Rules . . . . . . . . . 123--178
Andy King and
Jonathan C. Martin Control Generation by Program
Transformation . . . . . . . . . . . . . 179--218
David A. Rosenblueth A Multiple-Clause Folding Rule Using
Instantiation and Generalization . . . . 219--249
Stefania Bandini and
Giancarlo Mauri and
Giuseppe Vizzari Supporting Action-at-a-distance in
Situated Cellular Agents . . . . . . . . 251--271
Dariusz Dereniowski and
Marek Kubale Efficient Parallel Query Processing by
Graph Ranking . . . . . . . . . . . . . 273--285
B. Gerla and
I. Leu\cstean Similarity MV-algebras . . . . . . . . . 287--300
Michael Kaminski and
Tony Tan Regular Expressions for Languages over
Infinite Alphabets . . . . . . . . . . . 301--318
Ching-Lin Wang and
Ren-Hung Hwang and
Yung-Kuan Chan and
Chih-Ya Chen and
Chuan-Chung Cheng An Image Retrieval System Based on the
Color, Areas, and Perimeters of Objects 319--330
Gui-Long Liu The Axiomatization of the Rough Set
Upper Approximation Operations . . . . . 331--342
Zbigniew Suraj and
Pawel Delimata On $k$-NN Method with Preprocessing . . 343--358
Davide Ciucci On the Axioms of Residuated Structures:
Independence, Dependencies and Rough
Approximations . . . . . . . . . . . . . 359--387
Floriana Esposito and
Nicola Fanizzi and
Stefano Ferilli and
Teresa M. A. Basile and
Nicola Di Mauro Multistrategy Operators for Relational
Learning and Their Cooperation . . . . . 389--409
Jacek Pomyka\la and
S\lawomir Barabasz Eliptic Curve Based Threshold Proxy
Signature Scheme with Known Signers . . 411--425
Lirong Xia and
Sanjiang Li On minimal models of the Region
Connection Calculus . . . . . . . . . . 427--446
Ryszard Janicki Special Issueon Application of
Concurrency to System Design . . . . . . ??
Dag Björklund and
Johan Lilius Rialto to B: An Exercise in Formal
Development of a Language for Multiple
Models of Computation . . . . . . . . . 1--20
Hemangee K. Kapoor and
Mark B. Josephs and
Dennis P. Furey Verification and Implementation of
Delay-Insensitive Processes in
Restrictive Environments . . . . . . . . 21--48
Victor Khomenko and
Maciej Koutny and
Alex Yakovlev Logic Synthesis for Asynchronous
Circuits Based on STG Unfoldings and
Incremental SAT . . . . . . . . . . . . 49--73
Mark Lawford and
Vera Pantelic and
Hong Zhang Towards Integrated Verification of Timed
Transition Models . . . . . . . . . . . 75--110
Kevin Seppi and
Michael Jones and
Peter Lamborn Guided Model Checking with a Bayesian
Meta-heuristic . . . . . . . . . . . . . 111--126
Heikki Tauriainen Nested Emptiness Search for Generalized
Büchi Automata . . . . . . . . . . . . . 127--154
Fei Xia and
Fei Hao and
Ian Clark and
Alex Yakovlev and
E. Graeme Chester Buffered Asynchronous Communication
Mechanisms . . . . . . . . . . . . . . . 155--170
Chin-Chen Chang and
Jun-Chou Chuang and
Yu-Chen Hu Spatial Domain Image Hiding Scheme Using
Pixel-Values Differencing . . . . . . . 171--184
Chin-Chen Chang and
Chih-Yang Lin and
Henry Chou Perfect Hashing Schemes for Mining
Traversal Patterns . . . . . . . . . . . 185--202
Raymond Devillers and
Hanna Klaudel and
Maciej Koutny Petri Net Semantics of the Finite $ \pi
$-calculus Terms . . . . . . . . . . . . 203--226
Olivier Gasquet On the Influence of Confluence in Modal
Logics . . . . . . . . . . . . . . . . . 227--250
Yu-Chen Hu and
Chin-Chen Chang An Improved Tree-Structured Codebook
Search Algorithm for Grayscale Image
Compression . . . . . . . . . . . . . . 251--260
Wojciech Jaworski Bounds for Validation . . . . . . . . . 261--275
Attila Sali and
Klaus-Dieter Schewe Counter-Free Keys and Functional
Dependencies in Higher-Order Datamodels 277--301
Rudolf Berghammer and
Alexander Fronk Exact Computation of Minimum Feedback
Vertex Sets with Relational Algebra . . 301--316
Yu-Chen Hu and
Min-Hui Lin and
Ji-Han Jiang A Novel Color Image Hiding Scheme Using
Block Truncation Coding . . . . . . . . 317--331
A. Mani Di-Algebraic Semantics of Logics . . . . 333--350
Linh Anh Nguyen Negative Ordered Hyper-Resolution as a
Proof Procedure for Disjunctive Logic
Programming . . . . . . . . . . . . . . 351--366
Vladimir Pestov and
Aleksandar Stojmirovi\'c Indexing Schemes for Similarity Search:
an Illustrated Paradigm . . . . . . . . 367--385
Hsu-Chun Yen and
Lien-Po Yu Decidability Analysis of
Self-Stabilization for Infinite-State
Systems . . . . . . . . . . . . . . . . 387--402
Anonymous Preface . . . . . . . . . . . . . . . . ??
Mariusz Flasi\'nski and
Janusz Jurek On the Analysis of Fuzzy String Patterns
with the Help of Extended and Stochastic
GDPLL(k) Grammars . . . . . . . . . . . 1--14
Marek Grochowski and
Robert Schaefer and
Maciej Smo\lka Architectural Principles and Scheduling
Strategies for Computing Agent Systems 15--26
Jaros\law Ko\'zlak and
Jean-Charles Créput and
Vincent Hilaire and
Abder Koukam Multi-agent Approach to Dynamic Pick-up
and Delivery Problem with Uncertain
Knowledge about Future Transport Demands 27--36
Edward Nawarecki and
Marek Kisiel-Dorohinicki and
Grzegorz Dobrowolski Architecture for Discovery of Crises in
MAS . . . . . . . . . . . . . . . . . . 37--47
Lech Polkowski A Set Theory for Rough Sets. Toward A
Formal Calculus of Vague Statements . . 49--61
Jerzy Stefanowski An Empirical Study of Using Rule
Induction and Rough Sets to Software
Cost Estimation . . . . . . . . . . . . 63--82
Zbigniew Suraj and
Barbara Fryc Timed Approximate Petri Nets . . . . . . 83--99
Zbigniew Suraj and
Barbara Fryc and
Zofia Matusiewicz and
Krzysztof Pancerz A Petri Net System --- an Overview . . . 101--120
Zbigniew Suraj and
Krzysztof Pancerz Reconstruction of Concurrent System
Models Described by Decomposed Data
Tables . . . . . . . . . . . . . . . . . 121--137
Mohua Banerjee Logic for Rough Truth . . . . . . . . . 139--151
J. A. Bergstra and
C. A. Middelburg Thread Algebra with Multi-Level
Strategies . . . . . . . . . . . . . . . 153--182
Francesco Calimeri and
Wolfgang Faber and
Gerald Pfeifer and
Nicola Leone Pruning Operators for Disjunctive Logic
Programming Systems . . . . . . . . . . 183--214
Chin-Chen Chang and
Guei-Mei Chen and
Yu-Chen Hu A Novel Index Coding Scheme for Vector
Quantization . . . . . . . . . . . . . . 215--227
Jurek Czyzowicz and
Dariusz Kowalski and
Euripides Markou and
Andrzej Pelc Complexity of Searching for a Black Hole 229--242
Kees van Hee and
Natalia Sidorova and
Marc Voorhoeve Resource-Constrained Workflow Nets . . . 243--257
Costas S. Iliopoulos and
Christos Makris and
Yannis Panagis and
Katerina Perdikuri and
Evangelos Theodoridis and
Athanasios Tsakalidis The Weighted Suffix Tree: An Efficient
Data Structure for Handling Molecular
Weighted Sequences and its Applications 259--277
Mihai Ionescu and
Gheorghe P\uaun and
Takashi Yokomori Spiking Neural $P$ Systems . . . . . . . 279--308
Karel De Loof and
Hans De Meyer and
Bernard De Baets Exploiting the Lattice of Ideals
Representation of a Poset . . . . . . . 309--321
James F. Peters and
Christopher Henry Reinforcement Learning with
Approximation Spaces . . . . . . . . . . 323--349
Ming-Ni Wu and
Chia-Chen Lin and
Chin-Chen Chang A Robust Content-Based Copy Detection
Scheme . . . . . . . . . . . . . . . . . 351--366
Gregory Chaitin Probability and Program-Size for
Functions . . . . . . . . . . . . . . . 367--370
Henning Christiansen and
Davide Martinenghi On Simplification of Database Integrity
Constraints . . . . . . . . . . . . . . 371--417
Norihiro Kamide Foundations of Paraconsistent Resolution 419--441
Chia-Chen Lin and
Yu Chen Hu and
Chin-Chen Chang A Novel Image Ownership Protection
Scheme Based on Rehashing Concept and
Vector Quantization . . . . . . . . . . 443--451
L. Kari and
E. Losseva and
S. Konstantinidis and
P. Sosík and
G. Thierrin A Formal Language Analysis of DNA
Hairpin Structures . . . . . . . . . . . 453--475
Michael Winter On Problems in Polymorphic
Object-Oriented Languages With Self
Types and Matching . . . . . . . . . . . 477--491
Sheng Zhong An Efficient and Secure Cryptosystem for
Encrypting Long Messages . . . . . . . . 493--497
Anonymous Concurrency Specification and
Programming (CS&P) . . . . . . . . . . . ??
Maria V. Andreeva and
Irina B. Virbitskaite Observational Equivalences for Timed
Stable Event Structures . . . . . . . . 1--19
Roberto Barbuti and
Andrea Maggiolo-Schettini and
Paolo Milazzo and
Angelo Troina A Calculus of Looping Sequences for
Modelling Microbiological Systems . . . 21--35
Jan G. Bazan Behavioral Pattern Identification
Through Rough Set Modeling . . . . . . . 37--50
Marek A. Bednarczyk and
Wojciech Jamroga and
Wies\law Paw\lowski Expressing and Verifying Temporal and
Structural Properties of Mobile Agents 51--63
Piotr Chrz\kastowski-Wachtel Determining Sound Markings in Structured
Nets . . . . . . . . . . . . . . . . . . 65--79
Ludwik Czaja Equations for message passing . . . . . 81--93
Anatoliy Doroshenko and
Ruslan Shevchenko A Rewriting Framework for Rule-Based
Programming Dynamic Applications . . . . 95--108
Berndt Farwer and
Michael Köhler Modelling Global and Local Name Spaces
for Mobile Agents Using Object Nets . . 109--122
Berndt Farwer and
Mauricio Varea Separation of Control and Data Flow in
High-Level Petri Nets: Transforming Dual
Flow Nets into Object Petri Nets . . . . 123--137
Anna Gomoli\'nska Possible Rough Ingredients of Concepts
in Approximation Spaces . . . . . . . . 139--154
Franciszek Grabowski and
Dominik Strzalka Dynamic Behavior of Simple Insertion
Sort Algorithm . . . . . . . . . . . . . 155--165
Damas P. Gruska Network Information Flow . . . . . . . . 167--180
Agata Janowska and
Pawe\l Janowski Slicing of Timed Automata with Discrete
Data . . . . . . . . . . . . . . . . . . 181--195
Magdalena Kacprzak A Strong Completeness Result for a MAS
Logic . . . . . . . . . . . . . . . . . 197--213
Magdalena Kacprzak and
Alessio Lomuscio and
Artur Niewiadomski and
Wojciech Penczek and
Franco Raimondi and
Maciej Szreter Comparing BDD and SAT Based Techniques
for Model Checking Chaum's Dining
Cryptographers Protocol . . . . . . . . 215--234
Barbara Klunder Star-Connected Flat Languages and
Automata . . . . . . . . . . . . . . . . 235--243
Michael Köhler and
Heiko Rölke Properties of Super-Dual Nets . . . . . 245--254
Manfred Kudlek On Quantum Vector Addition Systems . . . 255--261
Miros\law Kurkowski and
Marian Srebrny A Quantifier-free First-order Knowledge
Logic of Authentication . . . . . . . . 263--282
Agnieszka Nowak and
Alicja Wakulicz-Deja and
Sebastian Bachli\'nski Optimization of Speech Recognition by
Clustering of Phones . . . . . . . . . . 283--293
Trung Thanh Nguyen and
Claire P. Willis and
Derek J. Paddon and
Sinh Hoa Nguyen and
Hung Son Nguyen Learning Sunspot Classification . . . . 295--309
Edward Ochma\'nski and
Joanna Pieckowska Trace Nets and Conflict-free
Computations . . . . . . . . . . . . . . 311--321
Edward Ochma\'nski and
Krystyna Stawikowska Star-free Star and Trace Languages . . . 323--331
Roman R. Redziejowski Associative Omega-product of Processes 333--345
N. V. Shilov and
N. O. Garanina and
K.-M. Choe Update and Abstraction in Model Checking
of Knowledge and Branching Time . . . . 347--361
Andrzej Skowron and
Jaros\law Stepaniuk and
James Peters and
Roman Swiniarski Calculi of Approximation Spaces . . . . 363--378
Jerzy Stefanowski and
Szymon Wilk Rough Sets for Handling Imbalanced Data:
Combining Filtering and Rule-based
Classifiers . . . . . . . . . . . . . . 379--391
Zbigniew Suraj and
Neamat El Gayar and
Pawel Delimata A Rough Set Approach to Multiple
Classifier Systems . . . . . . . . . . . 393--406
Józef Winkowski An Axiomatic Characterization of
Algebras of Processes of Petri Nets . . 407--420
Marcin Wolski Complete Orders, Categories and Lattices
of Approximations . . . . . . . . . . . 421--435
Simon Collings and
Ryszard Kozera and
Lyle Noakes Surface Properties from $N$-Views of a
Strictly Convex Solid . . . . . . . . . 437--452
Kimmo Fredriksson On-line Approximate String Matching in
Natural Language . . . . . . . . . . . . 453--466
Andrei P\uaun and
Bianca Popa $P$ Systems with Proteins on Membranes 467--483
Petros Potikas and
Panos Rondogiannis and
Manolis Gergatsoulis A Value-propagating Transformation
Technique for Datalog Programs Based on
Non-Deterministic Constructs . . . . . . 485--527
Haifeng Shen and
Qunxia Li and
Jun Guo and
Gang Liu Model-Based Feature Compensation for
Robust Speech Recognition . . . . . . . 529--539
Anonymous Trajectories of Language Theory . . . . ??
Cristian S. Calude and
Cezar Câmpeanu and
Monica Dumitrescu Automata Recognizing No Words: A
Statistical Approach . . . . . . . . . . 1--18
Rodica Ceterchi An Algebraic Characterization of
Semi-Simple Splicing . . . . . . . . . . 19--25
Gabriel Ciobanu and
Gheorghe P\uaun and
Mario J. Pérez-Jiménez On the Branching Complexity of $P$
Systems . . . . . . . . . . . . . . . . 27--36
Erzsébet Csuhaj-Varjú and
Alexandru Mateescu On a Connection Between Cooperating
Distributed Grammar Systems and Basic
Process Algebra . . . . . . . . . . . . 37--50
Cunsheng Ding and
Arto Salomaa Secret Sharing Schemes with Nice Access
Structures . . . . . . . . . . . . . . . 51--63
Cunsheng Ding and
Arto Salomaa On Some Problems of Mateescu Concerning
Subword Occurrences . . . . . . . . . . 65--79
Michael Domaratzki and
Grzegorz Rozenberg and
Kai Salomaa Interpreted Trajectories . . . . . . . . 81--97
Manfred Droste and
Jarkko Kari and
Paula Steinby Observations on the Smoothness
Properties of Real Functions Computed by
Weighted Finite Automata . . . . . . . . 99--106
Sorina Dumitrescu Faster Algorithm for Designing Optimal
Prefix-Free Codes with Unequal Letter
Costs . . . . . . . . . . . . . . . . . 107--117
Vesa Halava and
Tero Harju and
Juhani Karhumäki Undecidability in $ \omega $-Regular
Languages . . . . . . . . . . . . . . . 119--125
Juha Honkala On the Problem Whether the Image of an
$N$-Rational Series Equals . . . . . . . 127--132
Oscar H. Ibarra and
Sara Woodworth and
Hsu-Chun Yen and
Zhe Dang On the Computational Power of
$1$-Deterministic and Sequential $P$
Systems . . . . . . . . . . . . . . . . 133--152
Lucian Ilie and
Cristian Popescu The Shortest Common Superstring Problem
and Viral Genome Compression . . . . . . 153--164
Lila Kari and
Elena Losseva Block Substitutions and Their Properties 165--178
Miika Langille and
Ion Petre Simple Gene Assembly Is Deterministic 179--190
Florin Manea and
Victor Mitrana and
Daniel-Claudian Voinescu Synchronized Shuffle on Backbones . . . 191--202
Solomon Marcus Mild Context-Sensitivity, After Twenty
Years . . . . . . . . . . . . . . . . . 203--204
Alexandru Mateescu and
Rudolf Freund Routes and Products of Monoids . . . . . 205--211
Gheorghe P\uaun and
Radu P\uaun Membrane Computing and Economics:
Numerical $P$ Systems . . . . . . . . . 213--227
Azaria Paz A Property of Independency Relations
Induced by Probabilistic Distributions
with Binary Variables . . . . . . . . . 229--236
Nicolae Santean and
Sheng Yu Nondeterministic Bimachines and Rational
Relations with Finite Codomain . . . . . 237--264
Virgil Nicolae \cSerb\uanu\ct\ua and
Traian Florin \cSerb\uanu\ct\ua Injectivity of the Parikh Matrix
Mappings Revisited . . . . . . . . . . . 265--283
Gheorghe Stefanescu Interactive Systems with Registers and
Voices . . . . . . . . . . . . . . . . . 285--305
Drago\cs Vaida Note on Some Order Properties Related to
Processes Semantics (I) . . . . . . . . 307--319
Anastasia Analyti and
Ioannis Pachoulakis Logic Programming Representation of the
Compound Term Composition Algebra . . . 321--360
Liviu P. Dinu and
Andrea Sgarro A Low-complexity Distance for DNA
Strings . . . . . . . . . . . . . . . . 361--372
Yu-Chen Hu Multiple Images Embedding Scheme Based
on Moment Preserving Block Truncation
Coding . . . . . . . . . . . . . . . . . 373--387
Weiru Liu and
Guilin Qi and
David A. Bell Adaptive Merging of Prioritized
Knowledge Bases . . . . . . . . . . . . 389--407
G. Michele Pinna Event Structures with Disabling/Enabling
Relation and Event Automata . . . . . . 409--430
Antonio Brogi and
Jean-Marie Jacquet and
Joost Kok Foundations on Coordination Languages
and Software Architectures . . . . . . . ??
Antonio Brogi and
Jean-Marie Jacquet and
Isabelle Linden Fully Abstract Semantics for a
Coordination Model with Asynchronous
Communication and Enhanced Matching . . 431--478
Roberto Gorrieri and
Roberto Lucchi and
Gianluigi Zavattaro Supporting Secure Coordination in
SecSpaces . . . . . . . . . . . . . . . 479--506
Mirko Viroli and
Andrea Omicini Coordination as a Service . . . . . . . 507--534
Simona Orzan and
Jaco van de Pol Distribution of a Simple Shared
Dataspace Architecture . . . . . . . . . 535--559
Juan Guillen-Scholten and
Farhad Arbab and
Frank de Boer and
Marcello Bonsangue A Component Coordination Model Based on
Mobile Channels . . . . . . . . . . . . 561--582
Antonio Vallecillo and
Vasco T. Vasconcelos and
António Ravara Typing the Behavior of Software
Components using Session Types . . . . . 583--598
Gregor Engels and
Fernando Orejas and
Francesco Parisi-Presicce Special Issue with Selected Papers from
ICGT 2004 . . . . . . . . . . . . . . . ??
Hartmut Ehrig and
Julia Padberg and
Ulrike Prange and
Annegret Habel Adhesive High-Level Replacement Systems:
A New Categorical Framework for Graph
Transformation . . . . . . . . . . . . . 1--29
Hartmut Ehrig and
Karsten Ehrig and
Ulrike Prange and
Gabriele Taentzer Fundamental Theory for Typed Attributed
Graphs and Graph Transformation based on
Adhesive HLR Categories . . . . . . . . 31--61
Reiko Heckel and
Georgios Lajios and
Sebastian Menge Stochastic Graph Transformation Systems 63--84
Jérémie Chalopin and
Yves Métivier and
Wies\law Zielonka Local Computations in Graphs: The Case
of Cellular Edge Local Computations . . 85--114
Andrzej Ehrenfeucht and
Jurriaan Hage and
Tero Harju and
Grzegorz Rozenberg The Embedding Problem for Switching
Classes of Graphs . . . . . . . . . . . 115--134
Hartmut Ehrig and
Karsten Ehrig and
Annegret Habel and
Karl-Heinz Pennemann Theory of Constraints and Application
Conditions: From Graphs to High-Level
Structures . . . . . . . . . . . . . . . 135--166
Marek A. Bednarczyk Limits of Modularity . . . . . . . . . . 167--187
Chin-Chen Chang and
Chih-Yang Lin Reversible Data Embedding Based on
Prediction Approach for VQ and SMVQ
Compressed Images . . . . . . . . . . . 189--207
Georgi Dimov and
Dimiter Vakarelov Contact Algebras and Region-based Theory
of Space: a Proximity Approach --- I . . 209--249
Georgi Dimov and
Dimiter Vakarelov Contact Algebras and Region-based Theory
of Space: Proximity Approach --- II . . 251--282
Ivo Düntsch and
Michael Winter Rough Relation Algebras Revisited . . . 283--300
Pascal Hitzler and
Markus Krötzsch and
Guo-Qiang Zhang A Categorical View on Algebraic Lattices
in Formal Concept Analysis . . . . . . . 301--328
Bala Kalyanasundaram and
Mahe Velauthapillai Capabilities of Thoughtful Machines . . 329--340
Saralees Nadarajah and
Samuel Kotz The Linear Combination of Logistic and
Gumbel Random Variables . . . . . . . . 341--350
Mohak Shah and
Marina Sokolova and
Stan Szpakowicz Process-Specific Information for
Learning Electronic Negotiation Outcomes 351--373
Marcin Szpyrka Analysis of RTCP-nets with Reachability
Graphs . . . . . . . . . . . . . . . . . 375--390
Maurice Margenstern Machines, Computations and Universality ??
Artiom Alhazov and
Rudolf Freund and
Alberto Leporati and
Marion Oswald and
Claudio Zandron (Tissue) $P$ Systems with Unit Rules and
Energy Assigned to Membranes . . . . . . 391--408
Olivier Bournez and
Emmanuel Hainry Recursive Analysis Characterized as a
Class of Real Recursive Functions . . . 409--433
Fabio Burderi and
Giuseppa Castiglione and
Antonio Restivo Higman's Theorem on Discrete Sets . . . 435--446
Matteo Cavaliere and
Peter and
Leupold Observation of String-Rewriting Systems 447--462
Jean-Charles Delvenne and
Petr K\rurka and
Vincent Blondel Decidability and Universality in
Symbolic Dynamical Systems . . . . . . . 463--490
Jérôme Durand-Lose Abstract Geometrical Computation 1:
Embedding Black Hole Computations with
Rational Numbers . . . . . . . . . . . . 491--510
Markus Holzer and
Martin Kutrib Variable Complexity of Simple Programs 511--528
Alberto Leporati and
Claudio Zandron and
Giancarlo Mauri Reversible $P$ Systems to Simulate
Fredkin Circuits . . . . . . . . . . . . 529--548
Jean Néraud On the Completion of Codes in Submonoids
with Finite Rank . . . . . . . . . . . . 549--562
Alexander Okhotin Computational Universality in
One-variable Language Equations . . . . 563--578
René Schott and
Jean-Claude Spehner Shuffle of Words and \em Araucaria Trees 579--601
Hiroshi Umeo and
Masashi Maeda and
Masaya Hisaoka and
Masato Teraoka A State-Efficient Mapping Scheme for
Designing Two-Dimensional Firing Squad
Synchronization Algorithms . . . . . . . 603--623
Anonymous In Memory of Professor Zdzis\law Pawlak ??
J. F. Peters and
A. Skowron Life and Work of Zdzis\law Pawlak . . . ??
Philippe Balbiani and
Dimiter and
Vakarelov Arrow Logic with Arbitrary
Intersections: Applications to Pawlak's
Information Systems . . . . . . . . . . 1--25
Jan G. Bazan and
Piotr Kruczek and
Stanis\lawa Bazan-Socha and
Andrzej Skowron and
Jacek J. Pietrzyk Rough Set Approach to Behavioral Pattern
Identification . . . . . . . . . . . . . 27--47
Francesco Bernardini and
Robert Brijder and
Grzegorz Rozenberg and
Claudio Zandron Multiset-Based Self-Assembly of Graphs 49--75
Daniela Bianucci and
Gianpiero Cattaneo and
Davide Ciucci Entropies and Co-Entropies of Coverings
with Application to Incomplete
Information Systems . . . . . . . . . . 77--105
Wojciech Buszkowski Rough Sets and Learning by Unification 107--121
Mihir K. Chakraborty and
Mohua Banerjee Rough Dialogue and Implication Lattices 123--139
Haiming Chen and
Rudolf Freund and
Mihai Ionescu and
Gheorghe P\uaun and
Mario J. Pérez-Jiménez On String Languages Generated by Spiking
Neural $P$ Systems . . . . . . . . . . . 141--162
Stéphane Demri and
Ewa and
Or\lowska Relative Nondeterministic Information
Logic is EXPTIME-complete . . . . . . . 163--178
Patrick Doherty and
Andrzej Sza\las A Correspondence Framework between
Three-Valued Logics and Similarity-Based
Approximate Reasoning . . . . . . . . . 179--193
Didier Dubois and
Florence Dupin de Saint-Cyr and
Henri Prade A Possibility-Theoretic View of Formal
Concept Analysis . . . . . . . . . . . . 195--213
Ivo Düntsch and
Beata Konikowska A Multi-modal Logic for Disagreement and
Exhaustiveness . . . . . . . . . . . . . 215--238
Marcin Dziubi\'nski and
Rineke Verbrugge and
Barbara Dunin-K\ceplicz Complexity Issues in Multiagent Logics 239--262
A. Ehrenfeucht and
G. Rozenberg Reaction Systems . . . . . . . . . . . . 263--280
Daniel Göhring and
Hans-Dieter Burkhard Cooperative World Modeling in Dynamic
Multi-Robot Environments . . . . . . . . 281--294
Ryszard Janicki and
Dai Tri Man Lê Towards a Pragmatic Mereology . . . . . 295--314
Jouni Järvinen Pawlak's Information Systems in Terms of
Galois Connections and Functional
Dependencies . . . . . . . . . . . . . . 315--330
Solomon Marcus Z. Pawlak, a Precursor of DNA Computing
and of Picture Grammars . . . . . . . . 331--334
Antoni Mazurkiewicz Locally Derivable Graphs . . . . . . . . 335--355
Mikhail Ju. Moshkov and
Marcin Piliszczuk and
Beata Zielosko On Construction of Partial Reducts and
Irreducible Partial Decision Rules . . . 357--374
Miroslav Novotný Retracts of Algebras . . . . . . . . . . 375--384
Setsuo Ohsuga Bridging the Gap between Non-Symbolic
and Symbolic Processing --- How Could
Human Being Acquire Language? . . . . . 385--406
James F. Peters Near Sets. Special Theory about Nearness
of Objects . . . . . . . . . . . . . . . 407--433
Lech Polkowski Concept Approximation in Mathematics and
Computer Science. An Essay in Homage to
Zdzis\law Pawlak . . . . . . . . . . . . 435--451
Sheela Ramanna and
James F. Peters and
Andrzej Skowron Approaches to Conflict Dynamics Based on
Rough Sets . . . . . . . . . . . . . . . 453--468
Arto Salomaa Subword Balance in Binary Words,
Languages and Sequences . . . . . . . . 469--482
Debashis Sen and
Sankar K. Pal Histogram Thresholding using Beam Theory
and Ambiguity Measures . . . . . . . . . 483--504
W\ladys\law Skarbek On Generating All Binary Trees . . . . . 505--536
Józef Winkowski Behaviour Algebras . . . . . . . . . . . 537--560
J. Busch On the Optimality of the Binary
Algorithm for the Jacobi Symbol . . . . 1--11
Ya-Fen Chang and
Chin-Chen Chang Tolerant Key Assignment for Enforcing
Complicated Access Control Policies in a
Hierarchy . . . . . . . . . . . . . . . 13--23
Chin-Chen Chang and
Chang-Chu Chen Full-Searching-Equivalent Vector
Quantization Using Two-Bounds Triangle
Inequality . . . . . . . . . . . . . . . 25--37
Chin-Chen Chang and
Tzu-Chuen Lu and
Jun-Bin Ya VQ Codebook Searching Algorithm Based on
Correlation Property . . . . . . . . . . 39--57
Li Chunlin and
Li Layuan A Pricing Approach For Grid Resource
Scheduling With QoS Guarantees . . . . . 59--73
Sabyasachi Dey and
Bhargab B. Bhattacharya and
Malay K. Kundu and
Arijit Bishnu and
Tinku Acharya A Co-processor for Computing the Euler
Number of a Binary Image using
Divide-and-Conquer Strategy . . . . . . 75--89
Enrico Formenti and
Beno\^\it Masson and
Theophilos Pisokas Advances in Symmetric Sandpiles . . . . 91--112
Yo-Sub Han and
Kai Salomaa and
Derick Wood Intercode Regular Languages . . . . . . 113--128
Jouni Järvinen and
Michiro Kondo and
Jari Kortelainen Modal-Like Operators in Boolean
Lattices, Galois Connections and Fixed
Points . . . . . . . . . . . . . . . . . 129--145
Ulrich Paquet and
Andries P. Engelbrecht Particle Swarms for Linearly Constrained
Optimisation . . . . . . . . . . . . . . 147--170
Suman Saha and
C. A. Murthy and
Sankar K. Pal Rough set Based Ensemble Classifier for
Web Page Classification . . . . . . . . 171--187
Igor V. Tarasyuk Stochastic Petri Box Calculus with
Discrete Time . . . . . . . . . . . . . 189--218
Anonymous Developments in Grammar Systems: Preface ??
Gemma Bel-Enguix and
M. Dolores Jiménez-López Dynamic Meaning Membrane Systems: An
Application to the Description of
Semantic Change . . . . . . . . . . . . 219--237
Suna Bensch and
Henning Bordihn Active Symbols in Pure Systems . . . . . 239--254
Henning Bordihn and
Markus Holzer Cooperating Distributed Grammar Systems
as Models of Distributed Problem
Solving, Revisited . . . . . . . . . . . 255--270
Erzsébet Csuhaj-Varjü and
Gheorghe P\uaun and
György Vaszil Grammar Systems versus Membrane
Computing: The Case of CD Grammar
Systems . . . . . . . . . . . . . . . . 271--292
Jürgen and
Dassow On Cooperating Distributed Grammar
Systems with Competence Based Start and
Stop Conditions . . . . . . . . . . . . 293--304
Rudolf Freund and
Marion Oswald Modelling Grammar Systems by Tissue $P$
Systems Working in the Sequential Mode 305--323
María Adela Grando and
Victor Mitrana A Possible Connection Between Two
Theories: Grammar Systems and Concurrent
Programming . . . . . . . . . . . . . . 325--336
Jozef Kelemen On Computing Bodies . . . . . . . . . . 337--347
Alica Kelemenová and
Michal Tupý Monocultures and Homogeneous Environment
in Eco-Grammar Systems . . . . . . . . . 349--365
Peter Sebestyén and
Petr Sosík Modelling Multiple Robots in Space: An
Adaptive Eco-Grammar System . . . . . . 367--381
Bettina Sunckel On Metalinear CD Grammar Systems . . . . 383--397
Chin-Chen Chang and
Chih-Yang Lin and
Chun-Sen Tseng Secret Image Hiding and Sharing Based on
the $ (t, n)$-Threshold . . . . . . . . 399--411
Stavros Konstantinidis and
Santean Nicolae and
Sheng Yu Fuzzification of Rational and
Recognizable Sets . . . . . . . . . . . 413--447
Nicolas Peltier A Resolution Calculus with Shared
Literals . . . . . . . . . . . . . . . . 449--480
Hsien-Chu Wu and
Chin-Chen Chang An Image Retrieval Method Based on
Color-Complexity and Spatial-Histogram
Features . . . . . . . . . . . . . . . . 481--493
Rados\law Ziembi\'nski Algorithms for Context Based Sequential
Pattern Mining . . . . . . . . . . . . . 495--510
Anonymous The Abstract State Machines Method . . . ??
Jean-Raymond Abrial and
Stefan Hallerstede Refinement, Decomposition, and
Instantiation of Discrete Models:
Application to Event-B . . . . . . . . . 1--28
Richard Banach and
Czes\law Jeske and
Michael Poppleton and
Susan Stepney Retrenching the Purse: The Balance
Enquiry Quandary, and Generalised and $
(1, 1) $ Forward Refinements . . . . . . 29--69
Roozbeh Farahbod and
Vincenzo Gervasi and
Uwe Glässer CoreASM: An Extensible ASM Execution
Engine . . . . . . . . . . . . . . . . . 71--103
Calvin Kai Fan Tang and
Eugenia Ternovska Model Checking Abstract State Machines
with Answer Set Programming . . . . . . 105--141
Susanne Graf and
Andreas Prinz Time in State Machines . . . . . . . . . 143--174
Comandur Seshadhri and
Anil Seth and
Somenath Biswas RAM Simulation of BGS Model of
Abstract-state Machines . . . . . . . . 175--185
Eric Badouel and
Jules Chenou and
Goulven Guillou An Axiomatization of the Token Game
Based on Petri Algebras . . . . . . . . 187--215
Chin-Chen Chang and
Wei-Liang Tai and
Chia-Chen Lin A Novel Image Hiding Scheme Based on VQ
and Hamming Distance . . . . . . . . . . 217--228
Yancang Li and
Wanqing Li Adaptive Ant Colony Optimization
Algorithm Based on Information Entropy:
Foundation and Application . . . . . . . 229--242
Mykola Pechenizkiy and
Alexey Tsymbal and
Seppo Puuronen and
David Patterson Feature Extraction for Dynamic
Integration of Classifiers . . . . . . . 243--275
Piotr Porwik Efficient Algorithm of Affine Form
Searching for Weakly Specified Boolean
Function . . . . . . . . . . . . . . . . 277--291
Anonymous Typed Lambda Calculi and Applications
2005, Selected Papers . . . . . . . . . ??
Thierry Coquand The Completeness of Typing for
Context-Semantics . . . . . . . . . . . 293--301
Amy P. Felty Tutorial Examples of the Semantic
Approach to Foundational Proof-Carrying
Code . . . . . . . . . . . . . . . . . . 303--330
Susumu Hayashi Can Proofs be Animated by Games? . . . . 331--343
Andreas Abel and
Thierry Coquand Untyped Algorithmic Equality for
Martin-Löf's Logical Framework with
Surjective Pairs . . . . . . . . . . . . 345--395
Amal Ahmed and
Matthew Fluet and
Greg Morrisett $ L^3 $: A Linear Language with
Locations . . . . . . . . . . . . . . . 397--449
Ferruccio Damiani Rank 2 Intersection for Recursive
Definitions . . . . . . . . . . . . . . 451--488
René David and
Karim Nour Arithmetical Proofs of Strong
Normalization Results for Symmetric $
\lambda $-calculi . . . . . . . . . . . 489--510
James D. Laird On the Expressiveness of Affine Programs
with Non-local Control: The Elimination
of Nesting in SPCF . . . . . . . . . . . 511--531
Anonymous The Fourth Special Issue on Applications
of Concurrency to System Design . . . . ??
Robert Clarisó and
Jordi Cortadella Verification of Concurrent Systems with
Parametric Delays Using Octahedra . . . 1--33
Marc Geilen and
Twan Basten and
Bart Theelen and
Ralph Otten An Algebra of Pareto Points . . . . . . 35--74
Kyller Gorgônio and
Jordi Cortadella and
Fei Xia and
Alex Yakovlev Automating Synthesis of Asynchronous
Communication Mechanisms . . . . . . . . 75--100
Mark B. Josephs and
Hemangee K. Kapoor Controllable Delay-Insensitive Processes 101--130
Dumitru Potop-Butucaru and
Beno\^\it Caillaud Correct-by-Construction Asynchronous
Implementation of Modular Synchronous
Specifications . . . . . . . . . . . . . 131--159
W. Vogler and
B. Kangsah Improved Decomposition of Signal
Transition Graphs . . . . . . . . . . . 161--197
\Lukasz Bolikowski and
Anna Gambin New Metrics for Phylogenies . . . . . . 199--216
Olivia Breysse and
Michel De Glas A New Approach to the Concepts of
Boundary and Contact: Toward an
Alternative to Mereotopology . . . . . . 217--238
Yu-Chen Hu Predictive Grayscale Image Coding Scheme
Using VQ and BTC . . . . . . . . . . . . 239--255
Yu-Chen Hu and
Chia-Chen Lin and
Kang-Liang Chi Block Prediction Vector Quantization for
Grayscale Image Compression . . . . . . 257--270
Van Nam Huynh and
Yoshiteru Nakamori and
Tetsuya Murai An Algebraic Foundation for Linguistic
Reasoning . . . . . . . . . . . . . . . 271--294
Ewa Palka An Infinitary Sequent System for the
Equational Theory of *-continuous Action
Lattices . . . . . . . . . . . . . . . . 295--309
Anonymous Foreword . . . . . . . . . . . . . . . . ??
Rudolf Freund and
Fritz Tafill Cellular Automata and Parallel Array
Systems . . . . . . . . . . . . . . . . 311--327
Henryk Fuk\'s Remarks on the Critical Behavior of
Second Order Additive Invariants in
Elementary Cellular Automata . . . . . . 329--341
Andreas Klein and
Martin Kutrib Cellular Devices and Unary Languages . . 343--368
Pradipta Maji and
P. Pal Chaudhuri RBFFCA: A Hybrid Pattern Classifier
Using Radial Basis Function and Fuzzy
Cellular Automata . . . . . . . . . . . 369--396
Hidenosuke Nishio and
Maurice Margenstern and
Friedrich von Haeseler On Algebraic Structure of Neighborhoods
of Cellular Automata . . . . . . . . . . 397--416
Marcus Pivato Spectral Domain Boundaries in Cellular
Automata . . . . . . . . . . . . . . . . 417--447
Hiroshi Umeo and
Koshi Michisaka and
Naoki Kamikawa and
Masaru Kanazawa State-Efficient One-Bit Communication
Solutions for Some Classical Cellular
Automata Problems . . . . . . . . . . . 449--465
Anonymous Special Issue on Knowledge Discovery . . ??
Liying Jiang and
Jitender Deogun SPICE: A New Framework for Data Mining
based on Probability Logic and Formal
Concept Analysis . . . . . . . . . . . . 467--485
Ugo Galassi and
Marco Botta and
Attilio Giordana Hierarchical Hidden Markov Models for
User/Process Profile Learning . . . . . 487--505
Seunghyun Im Privacy Aware Data Management and Chase 507--524
Minkoo Seo and
Sanghyun Park and
Jung-Im Won Towards Efficient Searching on the
Secondary Structure of Protein Sequences 525--542
Marie Agier and
Jean-Marc Petit and
Einoshin Suzuki Unifying Framework for Rule Semantics:
Application to Gene Expression Data . . 543--559
Shusaku Tsumoto and
Shoji Hirano Visualization of Differences between
Rules' Syntactic and Semantic
Similarities using Multidimensional
Scaling . . . . . . . . . . . . . . . . 561--573
Ansaf Salleb-Aouissi and
Christel Vrain A Contribution to the Use of Decision
Diagrams for Loading and Mining
Transaction Databases . . . . . . . . . 575--594
Xintao Wu and
Yongge Wang and
Songtao Guo and
Yuliang Zheng Privacy Preserving Database Generation
for Database Application Testing . . . . 595--612
Xin Zhang and
Zbigniew W. Ra\'s Sound Isolation by Harmonic Peak
Partition For Music Instrument
Recognition . . . . . . . . . . . . . . 613--628
Paul Bell A Note on the Emptiness of Semigroup
Intersections . . . . . . . . . . . . . 1--4
Robert Cowen and
Adam Kolany Davis--Putnam Style Rules for Deciding
Property $S$ . . . . . . . . . . . . . . 5--15
Gregory Chaitin An Algebraic Characterization of the
Halting Probability . . . . . . . . . . 17--23
Thomas Eiter and
Esra Erdem and
Wolfgang Faber and
Ján Senko A Logic-Based Approach to Finding
Explanations for Discrepancies in
Optimistic Plan Execution . . . . . . . 25--69
Grzegorz Herman and
Tim Paterson and
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 and
Johan Wittocx and
Maarten Mariën and
Marc Denecker Predicate Introduction for Logics with a
Fixpoint Semantics. Part I: Logic
Programming . . . . . . . . . . . . . . 187--208
Joost Vennekens and
Johan Wittocx and
Maarten Mariën and
Marc Denecker Predicate Introduction for Logics with
Fixpoint Semantics. Part II:
Autoepistemic Logic . . . . . . . . . . 209--227
Bo\.zena Wo\'zna and
Andrzej Zbrzezny Bounded Model Checking for the
Existential Fragment of TCTL$_{-G}$ and
Diagonal Timed Automata . . . . . . . . 229--256
Wei-Guo Zhang and
Ying-Luo Wang A Comparative Analysis of Possibilistic
Variances and Covariances of Fuzzy
Numbers . . . . . . . . . . . . . . . . 257--263
Anonymous Concurrency Specification and
Programming (CS&P) . . . . . . . . . . . ??
Antoni Mazurkiewicz Compositional Systems over Reducible
Networks . . . . . . . . . . . . . . . . 265--282
Ludwik Czaja Interpreted Nets . . . . . . . . . . . . 283--293
Roxana Dietze and
Manfred Kudlek and
Olaf Kummer Decidability Problems of a Basic Class
of Object Nets . . . . . . . . . . . . . 295--302
Berndt Farwer and
Manfred Kudlek and
Heiko Rölke Concurrent Turing Machines . . . . . . . 303--317
Anna Gomoli\'nska Approximation Spaces Based on Relations
of Similarity and Dissimilarity of
Objects . . . . . . . . . . . . . . . . 319--333
Damas P. Gruska Observation Based System Security . . . 335--346
Kees van Hee and
Olivia Oanea and
Alexander Serebrenik and
Natalia Sidorova and
Marc Voorhoeve and
Irina A. Lomazova Checking Properties of Adaptive Workflow
Nets . . . . . . . . . . . . . . . . . . 347--362
Gizela Jakubowska and
Wojciech Penczek Modelling and Checking Timed
Authentication of Security Protocols . . 363--378
Agata Janowska and
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 and
Lyudmila Matvyeyeva Algorithm of Translation of
MSC-specified System into Petri Net . . 431--445
Manfred Kudlek On Semilinear Sets over Commutative
Semirings . . . . . . . . . . . . . . . 447--452
Miros\law Kurkowski and
Wojciech Penczek Verifying Security Protocols Modelled by
Networks of Automata . . . . . . . . . . 453--471
Alessio Lomuscio and
Franco Raimondi and
Bo\.zena Wo\'zna Verification of the TESLA protocol in
MCMAS-X . . . . . . . . . . . . . . . . 473--486
Antoni Mazurkiewicz Local Properties of Triangular Graphs 487--495
James F. Peters and
Andrzej Skowron and
Jaros\law 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
Jaros\law Stepaniuk Relational Data and Rough Sets . . . . . 525--539
Zbigniew Suraj and
Barbara Fryc Analysis of Approximate Petri Nets by
Means of Occurrence Graphs . . . . . . . 541--551
Zbigniew Suraj and
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 and
Agata Pó\lrola SAT-Based Reachability Checking for
Timed Automata with Discrete Data . . . 579--593
Anonymous Antoni Mazurkiewicz --- half a century
of inspirational research . . . . . . . ??
Volker Diekert and
Martin Horsch and
Manfred Kufleitner On First-Order Fragments for
Mazurkiewicz Traces . . . . . . . . . . 1--29
Luca Bernardinello and
Elena Monticelli and
Lucia Pomello On Preserving Structural and Behavioural
Properties by Composing Net Systems on
Interfaces . . . . . . . . . . . . . . . 31--47
Jonathan Billington and
Bing Han Formalising TCP's Data Transfer Service
Language: A Symbolic Automaton and its
Properties . . . . . . . . . . . . . . . 49--74
Eike Best and
Philippe Darondeau and
Harro Wimmel Making Petri Nets Safe and Free of
Internal Transitions . . . . . . . . . . 75--90
Giovanni Conforti and
Damiano Macedonio and
Vladimiro Sassone Static BiLog: a Unifying Language for
Spatial Structures . . . . . . . . . . . 91--110
Joost Engelfriet and
Hendrik Jan Hoogeboom Finitary Compositions of Two-way
Finite-State Transductions . . . . . . . 111--123
Jacques Carette and
Ryszard Janicki Computing Properties of Numerical
Imperative Programs by Symbolic
Computation . . . . . . . . . . . . . . 125--146
Blaise Genest and
Dietrich Kuske and
Anca Muscholl On Communicating Automata with Bounded
Channels . . . . . . . . . . . . . . . . 147--167
Paul Gastin and
Dietrich Kuske Uniform Satisfiability in PSPACE for
Local Temporal Logics Over Mazurkiewicz
Traces . . . . . . . . . . . . . . . . . 169--197
Jetty Kleijn and
Maciej Koutny Processes of Petri Nets with Range
Testing . . . . . . . . . . . . . . . . 199--219
Jérémie Chalopin and
Yves Métivier An Efficient Message Passing Election
Algorithm based on Mazurkiewicz's
Algorithm . . . . . . . . . . . . . . . 221--246
Mikhail Ju. Moshkov and
Andrzej Skowron and
Zbigniew Suraj On Minimal Rule Sets for Almost All
Binary Information Systems . . . . . . . 247--258
Edward Ochma\'nski and
Joanna Pieckowska On Ethics of Mazurkiewicz Traces . . . . 259--272
Wolfgang Reisig The Decent Philosophers: An Exercise in
Concurrent Behaviour . . . . . . . . . . 273--281
Xu Wang and
Marta Kwiatkowska On Process-algebraic Verification of
Asynchronous Circuits . . . . . . . . . 283--310
Józef Winkowski Towards a Framework for Modelling
Behaviours of Hybrid Systems . . . . . . 311--332
Jan A. Bergstra and
Cornelis A. Middelburg Maurer Computers with Single-Thread
Control . . . . . . . . . . . . . . . . 333--362
Alain Bui and
Devan Sohier How to Compute Times of Random Walks
Based Distributed Algorithms . . . . . . 363--378
Mariusz Flasi\'nski Inference of Parsable Graph Grammars for
Syntactic Pattern Recognition . . . . . 379--413
Céline Hébert and
Alain Bretto and
Bruno Crémilleux A Data Mining Formalization to Improve
Hypergraph Minimal Transversal
Computation . . . . . . . . . . . . . . 415--433
Feng Jiang and
Yuefei Sui and
Cungen Cao Formal Concept Analysis in Relational
Database and Rough Relational Database 435--451
Fagen Li and
Yupu Hu Security Analysis of the
Pomyka\la--Barabasz Scheme . . . . . . . 453--459
Rongxing Lu and
Zhenfu Cao and
Xiaolei Dong A New Practical Limited Identity-Based
Encryption Scheme . . . . . . . . . . . 461--474
Pradipta Maji and
Sankar K. Pal RFCM: A Hybrid Clustering Algorithm
Using Rough and Fuzzy Sets . . . . . . . 475--496
Anonymous Preface . . . . . . . . . . . . . . . . ??
Stanis\law Krajewski and
Jan Wole\'nski Andrzej Grzegorczyk: Logic and
Philosophy . . . . . . . . . . . . . . . 1--17
André Arnold and
Damian Niwi\'nski Continuous Separation of Game Languages 19--28
Philippe Balbiani and
Tinko Tinchev and
Dimiter Vakarelov Modal Logics for Region-based Theories
of Space . . . . . . . . . . . . . . . . 29--82
Patrick Cégielski and
Denis Richard and
Maxim Vsemirnov On the Additive Theory of Prime Numbers 83--96
Janusz Czelakowski Induction Principles for Sets . . . . . 97--122
Siegfried Gottwald Mathematical Fuzzy Logic: An Invitation
to Interesting Research Areas . . . . . 123--137
Rafa\l Gruszczy\'nski and
Andrzej Pietruszczak Pieri's Structures . . . . . . . . . . . 139--154
Petr Hájek Mathematical Fuzzy Logic and Natural
Numbers . . . . . . . . . . . . . . . . 155--163
Roman Kossak On Some Uses of Nonstandard Models . . . 165--172
Stanis\law Krajewski On Gödel's Theorem and Mechanism:
Inconsistency or Unsoundness is
Unavoidable in any Attempt to 'Out-Gödel'
the Mechanist . . . . . . . . . . . . . 173--181
Micha\l Krynicki and
Marcin Mostowski and
Konrad Zdanowski Finite Arithmetics . . . . . . . . . . . 183--202
Larisa Maksimova On Modal Grzegorczyk Logic . . . . . . . 203--210
Victor W. Marek and
Jeffrey B. Remmel Compactness Properties for Stable
Semantics of Logic Programs . . . . . . 211--239
Marcin Mostowski Potential Infinity and the Church Thesis 241--248
Roman Murawski Did Leibniz and Newton Discover or
Create the Calculus? . . . . . . . . . . 249--256
Anna B. Romanowska and
Jonathan D. H. Smith and
Ewa Or\lowska Abstract Barycentric Algebras . . . . . 257--273
Ewa Or\lowska and
Ingrid Rewitzky Discrete Dualities for Heyting Algebras
with Operators . . . . . . . . . . . . . 275--295
Vladimir V. Rybakov Decidability w.r.t. Logical Consecutions
of Linear Temporal Logic Extended by
Since and Previous . . . . . . . . . . . 297--313
Andrzej Salwicki Andrzej Grzegorczyk's Contribution to
Computer Science . . . . . . . . . . . . 315--323
Marian Srebrny and
Lidia Stepie\'n A Propositional Programming Environment
for Linear Algebra . . . . . . . . . . . 325--345
Vít\vezslav \vSvejdar An Interpretation of Robinson Arithmetic
in its Grzegorczyk's Weaker Variant . . 347--354
Jan Wole\'nski Logic, Rationality and Psychologism . . 355--365
Benjamín René Callejas Bedregal Pushdown Automata Free of Explicit
Nondeterminism and an Infinite Hierarchy
of Context-free Languages . . . . . . . 367--377
Denisa Diaconescu and
George Georgescu Tense Operators on MV-Algebras and
\Lukasiewicz--Moisil Algebras . . . . . 379--408
María-Inés Fernández-Camacho and
José-Ramón Sánchez-Couso Binary Search Trees, Recurrent
Properties and Wave Equations . . . . . 409--439
Yo-Sub Han and
Derick Wood Outfix-Free Regular Languages and Prime
Outfix-Free Decomposition . . . . . . . 441--457
Florin Manea and
C\ualina Ploscaru A Generalization of the Assignment
Problem, and its Application to the Rank
Aggregation Problem . . . . . . . . . . 459--471
Jacek Marciniec From Unification Compactness to
Learnability . . . . . . . . . . . . . . 473--484
René Schott and
Jean-Claude Spehner Erratum for ``Shuffle of Words and \em
Araucaria Trees'' . . . . . . . . . . . 485--490
Chin-Chen Chang and
Chih-Yang Lin and
Yi-Pei Hsieh Three-Phase Lossless Data Hiding Method
for the VQ Index Table . . . . . . . . . 1--13
Yung-Kuei Chiang and
Piyu Tsai and
Feng-Long Huang Codebook Partition Based Steganography
without Member Restriction . . . . . . . 15--27
Erzsébet Csuhaj-Varjú and
Antonio Di Nola and
Gheorghe P\uaun and
Mario J. Pérez-Jiménez and
György Vaszil Editing Configurations of $P$ Systems 29--46
Frank Drewes and
Brink van der Merwe Path Languages of Random Permitting
Context Tree Grammars are Regular . . . 47--60
Zoltán Ésik and
Szabolcs Iván Products of Tree Automata with an
Application to Temporal Logic . . . . . 61--78
Zoltán Ésik and
Szabolcs Iván Some Varieties of Finite Tree Automata
Related to Restricted Temporal Logics 79--103
Grzegorz Gali\'nski and
W\ladys\law Skarbek Image Search using Dominant Colors . . . 105--112
David Ilcinkas and
Andrzej Pelc Impact of Asynchrony on the Behavior of
Rational Selfish Agents . . . . . . . . 113--125
Michael Kaminski Invariance Under Stuttering in a
Temporal Logic without the ``Until''
Operator . . . . . . . . . . . . . . . . 127--140
Antonín Ku\vcera and
Old\vrich Stra\vzovský On the Controller Synthesis for
Finite-State Markov Decision Processes 141--153
Ching-Chiuan Lin and
Nien-Lin Hsueh and
Wen-Hsiang Shen High-Performance Reversible Data Hiding 155--169
Arnaldo V. Moura and
Guilherme A. Pinto Classes of Timed Automata and the
Undecidability of Universality . . . . . 171--184
Tomasz Terlikowski Information in a Two-Stage Decision
Process. General Idea and Classification 185--212
Anonymous Rules and Rule Markup Languages for the
Semantic Web . . . . . . . . . . . . . . ??
Jos de Bruijn and
Stijn Heymans On the Relationship between Description
Logic-based and $F$-Logic-based
Ontologies . . . . . . . . . . . . . . . 213--236
Erik Behrends and
Oliver Fritzen and
Wolfgang May and
Franz Schenk Embedding Event Algebras and Process for
ECA Rules for the Semantic Web . . . . . 237--263
Carlos Viegas Damásio and
Jeff Z. Pan and
Giorgos Stoilos and
Umberto Straccia Representing Uncertainty in RuleML . . . 265--288
Thomas Lukasiewicz Fuzzy Description Logic Programs under
the Answer Set Semantics for the
Semantic Web . . . . . . . . . . . . . . 289--310
Anonymous Behavior of Composed Concurrent Systems:
Logic and Reasoning . . . . . . . . . . ??
Mark-Oliver Stehr Compositionality for Tightly Coupled
Systems: A New Application of the
Propositions-as-Types Interpretation . . 311--340
Einar Broch Johnsen and
Olaf Owe and
Arild B. Torjusen Validating Behavioral Component
Interfaces in Rewriting Logic . . . . . 341--359
Dave Clarke A Basic Logic for Reasoning about
Connector Reconfiguration . . . . . . . 361--390
Erika Ábrahám and
Frank S. de Boer and
Willem-Paul de Roever and
Martin Steffen A Deductive Proof System for
Multithreaded Java with Exceptions . . . 391--463
Shahram Esmaeilsabzali and
Nancy A. Day and
Farhad Mavaddat Interface Automata with Complex Actions:
Limiting Interleaving in Interface
Automata . . . . . . . . . . . . . . . . 465--512
Anonymous Algorithmic Complexity and Applications ??
Margaret Archibald and
Vasco Brattka and
Clemens Heuberger Randomness with Respect to the
Signed-Digit Representation . . . . . . 1--19
Laurent Bienvenu and
Wolfgang Merkle and
Alexander Shen A Simple Proof of Miller--Yu Theorem . . 21--24
D. S. Bridges and
L. S. V\^\i\ct\ua Proximal Connectedness . . . . . . . . . 25--34
Jürgen Dassow and
Ralf Stiebe Nonterminal Complexity of Some
Operations on Context-Free Languages . . 35--49
Henning Fernau and
Ralf Stiebe Blind Counter Automata on $ \omega
$-Words . . . . . . . . . . . . . . . . 51--64
Rudolf Freund and
Marion Oswald Regular $ \omega $-Languages Defined by
Finite Extended Spiking Neural $P$
Systems . . . . . . . . . . . . . . . . 65--73
Yuan Gao and
Kai Salomaa and
Sheng Yu The State Complexity of Two Combined
Operations: Star of Catenation and Star
of Reversal . . . . . . . . . . . . . . 75--89
T. Aaron Gulliver and
Isaiah Makwakwa and
Ulrich Speidel On the Generation of Aperiodic and
Periodic Necklaces via $T$-augmentation 91--107
Michael Gössel and
Egor Sogomonyan A Non-linear Split Error Detection Code 109--115
Nicholas J. Hay Simulation Complexity . . . . . . . . . 117--140
Peter Hertling and
Christoph Spandl Computability Theoretic Properties of
the Entropy of Gap Shifts . . . . . . . 141--157
Sanjay Jain and
Frank Stephan and
Ye Nan Prescribed Learning of Indexed Families 159--175
Boris Ryabko Applications of Kolmogorov Complexity
and Universal Codes to Nonparametric
Estimation of Characteristics of Time
Series . . . . . . . . . . . . . . . . . 177--196
Victor L. Selivanov and
Klaus W. Wagner Complexity of Topological Properties of
Regular $ \omega $-Languages . . . . . . 197--217
Xizhong Zheng A Hierarchy of Computably Enumerable
Reals . . . . . . . . . . . . . . . . . 219--230
Ashish Ghosh and
Mrinal Kanti Das Non-dominated Rank based Sorting Genetic
Algorithms . . . . . . . . . . . . . . . 231--252
Benjamin Grimberg and
Michael Kaminski First-Order Ground Non-Monotonic Modal
Logic . . . . . . . . . . . . . . . . . 253--276
Éric Laugerotte and
Djelloul Ziadi Weighted Word Recognition . . . . . . . 277--298
Chia-Chen Lin and
Shing-Shoung Wang An Edge-based Image Copy Detection
Scheme . . . . . . . . . . . . . . . . . 299--318
Jen-Chang Liu and
Ming-Hong Shih Generalizations of Pixel-Value
Differencing Steganography for Data
Hiding in Images . . . . . . . . . . . . 319--335
Fabio Farina and
Alberto Dennunzio A Predator-Prey Cellular Automaton with
Parasitic Interactions and Environmental
Effects . . . . . . . . . . . . . . . . 337--353
Carlo Meghini and
Yannis Tzitzikas and
Nicolas Spyratos Abduction for Accessing Information
Sources . . . . . . . . . . . . . . . . 355--387
Daniel Simson and
Mariusz Wojewódzki An Algorithmic Solution of a Birkhoff
Type Problem . . . . . . . . . . . . . . 389--410
K. G. Subramanian and
Do Long Van and
P. Helen Chandra and
Nghiem Do Quyen Array Grammars with Contextual
Operations . . . . . . . . . . . . . . . 411--428
Michael Winter A Relation-Algebraic Theory of
Bisimulations . . . . . . . . . . . . . 429--449
Philippe Balbiani and
Petar Iliev and
Dimiter Vakarelov A Modal Logic for Pawlak's Approximation
Spaces with Rough Cardinality $n$ . . . 451--464
Anonymous Australasian Workshop on Combinatorial
Algorithms . . . . . . . . . . . . . . . ??
Amihood Amir and
Avivit Levy and
Liron Reuveni The Practical Efficiency of Convolutions
in Pattern Matching Algorithms . . . . . 1--15
Kangho Roh and
Maxime Crochemore and
Costas S. Iliopoulos and
Kunsoo Park External Memory Algorithms for String
Problems . . . . . . . . . . . . . . . . 17--32
Hui Zhang and
Qing Guo and
Costas S. Iliopoulos Algorithms for Computing the $ \lambda
$-regularities in Strings . . . . . . . 33--49
Andrei Kelarev An Algorithm for BCH Codes Extended with
Finite State Automata . . . . . . . . . 51--60
Hongwei Luo and
Kathy Horadam Simulation and Measurement of Complex
Network Growth: the Interplay of Uniform
and Preferential Attachment . . . . . . 61--79
Eunhui Park and
Kunsoo Park An Improved Boolean Circuit for Maximum
Matching in a Convex Bipartite Graph . . 81--97
James G. Lefevre and
Diane Donovan and
Ale\vs Drápal Permutation Representation of 3 and
$4$-Homogeneous Latin Bitrades . . . . . 99--110
Orestes Bueno and
Prabhu Manyem Polynomial-Time Maximisation Classes:
Syntactic Hierarchy . . . . . . . . . . 111--133
J. F. Weng and
J. MacGregor Smith and
M. Brazil and
D. A. Thomas Equivalence, Indicators,
Quasi-indicators and Optimal Steiner
Topologies on Four Points in Space . . . 135--149
Anonymous Logic for Pragmatics . . . . . . . . . . ??
Nicholas Asher A Type Driven Theory of Predication with
Complex Types . . . . . . . . . . . . . 151--183
Corrado Biasi and
Federico Aschieri A Term Assignment for Polarized
Bi-intuitionistic Logic and its Strong
Normalization . . . . . . . . . . . . . 185--205
Paulo Oliva and
Thomas Streicher On Krivine's Realizability
Interpretation of Classical Second-Order
Arithmetic . . . . . . . . . . . . . . . 207--220
John Power and
Miki Tanaka Category Theoretic Semantics for Typed
Binding Signatures with Recursion . . . 221--240
Christophe Raffalli and
Frédéric Ruyer Realizability of the Axiom of Choice in
HOL. (An Analysis of Krivine's Work) . . 241--258
Graham White Davidson and Reiter on Actions . . . . . 259--289
Alexander Clark and
Chris Watkins Some Alternatives to Parikh Matrices
Using String Kernels . . . . . . . . . . 291--303
Manfred Droste and
Werner Kuich and
George Rahonis Multi-Valued MSO Logics OverWords and
Trees . . . . . . . . . . . . . . . . . 305--327
Ali Hamzeh and
Adel Rahmani A New Architecture for Learning
Classifier Systems to Solve POMDP
Problems . . . . . . . . . . . . . . . . 329--351
Hui-Feng Huang and
Chin-Chen Chang A Novel Cryptographic Key Assignment
Scheme with ID-Based Access Control in a
Hierachy . . . . . . . . . . . . . . . . 353--361
Tseren-Onolt Ishdorj and
Remco Loos and
Ion Petre Computational Efficiency of
Intermolecular Gene Assembly . . . . . . 363--373
Alexandr Kazda The Chain Relation in Sofic Subshifts 375--390
Ching-Chiuan Lin and
Nien-Lin Hsueh and
Wen-Hsiang Shen Adaptively Embedding Binary Data in an
Image . . . . . . . . . . . . . . . . . 391--402
Yong Liu and
Congfu Xu and
Qiong Zhang and
Yunhe Pan Rough Rule Extracting From Various
Conditions: Incremental and Approximate
Approaches for Inconsistent Data . . . . 403--427
Swarnajyoti Patra and
Susmita Ghosh and
Ashish Ghosh Change Detection of Remote Sensing
Images with Semi-supervised Multilayer
Perceptron . . . . . . . . . . . . . . . 429--442
Kurt Ranalter A Semantic Analysis of a Logic for
Pragmatics with Assertions, Obligations,
and Causal Implication . . . . . . . . . 443--470
Sriparna Saha and
Sanghamitra Bandyopadhyay Fuzzy Symmetry Based Real-Coded Genetic
Clustering Technique for Automatic Pixel
Classification in Remote Sensing Imagery 471--492
Anonymous Concurrency Specification and
Programming (CS&P) . . . . . . . . . . . ??
Gra\.zyna Mirkowska and
Andrzej Salwicki and
Oskar Swida Algorithmic Logic + SpecVer = the
Methodology for High Integrity
Programming --- Invited Paper . . . . . 1--17
Marek A. Bednarczyk and
Wies\law Paw\lowski and
Luca Bernardinello and
Lucia Pomello and
Tomasz Borzyszkowski A Multi-facet Approach to Dynamic Agent
Systems . . . . . . . . . . . . . . . . 19--33
Marco Bellia and
M. Eugenia Occhiuto Methods as Parameters: A Preprocessing
Approach to Higher Order in Java . . . . 35--50
Katarzyna Budzy\'nska and
Magdalena Kacprzak A Logic for Reasoning about Persuasion 51--65
Piotr Chrz\kastowski-Wachtel and
Pawe\l Findeisen and
Grzegorz Wolny Time Distribution in Structural Workflow
Nets . . . . . . . . . . . . . . . . . . 67--87
Ludwik Czaja Boolean Algebra of Nets, their Synthesis
and Analysis . . . . . . . . . . . . . . 89--95
Pawel Delimata and
Zbigniew Suraj Feature Selection Algorithm for Multiple
Classifier Systems: A Hybrid Approach 97--110
Berndt Farwer and
Matthias Jantzen and
Manfred Kudlek and
Heiko Rölke and
Georg Zetzsche Petri Net Controlled Finite Automata . . 111--121
Daniel Göhring and
Heinrich Mellmann and
Kataryna Gerasymova and
Hans-Dieter Burkhard Constraint Based World Modeling . . . . 123--137
Anna Gomoli\'nska Satisfiability of Formulas from the
Standpoint of Object Classification: The
RST Approach . . . . . . . . . . . . . . 139--153
Grzegorz Góra and
Piotr Kruczek and
Andrzej Skowron and
Jan G. Bazan and
Stanis\lawa Bazan-Socha and
Jacek J. Pietrzyk Case-based Planning of Treatment of
Infants with Respiratory Failure . . . . 155--172
Damas P. Gruska Probabilistic Information Flow Security 173--187
Damas P. Gruska and
Andrea Maggiolo--Schettini and
Paolo Milazzo Security in a Model for Long-running
Transactions . . . . . . . . . . . . . . 189--203
Jerzy W. Grzymala-Busse and
Wojciech Rz\kasa Approximation Space and LEM2-like
Algorithms for Computing Local Coverings 205--217
Kees van Hee and
Alexander Serebrenik and
Natalia Sidorova Token History Petri Nets . . . . . . . . 219--234
Agata Janowska and
Pawe\l Janowski and
Dobies\law Wróblewski Translation of Intermediate Language to
Timed Automata with Discrete Data . . . 235--248
Andrzej Jankowski and
James F. Peters and
Andrzej Skowron and
Jaros\law Stepaniuk Optimization in Discovery of Compound
Granules . . . . . . . . . . . . . . . . 249--265
Matthias Jantzen and
Manfred Kudlek and
Georg Zetzsche Language Classes Defined by Concurrent
Finite Automata . . . . . . . . . . . . 267--280
Joanna Jó\lkowska and
Edward Ochma\'nski On Trace-Expressible Behaviour of Petri
Nets . . . . . . . . . . . . . . . . . . 281--295
Matthias Jüngel and
Heinrich Mellmann Memory-Based State-Estimation . . . . . 297--311
Magdalena Kacprzak and
Wojciech Nabia\lek and
Artur Niewiadomski and
Wojciech Penczek and
Agata Pó\lrola and
Maciej Szreter and
Bo\.zena Wo\'zna and
Andrzej Zbrzezny VerICS 2007 --- a Model Checker for
Knowledge and Real-Time . . . . . . . . 313--328
Michael Köhler-Bußmeier and
Manfred Kudlek Linear Properties of Zero-Safe Nets with
Debit Tokens . . . . . . . . . . . . . . 329--342
Hans Langmaack and
Andrzej Salwicki and
Marek Warpechowski A Deterministic Algorithm for
Identifying Direct Superclasses in Java 343--357
Alessio Lomuscio and
Wojciech Penczek LDYIS: a Framework for Model Checking
Security Protocols . . . . . . . . . . . 359--375
Ronald Middelkoop and
Cornelis Huizing and
Ruurd Kuiper and
Erik J. Luit Specification and Verification of
Invariants by Exploiting Layers in OO
Designs . . . . . . . . . . . . . . . . 377--398
\Lukasz Mikulski Projection Representation of
Mazurkiewicz Traces . . . . . . . . . . 399--408
Wojciech Nabia\lek and
Agata Janowska and
Pawe\l Janowski Translation of Timed Promela to Timed
Automata with Discrete Data . . . . . . 409--424
Wojciech Penczek and
Maciej Szreter SAT-based Unbounded Model Checking of
Timed Automata . . . . . . . . . . . . . 425--440
Roman R. Redziejowski Some Aspects of Parsing Expression
Grammar . . . . . . . . . . . . . . . . 441--451
Dominik Strza\lka and
Franciszek Grabowski Processes in Systems with Limited
Resources in the Context of
Non-extensive Thermodynamics . . . . . . 455--464
Kimmo Varpaaniemi and
Leo Ojala Modelling and Simulation of Quantum
Teleportation and Dense Coding Using
Predicate/Transition-Nets . . . . . . . 465--479
Józef Winkowski An Algebraic Framework for Defining
Random Concurrent Behaviours . . . . . . 481--496
Marcin Wolski Distance Measures Induced by Finite
Approximation Spaces and Approximation
Operators . . . . . . . . . . . . . . . 497--512
Andrzej Zbrzezny Improving the Translation from ECTL to
SAT . . . . . . . . . . . . . . . . . . 513--531
Andrzej Zbrzezny and
Bo\.zena Wo\'zna Towards Verification of Java Programs in
perICS . . . . . . . . . . . . . . . . . 533--548
Beata Zielosko and
Marcin Piliszczuk Greedy Algorithm for Attribute Reduction 549--561
Katarzyna Bijak Genetic Algorithms as an Alternative
Method of Parameter Estimation and
Finding Most Likely Sequences of States
of Hidden Markov Chains for HMMs and
Hybrid HMM/ANN Models . . . . . . . . . 1--17
Stephen L. Bloom and
Zoltan Ésik and
Werner Kuich Partial Conway and Iteration Semirings 19--40
François Denis and
Yann Esposito On Rational Stochastic Languages . . . . 41--77
Liviu P. Dinu and
Marius Popescu A Multi-Criteria Decision Method Based
on Rank Distance . . . . . . . . . . . . 79--91
Ali Hamzeh and
Adel Rahmani Approximating Arbitrary Reinforcement
Signal by Learning Classifier Systems
using Micro Genetic Algorithm . . . . . 93--111
Yu-Chen Hu and
Chih-Chiang Tsou and
Bing-Hwang Su Grayscale Image Hiding Based on Modulus
Function and Greedy Method . . . . . . . 113--126
Nata\vsa Jonoska and
Lila Kari and
Kalpana Mahalingam Involution Solid and Join codes . . . . 127--142
Pradipta Maji On Characterization of Attractor Basins
of Fuzzy Multiple Attractor Cellular
Automata . . . . . . . . . . . . . . . . 143--168
Saralees Nadarajah On the Normalized Cut . . . . . . . . . 169--173
Balakrishnan Ramadoss and
Kannan Rajkumar Modeling the Dance Video Semantics using
Regular Tree Automata . . . . . . . . . 175--189
Tomasz Terlikowski Some Issues on Inner Structure of
Information. A Definition of the
Decision Making Problem . . . . . . . . 191--212
Angelina A. Tzacheva and
Li-Shiang Tsay Tree-based Construction of Low-cost
Action Rules . . . . . . . . . . . . . . 213--225
Anonymous The Fifth Special Issue on Application
of Concurrency to System Design . . . . ??
Javier Esparza and
Petr Jan\vcar and
Alexander Miller On the Complexity of Consistency and
Complete State Coding for Signal
Transition Graphs . . . . . . . . . . . 227--253
Gabriel Juhás and
Robert Lorenz and
Sebastian Mauser Causal Semantics of Algebraic Petri Nets
distinguishing Concurrency and
Synchronicity . . . . . . . . . . . . . 255--298
Victor Khomenko and
Agnes Madalinski and
Alex Yakovlev Resolution of Encoding Conflicts by
Signal Insertion and Concurrency
Reduction Based on STG Unfoldings . . . 299--323
Cong Liu and
Alex Kondratyev and
Yosinori Watanabe and
Jörg Desel and
Alberto Sangiovanni-Vincentelli Schedulability Analysis of Petri Nets
Based on Structural Properties . . . . . 325--341
Tiberiu Seceleanu and
Axel Jantsch Modeling Communication with Synchronized
Environments . . . . . . . . . . . . . . 343--369
Abdelkrim Abdelli and
Nadjib Badache Towards Building the State Class Graph
of the TSPN Model . . . . . . . . . . . 371--409
Anirban Mukhopadhyay and
Ujjwal Maulik Unsupervised Pixel Classification in
Satellite Imagery: A Two-stage Fuzzy
Clustering Approach . . . . . . . . . . 411--428
Gregory Chaitin The Halting Probability via Wang Tiles 429--433
Chin-Chen Chang and
Yung-Chen Chou and
The Duc Kieu High Capacity Data Hiding for Grayscale
Images . . . . . . . . . . . . . . . . . 435--446
Chien-Chang Chen and
Yu-Wei Chien Sharing Numerous Images Secretly with
Reduced Possessing Load . . . . . . . . 447--458
Frank Drewes and
Christine du Toit and
Sigrid Ewert and
Brink van der Merwe and
Andries van der Walt Bag Context Tree Grammars . . . . . . . 459--480
Minghu Ha and
Witold Pedrycz and
Aiquan Zhang and
Yijun Fan A Development of Inclusion-degree-based
Rough Fuzzy Random Sets . . . . . . . . 481--502
Anonymous Special Issue on Membrane Computing . . ??
Anonymous Special Issue on Membrane Computing . . ??
Rodica Ceterchi and
Alexandru Ioan Tomescu Implementing Sorting Networks with
Spiking Neural $P$ Systems . . . . . . . 35--48
Gabriel Ciobanu and
Andreas Resios Computational Complexity of Simple $P$
Systems . . . . . . . . . . . . . . . . 49--59
Alberto Leporati and
Miguel A. Gutiérrez-Naranjo Solving SUBSET SUM by Spiking Neural $P$
Systems with Pre-computed Resources . . 61--77
Claudio Zandron and
Alberto Leporati and
Claudio Ferretti and
Giancarlo Mauri and
Mario J. Pérez-Jiménez On the Computational Efficiency of
Polarizationless Recognizer $P$ Systems
with Strong Division and Dissolution . . 79--91
Ge-Xiang Zhang and
Marian Gheorghe and
Chao-Zhong Wu A Quantum-Inspired Evolutionary
Algorithm Based on $P$ systems for
Knapsack Problem . . . . . . . . . . . . 93--116
Xingyi Zhang and
Xiangxiang Zeng and
Linqiang Pan Smaller Universal Spiking Neural $P$
Systems . . . . . . . . . . . . . . . . 117--136
Anonymous Cellular Automata: Theory and
Application in Artificial Intelligence ??
Niloy Ganguly and
Biplab K. Sikdar and
P. Pal Chaudhuri Exploring Cycle Structures of Additive
Cellular Automata . . . . . . . . . . . 137--154
Hiroshi Umeo and
Hiroki Uchino A New Time-Optimum Synchronization
Algorithm for Rectangle Arrays . . . . . 155--164
Paola Flocchini and
Vladimir Cezar Radial View of Continuous Cellular
Automata . . . . . . . . . . . . . . . . 165--183
Subhasree Basu and
Sumita Basu Different Types of Linear Fuzzy Cellular
Automata and their Applications . . . . 185--205
Stefania Bandini and
Leonardo Vanneschi and
Andrew Wuensche and
Alessandro Bahgat Shehata A Neuro-Genetic Framework for Pattern
Recognition in Complex Systems . . . . . 207--226
Debashis Moitra and
S. Dhar and
J. M. Mallick and
S. Sadhu and
Biplab K. Sikdar Cellular Automata Based Design of Cost
Optimal Steel Building Frames . . . . . 227--245
Rocco Rongo and
William Spataro and
Donato D'Ambrosio and
Maria Vittoria Avolio and
Giuseppe A. Trunfio and
Salvatore Di Gregorio Lava Flow Hazard Evaluation Through
Cellular Automata and Genetic
Algorithms: an Application to Mt. Etna
Volcano . . . . . . . . . . . . . . . . 247--267
Michael Domaratzki Characterizing DNA Bond Shapes Using
Trajectories . . . . . . . . . . . . . . 269--285
Wan Fokkink and
Jun Pang and
Anton Wijs Is Timed Branching Bisimilarity a
Congruence Indeed? . . . . . . . . . . . 287--311
Yu-Chen Hu and
Piyu Tsai and
Chun-Chi Lo New Bit Reduction of Vector Quantization
Using Block Prediction and Relative
Addressing . . . . . . . . . . . . . . . 313--329
Gabriel Juhás and
Robert Lorenz and
Sebastian Mauser Complete Process Semantics of Petri Nets 331--365
Hermenegilda Maci\`a and
Valentín Valero and
Fernando Cuartero and
M. Carmen Ruiz sPBC: A Markovian Extension of Petri Box
Calculus with Immediate Multiactions . . 367--406
Tomá\vs Masopust and
Alexander Meduna On Descriptional Complexity of Partially
Parallel Grammars . . . . . . . . . . . 407--415
Suman K. Mitra and
Malay K. Kundu and
C. A. Murthy and
Bhargab B. Bhattacharya and
Tinku Acharya A New Probabilistic Approach for Fractal
Based Image Compression . . . . . . . . 417--433
Piotr Oprocha Algorithmic Approach to Devaney Chaos in
Shift Spaces . . . . . . . . . . . . . . 435--446
Piyu Tsai and
Yu-Chen Hu and
Hsiu-Lien Yeh Fast VQ Codebook Generation Method Using
Codeword Stability Check and Finite
State Concept . . . . . . . . . . . . . 447--463
Kai Xiao and
Sooi Hock Ho and
Aboul ella Hassanien Automatic Unsupervised Segmentation
Methods for MRI Based on Modified Fuzzy
$C$-Means . . . . . . . . . . . . . . . 465--481
Eun-Jun Yoon and
Kee-Young Yoo Robust User Password Change Scheme based
on the Elliptic Curve Cryptosystem . . . 483--492
Luca Aceto and
Wan Fokkink and
Anna Ingolfsdottir A Cancellation Theorem for BCCSP . . . . 1--21
Chin-Chen Chang and
Chia-Chen Lin and
Yi-Hui Chen Adaptive Data Embedding Scheme Based on
Similar and Dissimilar Clustering
Strategies . . . . . . . . . . . . . . . 23--45
Yung-Chen Chou and
Chin-Chen Chang and
Kuan-Ming Li A Large Payload Data Embedding Technique
for Color Images . . . . . . . . . . . . 47--61
Ferruccio Damiani and
Elena Giachino and
Paola Giannini Alias Types and Effects for
``Environment-aware'' Computations . . . 63--107
Hassan Haghighi and
Seyed-Hassan Mirian-Hosseinabadi Nondeterminism in Constructive $Z$ . . . 109--134
Sattar Hashemi and
Mohammadreza Kangavari and
Ying Yang Class Specific Fuzzy Decision Trees for
Mining High Speed Data Streams . . . . . 135--160
Pradipta Maji and
Malay K. Kundu and
Bhabatosh Chanda Second Order Fuzzy Measure and Weighted
Co-Occurrence Matrix for Segmentation of
Brain MR Images . . . . . . . . . . . . 161--176
Vibha S. Vyas and
Priti P. Rege Geometric transform Invariant Texture
Analysis based on Modified Zernike
Moments . . . . . . . . . . . . . . . . 177--192
Hu Xiong and
Zhiguang Qin and
Fagen Li An Improved Certificateless Signature
Scheme Secure in the Standard Model . . 193--206
Zhanbo Yang A New Proof on Embedding the Category of
Proximity Spaces into the Category of
Nearness Spaces . . . . . . . . . . . . 207--223
Anonymous Preface . . . . . . . . . . . . . . . . ??
Marc Boyer and
Olivier H. Roux On the Compared Expressiveness of Arc,
Place and Transition Time Petri Nets . . 225--249
Ranko Lazi\'c and
Tom Newcomb and
Joël Ouaknine and
A. W. Roscoe and
James Worrell Nets with Tokens which Carry Data . . . 251--274
Pierre Ganty and
Jean-François Raskin and
Laurent Van Begin From Many Places to Few: Automatic
Abstraction Refinement for Petri Nets 275--305
Maciej Koutny and
Marta Pietkiewicz-Koutny Synthesis of Elementary Net Systems with
Context Arcs and Localities . . . . . . 307--328
Fernando Rosa-Velardo and
David de Frutos-Escrig Name Creation vs. Replication in Petri
Net Systems . . . . . . . . . . . . . . 329--356
Jonathan Billington and
Somsak Vanit-Anunchai Coloured Petri Net Modelling of an
Evolving Internet Standard: the Datagram
Congestion Control Protocol . . . . . . 357--385
Kees van Hee and
Alexander Serebrenik and
Natalia Sidorova and
Wil van der Aalst Working with the Past: Integrating
History in Petri Nets . . . . . . . . . 387--409
Anonymous Application of Concurrency to System
Design, the Sixth Special Issue . . . . ??
Frédéric Béal and
Tomohiro Yoneda and
Chris J. Myers Hazard Checking of Timed Asynchronous
Circuits Revisited . . . . . . . . . . . 411--435
Robin Bergenthum and
Jörg Desel and
Robert Lorenz and
Sebastian Mauser Synthesis of Petri Nets from Finite
Partial Languages . . . . . . . . . . . 437--468
Hanifa Boucheneb and
Hind Rakkay A More Efficient Time Petri Net State
Space Abstraction Useful to Model
Checking Timed Linear Properties . . . . 469--495
Franck Cassez and
Stavros Tripakis Fault Diagnosis with Static and Dynamic
Observers . . . . . . . . . . . . . . . 497--540
Victor Khomenko and
Mark Schaefer and
Walter Vogler Output-Determinacy and Asynchronous
Circuit Synthesis . . . . . . . . . . . 541--579
Danil Sokolov and
Ivan Poliakov and
Alex Yakovlev Analysis of Static Data Flow Structures 581--610
Anonymous Progress on Multi-Relational Data Mining ??
Jeroen De Knijf and
Ad Feelders An Experimental Comparison of Different
Inclusion Relations in Frequent Tree
Mining . . . . . . . . . . . . . . . . . 1--22
Floriana Esposito and
Nicola Di Mauro and
Teresa M. A. Basile and
Stefano Ferilli Multi-Dimensional Relational Sequence
Mining . . . . . . . . . . . . . . . . . 23--43
Nuno A. Fonseca and
Rui Camacho and
Ricardo Rocha and
Vítor Santos Costa Compile the Hypothesis Space: Do it
Once, Use it Often . . . . . . . . . . . 45--67
Hongyu Guo and
Herna L. Viktor Learning from Skewed Class
Multi-relational Databases . . . . . . . 69--94
Ond\vrej Ku\vzelka and
Filip \vZelezný A Restarted Strategy for Efficient
Subsumption Testing . . . . . . . . . . 95--109
Niels Landwehr and
Bernd Gutmann and
Ingo Thon and
Luc De Raedt and
Matthai Philipose Relational Transformation-based Tagging
for Activity Recognition . . . . . . . . 111--129
Wannes Meert and
Jan Struyf and
Hendrik Blockeel Learning Ground CP-Logic Theories by
Leveraging Bayesian Network Learning
Techniques . . . . . . . . . . . . . . . 131--160
Chien-Fu Cheng and
Shu-Ching Wang and
Tyne Liang Byzantine Agreement & Fault Diagnosis
Agreement in Dynamic Ad-Hoc Environment 161--187
Krzysztof Dembczy\'nski and
Wojciech Kot\lowski and
Marcin Sydow Effective Prediction of Web User
Behaviour with User-Level Models . . . . 189--206
Zoltán Fülöp and
Loránd Muzamel Pebble Macro Tree Transducers with
Strong Pebble Handling . . . . . . . . . 207--257
Gösta Grahne and
Alex Thomo and
William W. Wadge Preferential Regular Path Queries . . . 259--288
Tomasz Jurdzi\'nski The Boolean Closure of Growing
Context-Sensitive Languages . . . . . . 289--305
Daniel Leivant Logical Undecidabilities Made Easy . . . 307--312
Anna Nepomniaschaya Efficient Implementation of the Italiano
Algorithms for Updating the Transitive
Closure on Associative Parallel
Processors . . . . . . . . . . . . . . . 313--329
Indranil Saha and
Bhargab B. Bhattacharya and
Sheng Zhang and
Sharad C. Seth Planar Straight-Line Embedding of
Double-Tree Scan Architecture on a
Rectangular Grid . . . . . . . . . . . . 331--344
Filip \vSvr\vcek On the Axiomatic System of SBL$ \not $
algebras . . . . . . . . . . . . . . . . 345--368
Anonymous Fundamentals of Software Engineering
2007: Selected Contributions . . . . . . ??
Ingo Brückner and
Klaus Dräger and
Bernd Finkbeiner and
Heike Wehrheim Slicing Abstractions . . . . . . . . . . 369--392
Mohammad Torabi Dashti and
Srijith Krishnan Nair and
Hugo Jonker Nuovo DRM Paradiso: Designing a Secure,
Verified, Fair Exchange DRM Scheme . . . 393--417
Parosh Aziz Abdulla and
Johann Deneux and
Joël Ouaknine and
Karin Quaas and
James Worrell Universality Analysis for One-Clock
Timed Automata . . . . . . . . . . . . . 419--450
Mario Bravetti and
Gianluigi Zavattaro A Foundational Theory of Contracts for
Multi-party Service Composition . . . . 451--478
Filippo Bonchi and
Antonio Brogi and
Sara Corfini and
Fabio Gadducci On the Use of Behavioural Equivalences
for Web Services' Development . . . . . 479--510
Carlo Montangero and
Stephan Reiff-Marganiec and
Laura Semini Logic-based Conflict Detection for
Distributed Policies . . . . . . . . . . 511--538
Seyyed Vahid Hashemian and
Farhad Mavaddat A Logical Reasoning Approach to
Automatic Composition of Stateless
Components . . . . . . . . . . . . . . . 539--577
Jean-Marc Champarnaud and
Faissal Ouardi and
Djelloul Ziadi An Efficient Computation of the Equation
$K$-automaton of a Regular
$K$-expression . . . . . . . . . . . . . 1--16
Chin-Chen Chang and
Yung-Chen Chou A Fragile Digital Image Authentication
Scheme Inspired by Wet Paper Codes . . . 17--26
J\=anis C\=irulis Rough Set Algebras as Description
Domains . . . . . . . . . . . . . . . . 27--41
S. Ferilli and
T. M. A. Basile and
M. Biba and
N. Di Mauro and
F. Esposito A General Similarity Framework for Horn
Clause Logic . . . . . . . . . . . . . . 43--66
Joachim Giesen and
Eva Schuberth and
Milo\vs Stojakovi\'c Approximate Sorting . . . . . . . . . . 67--72
Marcin Gorawski and
Adam Dyga Indexing of Spatio-Temporal Telemetric
Data Based on Adaptive Multi-Dimensional
Bucket Index . . . . . . . . . . . . . . 73--86
Radomír Hala\vs A Note on Axiom System for SBL$^\neg
$-algebras . . . . . . . . . . . . . . . 87--92
Yo-Sub Han and
Kai Salomaa and
Derick Wood Nondeterministic State Complexity of
Basic Operations for Prefix-Free Regular
Languages . . . . . . . . . . . . . . . 93--106
Sriparna Saha and
Sanghamitra Bandyopadhyay Some Symmetry Based Classifiers . . . . 107--123
Chung-Chuan Wang and
Chin-Chen Chang and
Jinn-Ke Jan Novel Watermarking Authentication
Schemes for Binary Images Based on
Dual-Pair Block Pixel Patterns . . . . . 125--155
Xia Wang and
Wenxiu Zhang Concept Lattices of Subcontexts of a
Context . . . . . . . . . . . . . . . . 157--169
Chih-Chia Yao and
Pao-Ta Yu and
Ruo-Wei Hung Extractive Support Vector Algorithm on
Support Vector Machines for Image
Restoration . . . . . . . . . . . . . . 171--190
Leyou Zhang and
Yupu Hu and
Qing Wu New Construction of Short Hierarchical
ID-Based Signature in the Standard Model 191--201
Yingxu Wang and
Du Zhang and
Shusaku Tsumoto Preface: Cognitive Informatics,
Cognitive Computing, and Their
Denotational Mathematical Foundations
(I) . . . . . . . . . . . . . . . . . . ??
Yingxu Wang and
Witold Kinsner and
James A. Anderson and
Du Zhang and
Yiyu Yao and
Philip Sheu and
Jeffrey Tsai and
Witold Pedrycz and
Jean-Claude Latombe and
Lotfi A. Zadeh and
Dilip Patel and
Christine Chan A Doctrine of Cognitive Informatics (CI) 203--228
Louis ten Bosch and
Lou Boves and
Hugo Van Hamme and
Roger K. Moore A Computational Model of Language
Acquisition: the Emergence of Words . . 229--249
Shusaku Tsumoto and
Shoji Hirano Statistical Independence and
Determinants in a Contingency Table ---
Interpretation of Pearson Residuals
based on Linear Algebra . . . . . . . . 251--267
Jun Peng and
Du Zhang and
Xiaofeng Liao A Digital Image Encryption Algorithm
Based on Hyper-chaotic Cellular Neural
Network . . . . . . . . . . . . . . . . 269--282
Yingxu Wang Paradigms of Denotational Mathematics
for Cognitive Informatics and Cognitive
Computing . . . . . . . . . . . . . . . 283--303
Luis Llana and
Manuel Núuñez Testing Semantics for RTPA . . . . . . . 305--335
Ali Kamandi and
Jafar Habibi A Comparison of Metric-Based and
Empirical Approaches for Cognitive
Analysis of Modeling Languages . . . . . 337--352
Yingxu Wang and
Du Zhang and
Shusaku Tsumoto Preface: Cognitive Informatics,
Cognitive Computing, and Their
Denotational Mathematical Foundations
(II) . . . . . . . . . . . . . . . . . . ??
Yingxu Wang A Formal Syntax of Natural Languages and
the Deductive Grammar . . . . . . . . . 353--368
Hidenao Abe and
Shusaku Tsumoto Investigating Accuracies of
Classifications for Randomized
Imbalanced Class Distributions . . . . . 369--378
Bogdan Kwolek Object segmentation in video via graph
cut built on superpixels . . . . . . . . 379--393
Guoyin Wang and
Yan Wang 3DM: Domain-oriented Data-driven Data
Mining . . . . . . . . . . . . . . . . . 395--426
Shusaku Tsumoto and
Shoji Hirano Contingency Matrix Theory II: Degree of
Dependence as Granularity . . . . . . . 427--442
Yingxu Wang Toward Formal Models of the Theoretical
Framework of Fundamental Economics . . . 443--459
Anonymous Preface . . . . . . . . . . . . . . . . ??
Artiom Alhazov and
Carlos Martín-Vide and
Bianca Truthe and
Jürgen Dassow and
Yurii Rogozhin On Networks of Evolutionary Processors
with Nodes of Two Types . . . . . . . . 1--15
Artiom Alhazov and
Marion Oswald and
Rudolf Freund and
Sergey Verlan Partial Halting and Minimal Parallelism
Based on Arbitrary Rule Partitions . . . 17--34
Dorothea Baumeister and
Jörg Rothe Satisfiability Parsimoniously Reduces to
the Tantrix\TM Rotation Puzzle Problem 35--51
Mark Burgin and
Eugene Eberbach Universality for Turing Machines,
Inductive Turing Machines and
Evolutionary Algorithms . . . . . . . . 53--77
John Fisher and
Marc Bezem Skolem Machines . . . . . . . . . . . . 79--103
Hermann Gruber and
Markus Holzer and
Martin Kutrib More on the Size of Higman--Haines Sets:
Effective Constructions . . . . . . . . 105--121
Turlough Neary and
Damien Woods Four Small Universal Turing Machines . . 123--144
K. G. Subramanian and
Rosihan M. Ali and
Atulya K. Nagar and
Maurice Margenstern Array $P$ Systems and $t$-Communication 145--159
Hiroshi Umeo and
Takashi Yanagihara A Small Five-State Non-Optimum-Time
Solution to the Firing Squad
Synchronization Problem . . . . . . . . 161--178
Damien Woods and
Turlough Neary Small Semi-Weakly Universal Turing
Machines . . . . . . . . . . . . . . . . 179--195
Anonymous Preface . . . . . . . . . . . . . . . . ??
Pablo Arrighi and
Renan Fargetton and
Zizhu Wang Intrinsically Universal One-dimensional
Quantum Cellular Automata in Two
Flavours . . . . . . . . . . . . . . . . 197--230
Alberto Bertoni and
Massimiliano Goldwurm and
Violetta Lonati The Complexity of Unary Tiling
Recognizable Picture Languages:
Nondeterministic and Unambiguous Cases 231--249
Simon Bliudze and
Daniel Krob Modelling of Complex Systems: Systems as
Dataflow Machines . . . . . . . . . . . 251--274
Marius Bozga and
Radu Iosif and
Yassine Lakhnech Flat Parametric Counter Automata . . . . 275--303
Olivier Finkel Highly Undecidable Problems about
Recognizability by Tiling Systems . . . 305--323
Katalin Friedl and
Miklos Santha and
Frédéric Magniez and
Pranab Sen Quantum Testers for Hidden Group
Properties . . . . . . . . . . . . . . . 325--340
Gabriel Istrate On the Dynamics of Social Balance on
General Networks (with an application to
XOR-SAT) . . . . . . . . . . . . . . . . 341--356
Sylvain Lippi Universal Hard Interaction for Clockless
Computation . . . . . . . . . . . . . . 357--394
Alexei Lisitsa and
Igor Potapov On the Computational Power of Querying
the History . . . . . . . . . . . . . . 395--409
Iain A. Stewart Program Schemes, Queues, the Recursive
Spectrum and Zero-one Laws . . . . . . . 411--435
Maurice H. ter Beek and
Jetty Kleijn Associativity of Infinite Synchronized
Shuffles and Team Automata . . . . . . . 437--461
Gilles Bernot and
Fariza Tahi Behaviour Preservation of a Biological
Regulatory Network when Embedded into a
Larger Network . . . . . . . . . . . . . 463--485
Partha Bhowmick and
Bhargab B. Bhattacharya Real Polygonal Covers of Digital Discs
--- Some Theories and Experiments . . . 487--505
Robertas Dama\vsevi\vcius Analysis of Components for
Generalization using Multidimensional
Scaling . . . . . . . . . . . . . . . . 507--522
Chong-zhi Gao and
Zheng-an Yao A Further Improved Online/Offline
Signature Scheme . . . . . . . . . . . . 523--532
Luc Gillibert and
Alain Bretto Hypergraphs for Generic Lossless Image
Compression . . . . . . . . . . . . . . 533--546
Florentina Hristea and
Marius Popescu Adjective Sense Disambiguation at the
Border Between Unsupervised and
Knowledge-Based Techniques . . . . . . . 547--562
Chang-Chin Huang and
Du-Shiau Tsai and
Gwoboa Horng A Fast VQ Codebook Generation Algorithm
Based on Otsu Histogram Threshold . . . 563--579
Ching-Chiuan Lin and
Shun-Ping Yang and
Nien-Lin Hsueh Reversible Data Hiding Based on
Three-Circular-Pixel Difference
Expansion . . . . . . . . . . . . . . . 581--595
Tzu-Chuen Lu and
Chin-Chen Chang and
Yi-Long Liu An Information-Hiding Scheme Based on
Quantization-Based Embedding Technique 597--610
Nelma Moreira and
Rogério Reis Series-Parallel Automata and Short
Regular Expressions . . . . . . . . . . 611--629
Kedian Mu and
Weiru Liu and
Zhi Jin and
Ruqian Lu and
Anbu Yue and
David Bell Handling Inconsistency In Distributed
Software Requirements Specifications
Based On Prioritized Merging . . . . . . 631--670
Patricia Bouyer and
Serge Haddad and
Pierre-Alain Reynier Undecidability Results for Timed
Automata with Silent Transitions . . . . 1--25
Chin-Chen Chang and
Tzung-Her Chen and
Li-Jen Liu Preventing Cheating in Computational
Visual Cryptography . . . . . . . . . . 27--42
Jacek Czerniak Evolutionary Approach to Data
Discretization for Rough Sets Theory . . 43--61
Kimmo Fredriksson and
Fedor Nikitin Simple Random Access Compression . . . . 63--81
Sven Hartmann and
Sebastian Link On Inferences of Weak Multivalued
Dependencies . . . . . . . . . . . . . . 83--102
Johanna Högberg and
Andreas Maletti and
Heiko Vogler Bisimulation Minimisation of Weighted
Automata on Unranked Trees . . . . . . . 103--130
Kuo Lung Hung and
Shin-Wei He Feature Based Affine Invariant
Watermarking Robust to Geometric
Distortions . . . . . . . . . . . . . . 131--143
Rakesh Verma Complexity of Normal Form Properties and
Reductions for Term Rewriting Problems
Complexity of Normal Form Properties and
Reductions for Term Rewriting Problems 145--168
Pawe\l Waszkiewicz On Domain Theory over Girard Quantales 169--192
Eugénie Foustoucos and
Labrini Kalantzi The Monadic Second-order Logic
Evaluation Problem on Finite Colored
Trees: a Database-theoretic Approach . . 193--231
Karsten Hölscher and
Hans-Jörg Kreowski and
Sabine Kuske Autonomous Units to Model Interacting
Sequential and Parallel Processes . . . 233--257
Mikhail Ju. Moshkov and
Marcin Piliszczuk and
Beata Zielosko Greedy Algorithm for Construction of
Partial Association Rules . . . . . . . 259--277
Jacek Sroka and
Jan Hidders Towards a Formal Semantics for the
Process Model of the Taverna Workbench.
Part I . . . . . . . . . . . . . . . . . 279--299
Lei Yinbin and
Luo Maokang A Proof of Plotkin's Conjecture . . . . 301--306
Willem Conradie and
Valentin Goranko and
Dimiter Vakarelov Algorithmic Correspondence and
Completeness in Modal Logic. III.
Extensions of the Algorithm SQEMA with
Substitutions . . . . . . . . . . . . . 307--343
Anindya Halder and
Ashish Ghosh and
Susmita Ghosh Aggregation Pheromone Density Based
Pattern Classification . . . . . . . . . 345--362
Anthony Spatharis and
Ilias Foudalis and
Martha Sideri and
Christos Papadimitriou Comparing Trade-off Based Models of the
Internet . . . . . . . . . . . . . . . . 363--372
Jacek Sroka and
Jan Hidders Towards a Formal Semantics for the
Process Model of the Taverna Workbench.
Part II . . . . . . . . . . . . . . . . 373--396
Cheng-Hsing Yang and
Chi-Yao Weng and
Shiuh-Jeng Wang and
Hung-Min Sun Codebook-linked Watermarking Scheme for
Digital Images . . . . . . . . . . . . . 397--409
Sheng Zhong On Distributed $k$-Anonymization . . . . 411--431
Anonymous Concurrency Specification and
Programming (CS&P) . . . . . . . . . . . ??
Krzysztof Balicki and
Marcin Szpyrka Formal Definition of XCCS Modelling
Language . . . . . . . . . . . . . . . . 1--15
Roberto Barbuti and
Andrea Maggiolo-Schettini and
Paolo Milazzo and
Simone Tini $P$ Systems with Transport and Diffusion
Membrane Channels . . . . . . . . . . . 17--31
Kamila Barylska and
Edward Ochma\'nski Levels of Persistency in
Place/Transition Nets . . . . . . . . . 33--43
Marco Bellia and
M. Eugenia Occhiuto Java$ \Omega $: The Structures and the
Implementation of a Preprocessor for
Java with $m$ and $ m c$ parameters . . 45--64
Katarzyna Budzy\'nska and
Magdalena Kacprzak and
Pawe\l Rembelski Perseus. Software for Analyzing
Persuasion Process . . . . . . . . . . . 65--79
Nils Bulling and
Wojciech Jamroga What Agents Can Probably Enforce . . . . 81--96
Ludwik Czaja and
Manfred Kudlek Analysis and Synthesis of Net Structures
and Transition Graphs . . . . . . . . . 97--110
Anatoliy Doroshenko and
Olena Yatsenko Using Ontologies and Algebra of
Algorithms for Formalized Development of
Parallel Programs . . . . . . . . . . . 111--125
Natalya Gribovskaya and
Irina Virbitskaite Timed Delay Bisimulation is an
Equivalence Relation for Timed
Transition Systems . . . . . . . . . . . 127--142
Piotr Grochowalski and
Krzysztof Pancerz The Outline of an Ontology for the Rough
Set Theory and its Applications . . . . 143--154
Damas P. Gruska Quantifying Security for Timed Process
Algebras . . . . . . . . . . . . . . . . 155--169
Kees M. van Hee and
Natalia Sidorova and
Marc Voorhoeve and
Jan Martijn van derWerf Generation of Database Transactions with
Petri Nets . . . . . . . . . . . . . . . 171--184
Gizela Jakubowska and
Piotr Dembi\'nski and
Wojciech Penczek and
Maciej Szreter Simulation of Security Protocols based
on Scenarios of Attacks . . . . . . . . 185--203
Michael Kohler-Bußmeier and
Frank Heitmann On the Expressiveness of Communication
Channels for Object Nets . . . . . . . . 205--219
Manfred Kudlek and
Patrick Totzke and
Georg Zetzsche Multiset Pushdown Automata . . . . . . . 221--233
Manfred Kudlek and
Patrick Totzke and
Georg Zetzsche Properties of Multiset Language Classes
Defined by Multiset Pushdown Automata 235--244
Miros\law Kurkowski and
Wojciech Penczek Timed Automata Based Model Checking of
Timed Security Protocols . . . . . . . . 245--259
Mikhail Ju. Moshkov and
Andrzej Skowron and
Zbigniew Suraj On Minimal Inhibitory Rules for Almost
All $k$-Valued Information Systems . . . 261--272
Linh Anh Nguyen An Efficient Tableau Prover using Global
Caching for the Description Logic ALC 273--288
Artur Niewiadomski and
Wojciech Penczek and
Maciej Szreter A New Approach to Model Checking of UML
State Machines . . . . . . . . . . . . . 289--303
Artur Rataj and
Bo\.zena Wo\'zna and
Andrzej Zbrzezny A Translator of Java Programs to TADDs 305--324
Roman R. Redziejowski Applying Classical Concepts to Parsing
Expression Grammar . . . . . . . . . . . 325--336
Jan-Thierry Wegener and
Louchka Popova-Zeugmann Petri Nets with Time Windows: A
Comparison to Classical Petri Nets . . . 337--352
Janusz Czelakowski AC is Equivalent to the Coherence
Principle. Corrigendum to my Paper
``Induction Principles for Sets'' . . . 353--356
Liviu P. Dinu On Insertion Grammars with Maximum
Parallel Derivation . . . . . . . . . . 357--369
Rob van Glabbeek and
Bas Luttik and
Nikola Tr\vcka Branching Bisimilarity with Explicit
Divergence . . . . . . . . . . . . . . . 371--392
Yuxia Lei and
Yuefei Sui and
Cungen Cao Normalized-scale Relations and Their
Concept Lattices in Relational Databases 393--409
Maciej Paszy\'nski On the Parallelization of Self-Adaptive
$ h p$-Finite Element Methods Part I.
Composite Programmable Graph Grammar
Model . . . . . . . . . . . . . . . . . 411--434
Maciej Paszy\'nski On the Parallelization of Self-Adaptive
hp-Finite Element Methods Part II.
Partitioning Communication Agglomeration
Mapping (PCAM) Analysis . . . . . . . . 435--457
Ling Zhang and
Fu-gui He and
Yan-ping Zhang and
Shu Zhao A New Algorithm for Optimal Path Finding
in Complex Networks Based on the
Quotient Space . . . . . . . . . . . . . 459--469
Roberto Barbuti and
Andrea Maggiolo-Schettini and
Paolo Milazzo and
Luca Tesei Timed $P$ Automata . . . . . . . . . . . 1--19
Rajeev Goré and
Linh Anh Nguyen Clausal Tableaux for Multimodal Logics
of Belief . . . . . . . . . . . . . . . 21--40
Michiro Kondo Algebraic Properties of Generalized
Rough Sets . . . . . . . . . . . . . . . 41--48
Ewa Madali\'nska-Bugaj and
Witold \Lukaszewicz First-order Generalization of the MPMA
Belief Update Operator . . . . . . . . . 49--61
Maurice Margenstern The Injectivity of the Global Function
of a Cellular Automaton in the
Hyperbolic Plane is Undecidable . . . . 63--99
Mikhail Ju. Moshkov and
Marcin Piliszczu and
Beata Zielosko Greedy Algorithms with Weights for
Construction of Partial Association
Rules . . . . . . . . . . . . . . . . . 101--120
Anonymous Fundamentals of Knowledge Technology . . ??
Piotr Blajdo and
Zdzis\law S. Hippe and
Teresa Mroczek and
Jerzy W. Grzymala-Busse and
Maksymilian Knap and
Lukasz Piatek An Extended Comparison of Six Approaches
to Discretization --- A Rough Set
Approach . . . . . . . . . . . . . . . . 121--131
Chien-Chung Chan and
Gwo-Hshiung Tzeng Dominance-Based Rough Sets Using Indexed
Blocks as Granules . . . . . . . . . . . 133--146
Davide Ciucci Approximation Algebra and Framework . . 147--161
Krzysztof Dembczy\'nski and
Wojciech Kot\lowski and
Roman S\lowi\'nski Learning Rule Ensembles for Ordinal
Classification with Monotonicity
Constraints . . . . . . . . . . . . . . 163--178
Xun Gong and
Guoyin Wang and
Lili Xiong Single $2$D Image-based $3$D Face
Reconstruction and Its Application in
Pose Estimation . . . . . . . . . . . . 179--195
Ryszard Janicki Pairwise Comparisons Based Non-Numerical
Ranking . . . . . . . . . . . . . . . . 197--217
Huaxiong Li and
Yiyu Yao and
Xianzhong Zhou and
Bing Huang A Two-Phase Model for Learning Rules
from Incomplete Data . . . . . . . . . . 219--232
Pawan Lingras and
Min Chen and
Duoqian Miao Semi-supervised Rough Cost/Benefit
Decisions . . . . . . . . . . . . . . . 233--244
Dun Liu and
Tianrui Li and
Da Ruan and
Weili Zou An Incremental Approach for Inducing
Knowledge from Dynamic Information
Systems . . . . . . . . . . . . . . . . 245--260
Jing Song and
Tianrui Li and
Da Ruan An Integration of Cloud Transform and
Rough Set Theory to Induction of
Decision Trees . . . . . . . . . . . . . 261--273
Anonymous Fundamenta Informaticae (2009) Petri
Nets 2008 . . . . . . . . . . . . . . . ??
Philippe Darondeau and
Maciej Koutny and
Marta Pietkiewicz-Koutny and
Alex Yakovlev Synthesis of Nets with Step Firing
Policies . . . . . . . . . . . . . . . . 275--303
Filippo Bonchi and
Antonio Brogi and
Sara Corfini and
Fabio Gadducci A Net-based Approach to Web Services
Publication and Replaceability . . . . . 305--330
Robin Bergenthum and
Sebastian Mauser and
Robert Lorenz and
Gabriel Juhas Unfolding Semantics of Petri Nets Based
on Token Flows . . . . . . . . . . . . . 331--360
Lars M. Kristensen and
Paul Fleischer Modelling and Validation of Secure
Connection Establishment in a Generic
Access Network Scenario . . . . . . . . 361--386
J. M. E. M. van derWerf and
B. F. van Dongen and
C. A. J. Hurkens and
A. Serebrenik Process Discovery using Integer Linear
Programming . . . . . . . . . . . . . . 387--412
Alexandre Hamez and
Yann Thierry-Mieg and
Fabrice Kordon Building Efficient Model Checkers using
Hierarchical Set Decision Diagrams and
Automatic Saturation . . . . . . . . . . 413--437
Roland Meyer and
Victor Khomenko and
Tim Strazny A Practical Approach to Verification of
Mobile Systems Using Net Unfoldings . . 439--471
Anonymous Application of Concurrency to System
Design, the Seventh Special Issue . . . ??
Dominic Wist and
Ralf Wollowski and
Mark Schaefer and
Walter Vogler Avoiding Irreducible CSC Conflicts by
Internal Communication . . . . . . . . . 1--29
Navid Toosizadeh and
Safwat G. Zaky Application of Concurrency in the
Asynchronous Design of Write-after-read
Operations . . . . . . . . . . . . . . . 31--52
Shufan Yang and
Steve B. Furber and
Yebin Shi and
Luis A. Plana A Token-Managed Admission Control System
for QoS Provision on a Best-Effort GALS
Interconnect . . . . . . . . . . . . . . 53--72
Claudio Guidi and
Ivan Lanese and
Fabrizio Montesi and
Gianluigi Zavattaro Dynamic Error Handling in Service
Oriented Applications . . . . . . . . . 73--102
Sun Meng and
Farhad Arbab QoS-Driven Service Selection and
Composition Using Quantitative
Constraint Automata . . . . . . . . . . 103--128
E. Moritz Hahn and
Holger Hermanns and
Björn Wachter and
Lijun Zhang Time-Bounded Model Checking of
Infinite-State Continuous-Time Markov
Chains . . . . . . . . . . . . . . . . . 129--155
Jasen Markovski and
Erik P. de Vink Performance Evaluation of Distributed
Systems Based on a Discrete Real- and
Stochastic-Time Process Algebra . . . . 157--186
Robin Bergenthum and
Jörg Desel and
Sebastian Mauser and
Robert Lorenz Synthesis of Petri Nets from Term Based
Representations of Infinite Partial
Languages . . . . . . . . . . . . . . . 187--217
Agnes Madalinski and
Eric Fabre Modular Construction of Finite and
Complete Prefixes of Petri net
Unfoldings . . . . . . . . . . . . . . . 219--244
Mehdi Chehel Amirani and
Ali Asghar Beheshti Shirazi Evaluation of the Texture Analysis Using
Spectral Correlation Function . . . . . 245--262
Aleksander Byrski and
Robert Schaefer Stochastic Model of Evolutionary and
Immunological Multi-Agent Systems:
Mutually Exclusive Actions . . . . . . . 263--285
Olivier Finkel and
Pierre Simonnet On Recognizable Tree Languages Beyond
the Borel Hierarchy . . . . . . . . . . 287--303
Gra\.zyna Mirkowska and
Andrzej Salwicki and
Oskar \'Swida Verifying a Class: combining Testing and
Proving . . . . . . . . . . . . . . . . 305--324
Robert Schaefer and
Aleksander Byrski and
Maciej Smo\lka Stochastic Model of Evolutionary and
Immunological Multi-Agent Systems:
Parallel Execution of Local Actions . . 325--348
Krzysztof Trojanowski Properties of Quantum Particles in
Multi-Swarms for Dynamic Optimization 349--380
Sándor Vágvölgyi Congruences Generated by Extended Ground
Term Rewrite Systems . . . . . . . . . . 381--399
Anonymous Swarm Intelligence . . . . . . . . . . . ??
Prithwish Chakraborty and
Gourab Ghosh Roy and
Swagatam Das and
Dhaval Jain and
Ajith Abraham An Improved Harmony Search Algorithm
with Differential Mutation Operator . . 401--426
Zhihua Cui and
Xingjuan Cai Integral Particle Swarm Optimization
with Dispersed Accelerator Information 427--447
Bogdan Kwolek Particle Swarm Optimization Based Object
Tracking . . . . . . . . . . . . . . . . 449--463
Hongbo Liu and
Ajith Abraham and
Zuwen Wang A Multi-swarm Approach to
Multi-objective Flexible Job-shop
Scheduling Problems . . . . . . . . . . 465--489
Ming-Tsung Liu and
Pao-Ta Yu Robust Candidate Pruning Approach Based
on the PSO-SVM for Fast Corner Detection
with Noise Tolerance in Gray-Level
Images . . . . . . . . . . . . . . . . . 491--510
Millie Pant and
Radha Thangaraj and
Ajith Abraha Low Discrepancy Initialized Particle
Swarm Optimization for Solving
Constrained Optimization Problems . . . 511--531
Sheela Ramanna and
Amir H. Meghdadi Measuring Resemblances Between Swarm
Behaviours: A Perceptual Tolerance Near
Set Approach . . . . . . . . . . . . . . 533--552
Sanghamitra Bandyopadhyay and
Malay Bhattacharyya Mining the Largest Dense Vertexlet in a
Weighted Scale-free Graph . . . . . . . 1--25
Jan A. Bergstra and
Cornelis A. Middelburg Instruction Sequences with Dynamically
Instantiated Instructions . . . . . . . 27--48
Chi-Shiang Chan On Using LSB Matching Function for Data
Hiding in Pixels . . . . . . . . . . . . 49--59
Tzung-Her Chen and
Kai-Hsiang Tsao and
Yan-Ting Yang Friendly Color Visual Secret Sharing by
Random Grids . . . . . . . . . . . . . . 61--70
Jürgen Dassow and
Gema M. Martín and
Francisco J. Vico A Similarity Measure for Cyclic Unary
Regular Languages . . . . . . . . . . . 71--88
Jean-Christophe Janodet and
Marc Sebban and
Henri-Maxime Suchier Boosting Classifiers Built from
Different Subsets of Features . . . . . 89--109
Costas D. Koutras and
Yorgos Zikos On a Modal Epistemic Axiom Emerging from
McDermott--Doyle Logics . . . . . . . . 111--125
Ruggero Lanotte and
Dani\`ele Beauquier A Decidable Probability Logic for Timed
Probabilistic Systems . . . . . . . . . 127--151
Soufiane Rital Hypergraph Cuts & Unsupervised
Representation for Image Segmentation 153--179
Witold R. Rudnicki and
Aleksander Jankowski and
Aleksander Modzelewski and
Aleksander Piotrowski and
Adam Zadro\.zny The new SIMD Implementation of the
Smith--Waterman Algorithm on Cell
Microprocessor . . . . . . . . . . . . . 181--194
Sriparna Saha and
Sanghamitra Bandyopadhyay Semi-GAPS: A Semi-supervised Clustering
Method Using Point Symmetry . . . . . . 195--209
Guohua Shen and
Zhiqiu Huang and
Yuping Zhang and
Xiaodong Zhu and
Jun Yang A Semantic Model for Matchmaking of Web
Services Based on Description Logics . . 211--226
Anonymous Advances in Computational Logic (CILC08) ??
Federico Bergenti and
Alessandro Dal Pal\`u and
Gianfranco Rossi Integrating Finite Domain and Set
Constraints into a Set-based Constraint
Language . . . . . . . . . . . . . . . . 227--252
Loris Bozzato and
Mauro Ferrari and
Paola Villa Actions Over a Constructive Semantics
for Description Logics . . . . . . . . . 253--269
Annamaria Bria and
Wolfgang Faber and
Nicola Leone Normal Form Nested Programs . . . . . . 271--295
Alessandro Dal Pal\`u and
Agostino Dovier and
Enrico Pontelli and
Gianfranco Rossi GASP: Answer Set Programming with Lazy
Grounding . . . . . . . . . . . . . . . 297--322
Alessandro Ferrante and
Margherita Napoli and
Mimmo Parente Model Checking for Graded CTL . . . . . 323--339
Laura Giordano and
Nicola Olivetti and
Valentina Gliozzic and
Gian Luca Pozzato ALC + T: a Preferential Extension of
Description Logics . . . . . . . . . . . 341--372
Valerio Senni and
Alberto Pettorossi and
Maurizio Proietti A Folding Rule for Eliminating
Existential Variables from Constraint
Logic Programs . . . . . . . . . . . . . 373--393
Anonymous Advances in Artificial Intelligence and
Applications . . . . . . . . . . . . . . ??
Sang Keun Rhee and
Jihye Lee and
Myon-Woong Park and
Micha\l Szymczak and
Grzegorz Fr\kackowiak and
Maria Ganzha and
Marcin Paprzycki Measuring Semantic Closeness of
Ontologically Demarcated Resources . . . 395--418
Soufiane El Jelali and
Abdelouahid Lyhyaoui and
Aníbal R. Figueiras-Vidal Designing Model Based Classifiers by
Emphasizing Soft Targets . . . . . . . . 419--433
Mariusz Paradowski and
Halina Kwasnicka Improved Resulted Word Counts Optimizer
for Automatic Image Annotation Problem 435--463
Krzysztof Brzostowski and
Jerzy \'Swi\katek Different Approaches to Model
Relationship Between EMG Signals and
Force Moments in Human Skeletal Muscle.
Analysis for Diagnosis of Neuronmuscular
Disorders . . . . . . . . . . . . . . . 465--475
Stefan Kotowski and
Witold Kosi\'nski and
Zbigniew Michalewicz and
Piotr Synak and
\Lukasz Brocki On Stability and Classification Tools
for Genetic Algorithms . . . . . . . . . 477--491
Yan Diqun and
Wang Rangding and
Zhang Liguang Quantization Step Parity-based
Steganography for MP3 Audio . . . . . . 1--14
Ali Hamzeh and
Sattar Hashemi and
Ashkan Sami and
Adel Rahmani A Recursive Classifier System for
Partially Observable Environments . . . 15--40
Maciej Koutny and
Brian Randell Structured Occurrence Nets: A Formalism
for Aiding System Failure Prevention and
Analysis Techniques . . . . . . . . . . 41--91
Meng-Tsan Li and
Nien-Ching Huang and
Kuo-Chen Wu and
Chin-Kai Jan and
Chung-Ming Wang An Effective Message Embedding Scheme
for $3$D Models . . . . . . . . . . . . 93--109
Morgan Magnin and
Pierre Molinaro and
Olivier (H.) Roux Expressiveness of Petri Nets with
Stopwatches. Dense-time Part . . . . . . 111--138
Morgan Magnin and
Pierre Molinaro and
Olivier (H.) Roux Expressiveness of Petri Nets with
Stopwatches. Discrete-time Part . . . . 139--176
A. Mani Algebraic Semantics of Similarity-Based
Bitten Rough Set Theory . . . . . . . . 177--197
Sriparna Saha and
Sanghamitra Bandyopadhyay MR Brain Image Segmentation Using A
Multi-seed Based Automatic Clustering
Technique . . . . . . . . . . . . . . . 199--214
Suman Saha and
C. A. Murthy and
Sankar K. Pal Tensor Framework and Combined Symmetry
for Hypertext Mining . . . . . . . . . . 215--234
Józef Winkowski An Algebraic Framework for Defining
Behaviours of Concurrent Systems. Part
1: The Constructive Presentation . . . . 235--273
Xiangxiang Zeng and
Xingyi Zhang and
Linqiang Pan Homogeneous Spiking Neural $P$ Systems 275--294
Anonymous Special Issue on Stringology . . . . . . ??
David E. Daykin and
Jacqueline W. Daykin and
W. F. (Bill) Smyth Combinatorics of Unique Maximal
Factorization Families (UMFFs) . . . . . 295--309
Costas S. Iliopoulos and
W. F. Smyth and
Munina Yusufu Faster Algorithms for Computing Maximal
Multirepeats in Multiple Sequences . . . 311--320
Travis Gagie A New Algorithm for Building Alphabetic
Minimax Trees . . . . . . . . . . . . . 321--329
Julien Allali and
Pascal Ferraro and
Pierre Hanna and
Costas Iliopoulos and
Matthias Robine Toward a General Framework for
Polyphonic Comparison . . . . . . . . . 331--346
Ivo Düntsch and
Ian Pratt-Hartmann Complex Algebras of Arithmetic . . . . . 347--367
The Duc Kieu and
Chin-Chen Chang An Image Authentication Based on
Discrete Fourier Transform . . . . . . . 369--379
Kaushik Suresh and
Debarati Kundu and
Sayan Ghosh and
Swagatam Das and
Ajith Abraham Data Clustering Using Multi-objective
Differential Evolution Algorithms . . . 381--403
Aida Vitória and
Jan Ma\luszy\'nski and
Andrzej Sza\las Modeling and Reasoning with
Paraconsistent Rough Sets . . . . . . . 405--438
Józef Winkowski An Algebraic Framework for Defining
Behaviours of Concurrent Systems. Part
2: The Axiomatic Presentation . . . . . 439--470
Zhiming Zhang An Interval-Valued Intuitionistic Fuzzy
Rough Set Model . . . . . . . . . . . . 471--498