Last update:
Thu Aug 1 11:55:19 MDT 2019
K. R. Apt and
H. A. Blair Arithmetic classification of perfect
models of stratified programs . . . . . 1--17
M. Fitting and
M. Ben-Jacob Stratified, weak stratified and
three-valued semantics . . . . . . . . . 19--33
K. Kunen Some remarks on the completed database 35--49
H. Przymusinska and
T. C. Przymunsinski Weakly stratified logic programs . . . . 51--65
R. Bagai and
M. Bezem and
M. H. van Emden On downward closure ordinals of logic
programs . . . . . . . . . . . . . . . . 67--83
S. Mauw and
G. J. Veltink A process specification formalism . . . 85--139
A. Maggiolo-Schettini and
J. Winkowski A compositional semantics for timed
Petri nets . . . . . . . . . . . . . . . 141--170
V. E. C\uaz\uanescu and
Gheorghe Stef\uanescu Towards a new algebraic foundation of
flowchart scheme theory . . . . . . . . 171--210
Z. Fülop and
S. Vágvölgyi A characterization of irreducible sets
modulo left-linear term rewriting
systems by tree automata . . . . . . . . 211--226
M. Krynicki A note on rough concepts logic . . . . . 227--235
M. Novotný Reducing operators for generalized
grammars . . . . . . . . . . . . . . . . 237--244
A. Skowron The rough sets theory and evidence
theory . . . . . . . . . . . . . . . . . 245--262
A. B. Romanowska and
J. D. H. Smith Communicating processes and entropic
algebras . . . . . . . . . . . . . . . . 263--274
N. W. Keesmaat and
H. C. M. Kleijn and
G. Rozenberg Vector controlled concurrent systems.
Part I: basic classes . . . . . . . . . 275--316
A. Hirani and
V. S. Subrahmanian Algebraic foundations of logic
programming, I: the distributive lattice
of logic programs . . . . . . . . . . . 317--332
Z. Stachniak and
P. O'Hearn Resolution in the domain of strongly
finite logics . . . . . . . . . . . . . 333--351
P. Darondeau and
B. Gamatie Infinitary behaviours and infinitary
observations . . . . . . . . . . . . . . 353--386
H. Kleine Büning and
U. Löwen Towards average complexity of
propositional binary . . . . . . . . . . 387--399
Michael Gelfond and
Halina Przymusinska Formalization of inheritance reasoning
in autoepistemic logic . . . . . . . . . 403--443
Teodor Przymusinski Well-founded semantics coincides with
three-valued stable semantics . . . . . 445--463
V. S. Subrahmanian $Y$-logic: a framework for reasoning
about chameleonic programs with
inconsistent completions . . . . . . . . 465--483
Aidong Zhang and
Wiktor Marek On the classification and existence of
structures in default logic . . . . . . 485--499
N. W. Keesmaat and
H. C. M. Kleijn and
G. Rozenberg Vector controlled concurrent systems,
Part II: comparisons . . . . . . . . . . 1--38
Rita Loogen and
Ursula Goltz Modelling nondeterministic concurrent
processes with event structures . . . . 39--74
Pawel Wla\'z On uniqueness of the Wulff shape for
cellular automata . . . . . . . . . . . 75--90
Jaroslaw Stepaniuk Applications of finite models properties
in approximation and algorithmic logics 91--108
Andrea Maggiolo Schettini and
G. Michele Pinna and
Józef Winkowski A compositional semantics for unmarked
predicate/transition nets . . . . . . . 109--128
Zbigniew Stachniak Minimization of resolution proof systems 129--146
K. Vidyasankar Unified theory of database
serializability . . . . . . . . . . . . 147--183
Bernd Becker and
Uwe Sparmann A uniform test approach for RCC-adders 185--219
Philippe Darondeau and
Pierpaolo Degano About semantic action refinement . . . . 221--234
Maciej Koutny Axiom system induced by CTL* Logic . . . 235--253
Erkki Mäkinen A hierarchy of context-free derivations 255--259
Fred Kröger and
Stephan Merz Temporal logic and recursion . . . . . . 261--281
Tudor Balanescu and
Marian Gheorghe A note on PF(k) --- parsable languages 283--286
Hendrik Jan Hoodgeboom and
Grzegorz Rozenberg Diamond properties of elementary net
systems . . . . . . . . . . . . . . . . 287--300
Stefka P. Stoeva On processing of fuzzy production
systems . . . . . . . . . . . . . . . . 301--312
Rana Barua On generalized automata . . . . . . . . 313--322
Stefano Baratella Models of Clark's completion for some
classes of logic programs . . . . . . . 323--337
Krzysztof R. Apt and
Howard A. Blair Arithmetic classification of perfect
models of stratified programs . . . . . 339--343
Michael Kaminski Embedding a default system into
nonmonotonic logics . . . . . . . . . . 345--353
Miroslaw Truszczynski Modal nonmonotonic logic with restricted
application of the negation as failure
to prove rule . . . . . . . . . . . . . 355--366
Andrzej Jankowski and
Zbigniew Michalewicz Closed sets of Boolean terms in
relational databases . . . . . . . . . . 367--385
Didier Dubois and
Jér\vome Lang and
Henri Prade Timed possibilistic logic . . . . . . . 211--234
Melvin C. Fitting Many-valued modal logics . . . . . . . . 235--254
Rohit Parikh Monotonic and non-monotonic logics of
knowledge . . . . . . . . . . . . . . . 255--274
Kurt Konolige Quantification in autoepistemic logic 275--300
John F. Horty and
Richmond H. Thomason Conditionals and artificial intelligence 301--323
Sarit Kraus and
Donald Perlis and
John Horty Reasoning about ignorance: a note on the
Bush--Gorbachev problem . . . . . . . . 325--332
Anthony S. Maida and
Jacques Wainer and
Sehyeong Cho A syntactic approach to introspection
and reasoning about the beliefs of other
agents . . . . . . . . . . . . . . . . . 333--356
Tien Huynh and
Leo Joskowicz and
Catherine Lassez and
Jean-Louis Lassez Practical tools for reasoning about
linear constraints . . . . . . . . . . . 357--380
Zbigniew W. Ras Query processing in distributed
information systems . . . . . . . . . . 381--397
J. J. M. M. Rutten and
J. I. Zucker A semantic approach to fairness . . . . 1--38
Martin Leischner On the compactness theorem of
propositional temporal logics . . . . . 39--57
Michael Gelfond and
Halina Przymusinska On consistency and completeness of
autoepistemic theories . . . . . . . . . 59--92
Erkki Mäkinen On the generative capacity of
context-free matrix grammars over
one-letter alphabet . . . . . . . . . . 93--97
Egidio Astesiano and
Maura Cerioli Partial higher-order specifications . . 101--126
Barney P. Hilken and
David E. Rydeheard Towards a categorical semantics of type
classes . . . . . . . . . . . . . . . . 127--147
Lavinia Egidi and
Furio Honsell and
Simona Ronchi Della Rocca Operational, denotational and logical
descriptions: a case study . . . . . . . 149--169
Ugo Montanari and
Vladimiro Sassone Dynamic congruence vs. progressing
bisimulation for CCS . . . . . . . . . . 171--199
Manfred Broy Operational and denotational semantics
with explicit concurrency . . . . . . . 201--229
Philippe Balbiani A modal semantics of negation in logic
programming . . . . . . . . . . . . . . 231--262
Ji\vrí Novotný and
Miroslav Novotný Notes on the algebraic approach to
dependence in information systems . . . 263--273
Miroslav Novotný and
Zdzis\law Pawlak On a problem concerning dependence
spaces . . . . . . . . . . . . . . . . . 275--287
Roberto Gorrieri A hierarchy of system descriptions via
atomic linear refinement . . . . . . . . 289--336
Gheorghe Paun and
Miklos Szijarto and
Sorina Vicolov Further remarks on reduced languages . . 337--347
Andrzej Ehrenfeucht and
Marek W. Zawadowski A representation of partial Boolean
algebras . . . . . . . . . . . . . . . . 349--353
William I. Gasarch and
Ramesh K. Sitaraman and
Carl H. Smith and
Mahendran Velauthapillai Learning programs with an easy to
calculate set of errors . . . . . . . . 355--370
Cecylia M. Rauszer Logic for information systems . . . . . 371--382
Dimiter Vakarelov Inductive modal logics . . . . . . . . . 383--405
Craig Boutilier Epistemic entrenchment in autoepistemic
logic . . . . . . . . . . . . . . . . . 5--29
Thomas Eiter and
Georg Gottlob Reasoning with parsimonious and
moderately grounded expansions . . . . . 31--53
Melvin Fitting Many-valued modal logics II . . . . . . 55--73
Gerhard Lakemeyer On perfect introspection with
quantifying-in . . . . . . . . . . . . . 75--98
V. Wiktor Marek and
Miros\law Truszczy\'nski More on modal aspects of default logic 99--116
Ilkka N. F. Niemelä On the decidability and complexity of
autoepistemic reasoning . . . . . . . . 117--155
Grigori Schwarz Reflexive autoepistemic logic . . . . . 157--173
Johan van Benthem Logic as programming . . . . . . . . . . 285--317
Luca Aceto History preserving, causal and
mixed-ordering equivalence over stable
event structures (note) . . . . . . . . 319--331
Herman Akdag and
Michel De Glas and
Daniel Pacholczyk A qualitative theory of uncertainty . . 333--362
Erkki Mäkinen On grammatical inference and
derivational complexity of context-free
grammars . . . . . . . . . . . . . . . . 363--368
Luca Aceto Relating distributed, temporal and
causal observations of simple processes 369--397
Val Breazu-Tannen and
Albert R. Meyer Conservativity of equational theories in
typed lambda calculi . . . . . . . . . . 1--49
P.-L. Curien Substitution up to isomorphism . . . . . 51--85
Paola Giannini and
Furio Honsell and
Simona Ronchi Della Rocca Type inference: some results, some
problems . . . . . . . . . . . . . . . . 87--125
Lalita A. Jategaonkar and
John C. Mitchell Type inference with extended pattern
matching and subtypes . . . . . . . . . 127--165
Daniel Leivant and
Jean-Yves Marion Lambda calculus characterizations of
poly-time . . . . . . . . . . . . . . . 167--184
Frank Pfenning On the undecidability of partial
polymorphic type reconstruction . . . . 185--199
Pawel Urzyczyn Primitive recursion with existential
types . . . . . . . . . . . . . . . . . 201--222
Hiroshi Sakai On a framework for logic programming
with incomplete information . . . . . . 223--234
Cecylia M. Rauszer Dependencies in relational databases
algebraic and logical approach . . . . . 235--274
Andrzej Biela Retrieval system and dynamic algorithm
looking for axioms of notions defined by
programs . . . . . . . . . . . . . . . . 275--301
Mark Levene and
George Loizou A fully precise null extended nested
relational algebra . . . . . . . . . . . 303--342
Ji\vri Novotný and
Miroslav Novotný On dependence in Wille's contexts . . . 343--353
Lila Kari and
Alexandru Mateescu and
Arto Salomaa and
Gheorghe P\uaun Deletion sets . . . . . . . . . . . . . 355--370
Gabriele Marongiu and
Sauro Tulipani Undecidable fragments of term algebras
with subterm relation . . . . . . . . . 371--382
Amihood Amir and
Carl H. Smith The syntax of parallelism . . . . . . . 383--402
David Murphy Time and duration in noninterleaving
concurrency . . . . . . . . . . . . . . 403--416
Wiktor Da\'nko The set of probabilistic algorithmic
formulas valid in a finite structure is
decidable with respect to its diagram 417--431
Helena Rasiowa Preface . . . . . . . . . . . . . . . . 1--2
J. W. de Bakker and
E. P. de Vink Bisimulation Semantics for Concurrency
with Atomicity and Action Refinement . . 3--34
Jon Doyle Reasoned Assumptions and Rational
Psychology . . . . . . . . . . . . . . . 35--73
A. Ehrenfeucht and
G. Rozenberg Square Systems . . . . . . . . . . . . . 75--111
Melvin Fitting Kleene's Three Valued Logics and Their
Children . . . . . . . . . . . . . . . . 113--131
T. Harju and
G. Rozenberg Reductions for Primitive $2$-Structures 133--144
Jack Minker and
Carolina Ruiz Semantics for Disjunctive Logic Programs
with Explicit and Default Negation . . . 145--192
Ugo Montanari and
Daniel Yankelevich Combining CCS and Petri Nets Via
Structural Axioms . . . . . . . . . . . 193--229
B. A. Trakhtenbrot Compositional Proofs for Networks of
Processes . . . . . . . . . . . . . . . 231--275
Lidia Tendera A Note on Asymptotic Probabilities of
Existential Second-Order Minimal Classes
--- the Last Step . . . . . . . . . . . 277--285
Thomas Noll and
Heiko Vogler Top-Down Parsing with Simultaneous
Evaluation of Noncircular Attribute
Grammars . . . . . . . . . . . . . . . . 285--332
Cosimo Laneve Distributive Evaluations of $ \lambda
$-Calculus . . . . . . . . . . . . . . . 333--352
Matthias Baaz and
Alexander Leitsch On Skolemization and Proof Complexity 353--379
Kostas Skandalis On the Characterization of Input Sets As
Output Sets . . . . . . . . . . . . . . 381--392
David Etherington and
Henry Kautz and
Kurt Konolige Introduction to the Special Issue . . . 1--5
Robert Stalnaker What Is a Nonmonotonic Consequence
Relation? . . . . . . . . . . . . . . . 7--21
Mark Boddy and
Robert P. Goldman and
Keiji Kanazawa and
Lynn Andrea Stein A Critical Examination of Model
Preference Defaults . . . . . . . . . . 23--38
Philippe Besnard and
Torsten Schaub Possible Worlds Semantics for Default
Logics . . . . . . . . . . . . . . . . . 39--66
Halina Przymusinska and
Teodor Przymusinski Stationary Default Extensions . . . . . 67--87
Camilla Schwind and
Pierre Siegel A Modal Logic for Hypothesis Theory . . 89--101
Marco Cadoli and
Marco Schaerf Approximate Inference in Default Logic
and Circumscription . . . . . . . . . . 103--112
Leopoldo E. Bertossi and
Raymond Reiter Circumscription and Generic Mathematical
Objects . . . . . . . . . . . . . . . . 113--123
L. Thorne McCarty Defeasible Deontic Reasoning . . . . . . 125--148
Matthew L. Ginsberg and
Hugh W. Holbrook What Defaults Can Do That Hierarchies
Can't . . . . . . . . . . . . . . . . . 149--159
J. Komorowski and
Z. W. Ras Guest Editor's preface --- Selected
Papers from the ISMIS'93 Symposium . . . 161--162
Dave Robertson and
Jaume Agustí and
Jane Hesketh and
Jordi Levy Expressing Program Requirements Using
Refinement Lattices . . . . . . . . . . 163--182
Nicola Leone and
Luigi Palopoli and
Massimo Romeo Modifying Intensional Logic Knowledge 183--203
Jianhua Chen The Logic of Only Knowing As a Unified
Framework for Non-Monotonic Reasoning 205--220
Heng Chu and
David A. Plaisted Model Finding in Semantically Guided
Instance-Based Theorem Proving . . . . . 221--235
Neil V. Murray and
Erik Rosenthal Adapting Classical Inference Techniques
to Multiple-Valued Logics Using Signed
Formulas . . . . . . . . . . . . . . . . 237--253
Anonymous Obituary . . . . . . . . . . . . . . . . 255--256
L. E. Moser and
P. M. Melliar-Smith and
G. Kutty and
Y. S. Ramakrishna Completeness and Soundness of
Axiomatizations for Temporal Logics
Without Next . . . . . . . . . . . . . . 257--305
Chitta Baral Varying Selection Functions to Relate
Conditional Logics and Preferential
Models . . . . . . . . . . . . . . . . . 307--319
Ivo Düntsch Rough Relation Algebras . . . . . . . . 321--331
Peter Cholak and
Howard A. Blair The Complexity of Local Stratification 333--344
Hardi Hungar Expressibility of the Semantics of
Sequential Programs in First-Order Logic 345--365
Symeon Bozapalidis Representable Tree Series . . . . . . . 367--389
Mikhail Moshkov Optimization Problems for Decision Trees 391--401
György E. Révész Guest Editor's Note . . . . . . . . . . 1--2
Andrea Asperti Linear Logic, Comonads and Optimal
Reductions . . . . . . . . . . . . . . . 3--22
K. H. Hofmann and
M. W. Mislove All Compact Hausdorff Lambda Models Are
Degenerate . . . . . . . . . . . . . . . 23--52
J. Lambek Cut Elimination for Classical Bilinear
Logic . . . . . . . . . . . . . . . . . 53--67
Giuseppe Longo Parametric and Type-Dependent
Polymorphism . . . . . . . . . . . . . . 69--92
Michael W. Mislove and
Frank J. Oles Adjunctions Between Categories of
Domains . . . . . . . . . . . . . . . . 93--116
Eugenio Moggi A Semantics for Evaluation Logic . . . . 117--152
György E. Révész Categorical Combinators with Explicit
Products . . . . . . . . . . . . . . . . 153--166
Eugene W. Stark An Algebra of Dataflow Networks . . . . 167--185
Eric G. Wagner and
Wafaa Khalil and
R. F. C. Walters Fix-Point Semantics for Programs in
Distributive Categories . . . . . . . . 187--202
Mikhail Moshkov About the Depth of Decision Trees
Computing Boolean Functions . . . . . . 203--215
Jürgen Dassow and
Gheorghe P\uaun and
Sorina Vicolov On the Generative Capacity of Certain
Classes of Cooperating Grammar Systems 217--226
Jürgen Dix A Classification Theory of Semantics of
Normal Logic Programs: I. Strong
Properties . . . . . . . . . . . . . . . 227--255
Jürgen Dix A Classification Theory of Semantics of
Normal Logic Programs: II. Weak
Properties . . . . . . . . . . . . . . . 257--288
Roman M. Kolpakov On the Complexity of Generation of
Rational Numbers by Boolean Functions 289--298
Pierpaolo Degano and
Leonarda Raffoni Fairness and Priority . . . . . . . . . 299--306
Herbert Edelsbrunner and
Jerzy W. Jaromczyk Preface . . . . . . . . . . . . . . . . 307--307
David Eppstein and
Gary L. Miller and
Shang-Hua Teng A Deterministic Linear Time Algorithm
for Geometric Separators and Its
Applications . . . . . . . . . . . . . . 309--329
Christian Icking and
Rolf Klein and
Ngoc-Minh Lé and
Lihong Ma Convex Distance Functions in $3$-Space
Are Different . . . . . . . . . . . . . 331--352
David Kirkpatrick and
Jack Snoeyink Tentative Prune-And-Search for Computing
Fixed-Points with Applications to
Geometric Computation . . . . . . . . . 353--370
Marshall Bern Compatible Tetrahedralizations . . . . . 371--384
Noga Alon and
Sridhar Rajagopalan and
Subhash Suri Long Non-Crossing Configurations in the
Plane . . . . . . . . . . . . . . . . . 385--394
Andrzej Ehrenfeucht and
Joost Engelfriet and
Paulien ten Pas and
Grzegorz Rozenberg Grammatical Codes of Trees and
Terminally Coded Grammars . . . . . . . 1--32
J.-J. Ch. Meyer and
W. van der Hoek A Default Logic Based on Epistemic
States . . . . . . . . . . . . . . . . . 33--65
William I. Gasarch and
Efim B. Kinber and
Mark G. Pleszkoch and
Carl H. Smith and
Thomas Zeugmann Learning Via Queries with Teams and
Anomalies . . . . . . . . . . . . . . . 67--89
Iain A. Stewart Reachability in Some Classes of Acyclic
Petri Nets . . . . . . . . . . . . . . . 91--100
Eric de Kogel Relational Algebra and Equational Proofs 101--121
Marco Cadoli and
Marco Schaerf Approximate Inference in Default Logic
and Circumscription . . . . . . . . . . 123--143
Don Perlis Papers on Context: Theory and Practice 145--148
Guiseppe Attardi and
Maria Simi A Formalization of Viewpoints . . . . . 149--173
Philippe Besnard and
Torsten Schaub An Approach to Context-Based Default
Reasoning . . . . . . . . . . . . . . . 175--223
Raj Bhatnagar Context Hypothesization Using
Probabilistic Knowledge . . . . . . . . 225--246
Paolo Bouquet and
Fausto Giunchiglia Reasoning About Theory Adequacy. a New
Solution to the Qualification Problem 247--262
Sa\vsa Buva\vc and
Vanja Buva\vc and
Ian A. Mason Metamathematics of Contexts . . . . . . 263--301
Mary P. Harper and
Randall A. Helzerman Managing Multiple Knowledge Sources in
Constraint-Based Parsing of Spoken
Language . . . . . . . . . . . . . . . . 303--353
Michael Miller Context Shifts and Clashes in Dialogues:
an Active Logic Perspective . . . . . . 355--370
Madhura Nirkhe and
Sarit Kraus Formal Real-Time Imagination . . . . . . 371--394
David A. Plaisted Editor's Preface . . . . . . . . . . . . 1--2
Bernhard Gramlich Abstract Relations Between Restricted
Termination and Confluence Properties of
Rewrite Systems . . . . . . . . . . . . 3--23
Ursula Martin On the Diversity of Orderings on Strings 25--46
Joachim Steinbach Simplification Orderings: History of
Results . . . . . . . . . . . . . . . . 47--87
H. Zantema Termination of Term Rewriting by
Semantic Labelling . . . . . . . . . . . 89--105
Hantao Zhang Contextual Rewriting in Automated
Reasoning . . . . . . . . . . . . . . . 107--123
Alexander Bockmayr and
Stefan Krischer and
Andreas Werner Narrowing Strategies for Arbitrary
Canonical Rewrite Systems . . . . . . . 125--155
Rémy Gilleron and
Sophie Tison Regular Tree Languages and Rewrite
Systems . . . . . . . . . . . . . . . . 157--175
Maria Paola Bonacina and
Jieh Hsiang The Clause-Diffusion Methodology for
Distributed Deduction . . . . . . . . . 177--207
Bart Jacobs Parameters and Parametrization in
Specification, Using Distributive
Categories . . . . . . . . . . . . . . . 209--250
Victor Mitrana Similarity in Grammar Systems . . . . . 251--257
Reinhold Heckmann Lower Bag Domains . . . . . . . . . . . 259--281
J. Gabarró and
M. J. Serna Rational Processes and Linear Systems in
GSP . . . . . . . . . . . . . . . . . . 283--302
Victor Felea On the Family of Conditional
Implicational Dependencies . . . . . . . 303--312
G. Kutty and
L. E. Moser and
P. M. Melliar-Smith and
Y. S. Ramakrishna and
L. K. Dillon Axiomatizations of Interval Logics . . . 313--331
Jan Magott Performance Evaluation of Systems
Defined in Specification Language
Estelle . . . . . . . . . . . . . . . . 333--357
Anthony Karel Seda Topology and the Semantics of Logic
Programs . . . . . . . . . . . . . . . . 359--386
Y. S. Ramakrishna On the Satisfiability Problem for
Lamport's Propositional Temporal Logic
of Actions and Some of Its Extensions 387--405
Olivier Gasquet A New Incompleteness Result in Kripke
Semantics . . . . . . . . . . . . . . . 407--415
Inge Bethke and
Piet Rodenburg Equational Constructor Induction . . . . 1--15
Henning Fernau On Grammar and Language Families . . . . 17--34
V. A. Bondarenko and
S. V. Yurov About a Polyhedron of Cubic Graphs . . . 35--38
Andrés Bujosa and
Regino Criado Syntactic Elements of Declarative
Programming: Symbolic Linear Equations 39--48
Paliath Narendran Unification Modulo ACI + 1 + 0 . . . . . 49--57
Susanne Kaufmann and
Martin Kummer On a Quantitative Notion of Uniformity 59--78
Waldemar Korczy\'nsky On a Notion of Concurrence . . . . . . . 79--98
Colin De La Higuera and
Marie-Catherine Daniel-Vatonne On Sets of Terms: a Study of a
Generalisation Relation and of Its
Algorithmic Properties . . . . . . . . . 99--121
R. Stephens and
B. C. Thompson Cartesian Stream Transformer Composition 123--174
Erkki Mäkinen A Note on the Grammatical Inference
Problem for Even Linear Languages . . . 175--181
Wojciech Penczek Axiomatizations of Temporal Logics on
Trace Systems . . . . . . . . . . . . . 183--200
Mikhail Moshkov Comparitive Analysis of Deterministic
and Nondeterministic Decision Tree
Complexity. Global Approach . . . . . . 201--214
Grzegorz Rozenberg and
Arto Salomaa Preface . . . . . . . . . . . . . . . . 215--215
J. Berstel and
L. Boasson Towards an Algebraic Theory of
Context-Free Languages . . . . . . . . . 217--239
Volkert Diekert and
Anca Muscholl A Note on Métivier's Construction of
Asynchronous Automata for Triangulated
Graphs . . . . . . . . . . . . . . . . . 241--246
F. Gécseg and
H. Jürgensen Dependence in Algebras . . . . . . . . . 247--256
Juha Honkala and
Werner Kuich On a Power Series Generalization of ETOL
Languages . . . . . . . . . . . . . . . 257--270
Juraj Hromkovi\vc and
Jarkko Kari and
Lila Kari and
Dana Pardubská Two Lower Bounds on Distributive
Generation of Languages . . . . . . . . 271--284
D. Derencourt and
J. Karhumäki and
M. Latteux and
A. Terlutte On Computational Power of Weighted
Finite Automata . . . . . . . . . . . . 285--293
F. Drewes and
H.-J. Kreowski (Un-)Decidability of Geometric
Properties of Pictures Generated by
Collage Grammars . . . . . . . . . . . . 295--325
Klaus-Jörn Lange Complexity and Structure in Formal
Language Theory . . . . . . . . . . . . 327--352
Hendrik Jan Hoogeboom and
Paulienten Pas Text Languages in an Algebraic Framework 353--380
Gheorghe P\uaun and
Grzegorz Rozenberg and
Arto Salomaa Contextual Grammars: Parallelism and
Blocking of Derivation . . . . . . . . . 381--397
Dora Giammarresi and
Antonio Restivo Two-Dimensional Finite State
Recognizability . . . . . . . . . . . . 399--422
L. Guo and
K. Salomaa and
S. Yu On Synchronization Languages . . . . . . 423--436
Ranjit Biswas On I--V Fuzzy Subgroups . . . . . . . . 1--9
P. Blauth Menezes and
J. Félix Costa Synchronization in Petri Nets . . . . . 11--22
Heike Spilker and
Dietmar Wätjen Some Undecidability Results Concerning
$k$-Limited $ 0 L$ systems . . . . . . . 23--30
Naphtali Rishe A Universal Model for Non-Procedural
Database Languages . . . . . . . . . . . 31--57
Paolo Boldi Maximal Chains and Antichains in
Strongly Noetherian Semiorders . . . . . 59--80
Andrzej Szalas On Natural Deduction in First-Order
Fixpoint Logics . . . . . . . . . . . . 81--94
Yoram Hirshfeld Undecidability of Language Equivalence
for Generalized Regular Expressions . . 95--102
Wan Fokkink A Complete Axiomatization for Prefix
Iteration in Branching Bisimulation . . 103--113
Yuxi Fu Recursive Models of General Inductive
Types . . . . . . . . . . . . . . . . . 115--131
Peter M. W. Knijnenburg A Note on the Smyth Powerdomain
Construction . . . . . . . . . . . . . . 133--139
Steffen van Bakel Rank 2 Intersection Type Assignment in
Term Rewriting Systems . . . . . . . . . 141--166
Beata Konikowska McCarthy Algebras: a Model of McCarthy's
Logical Calculus . . . . . . . . . . . . 167--203
G. Engels and
H. Ehrig and
G. Rozenberg Preface . . . . . . . . . . . . . . . . 205--205
Zena M. Ariola and
Jan Willem Klop Equational Term Graph Rewriting . . . . 207--240
A. Corradini and
U. Montanari and
F. Rossi Graph Processes . . . . . . . . . . . . 241--265
Frank Drewes A Lower Bound on the Growth of Functions
Computed by Tree Transducers . . . . . . 267--285
Annegret Habel and
Reiko Heckel and
Gabriele Taentzer Graph Grammars with Negative Application
Conditions . . . . . . . . . . . . . . . 287--313
D. Janssens and
T. Mens Abstract Semantics for ESM Systems . . . 315--339
Mohamed Mosbah Probabilistic Graph Grammars . . . . . . 341--362
Andy Schürr Logic Based Programmed Structure
Rewriting Systems . . . . . . . . . . . 363--385
Gabriele Taentzer Towards Synchronous and Asynchronous
Graph Transformations . . . . . . . . . 387--406
Annika Wagner and
Martin Gogolla Defining Operational Behavior of Object
Specifications by Attributed Graph
Transformations . . . . . . . . . . . . 407--431
Eric Sopena Expanding Graph Relabeling Systems Have
the Power of Recursive Enumerability . . 1--25
Salvatore La Torre and
Margherita Napoli and
Domenico Parente Parallel Word Substitution . . . . . . . 27--36
J. A. Bergstra and
Gh. \cStef\uanescu Processes with Multiple Entries and
Exits Modulo Isomorphism and Modulo
Bisimulation . . . . . . . . . . . . . . 37--56
Churn-Jung Liau An Algebraic Formalization of the
Relationship Between Evidential
Structures and Data Tables . . . . . . . 57--76
Leo Marcus Syntactic and Semantic Dependence of
Array-Arithmetic Sentences, with an
Application to Program Verification . . 77--100
Andrzej Skowron and
Wojciech Ziarko Preface . . . . . . . . . . . . . . . . 101--102
Zdzislaw Pawlak Rough Sets, Rough Relations and Rough
Functions . . . . . . . . . . . . . . . 103--108
Edward Bryniarski Formal Conception of Rough Sets . . . . 109--136
T. Y. Lin and
Qing Liu First-Order Rough Logic I: Approximate
Reasoning Via Rough Sets . . . . . . . . 137--153
Jack David Katzberg and
Wojciech Ziarko Variable Precision Extension of Rough
Sets . . . . . . . . . . . . . . . . . . 155--168
Robert E. Kent Rough Concept Analysis: a Synthesis of
Rough Sets and Formal Concept Analysis 169--181
Marzena Kryszkiewicz and
Henryk Rybinski Computation of Reducts of Composed
Information Systems . . . . . . . . . . 183--195
Mikhail Moshkov Some Bounds on Minimal Decision Tree
Depth . . . . . . . . . . . . . . . . . 197--203
Piero Pagliani Rough Sets and Nelson Algebras . . . . . 205--219
Janusz Pomykala and
Erik De Haas A Note on Categories of Information
Systems . . . . . . . . . . . . . . . . 221--227
Roman Slowi\'nski and
Jerzy Stefanowski Rough-Set Reasoning About Uncertain Data 229--243
Andrzej Skowron and
Jaroslaw Stepaniuk Tolerance Approximation Spaces . . . . . 245--253
Andrzej Skowron and
Lech Polkowski Analytical Morphology: Mathematical
Morphology of Decision Tables . . . . . 255--271
Shusaku Tsumoto and
Hiroshi Tanaka A Common Algebraic Framework of
Empirical Learning Methods Based on
Rough Sets and Matroid Theory . . . . . 273--288
Y. Y. Yao and
Xining Li Comparison of Rough-Set and Interval-Set
Models for Uncertain Reasoning . . . . . 289--298
Jan M. Zytkow Automated Discovery of Empirical Laws 299--318
Mark Levene and
George Loizou Categorisation of Computable Database
Queries . . . . . . . . . . . . . . . . 319--348
Flavio Corradini and
Rocco De Nicola On Four Partial Ordering Semantics for a
Process Calculus . . . . . . . . . . . . 349--383
Jorge Lobo and
Carlos Uzcátegui Abductive Change Operators . . . . . . . 385--411
Erkki Mäkinen $ (0, 1)$-Totality Is Undecidable for
Arbitrary Context-Free Grammars . . . . 413--415
Wiktor Marek and
Lech Polkowski and
Andrzej Skowron Preface . . . . . . . . . . . . . . . . ??
José Júlio Alferes and
Luís Moniz Pereira and
Teodor C. Przymusinski Belief Revision in Non-Monotonic
Reasoning and Logic Programming . . . . 1--22
Krzysztof R. Apt and
Rachel Ben-Eliyahu Meta-variables in Logic Programming, or
in Praise of Ambivalent Syntax . . . . . 23--36
Howard A. Blair Designing Dependencies . . . . . . . . . 37--54
Andrzej Blikle Why Denotational? . . . . . . . . . . . 55--85
Jürgen Dix and
Georg Gottlob and
Wiktor Marek Reducing Disjunctive to Non-Disjunctive
Semantics by Shift-Operations . . . . . 87--100
Melvin Fitting A Modal Herbrand Theorem . . . . . . . . 101--122
Georg Gottlob and
Miros\law Truszczy\'nski Approximating the Stable Model Semantics
is Hard . . . . . . . . . . . . . . . . 123--128
Jieh Hsiang and
Anita Wasilewska Automating Algebraic Proofs in Algebraic
Logic . . . . . . . . . . . . . . . . . 129--140
Grazyna Mirkowska and
Andrzej Salwicki The Algebraic Specifications do not have
the Tennenbaum Property . . . . . . . . 141--152
Jan A. Plaza Logic Programming from the Perspective
of Algebraic Semantics . . . . . . . . . 153--164
Vaughan Pratt and
Jerzy Tiuryn Satisfiability of Inequalities in a
Poset . . . . . . . . . . . . . . . . . 165--182
B. A. Trakhtenbrot On the Power of Compositional Proofs for
Nets: Relationships Between Completeness
and Modularity . . . . . . . . . . . . . 183--195
Pawe\l Urzyczyn Positive Recursive Type Assignment . . . 197--209
Wiktor Marek and
Lech Polkowski and
Andrzej Skowron Preface . . . . . . . . . . . . . . . . ??
Mohua Banerjee and
Mihir K. Chakraborty Rough Sets Through Algebraic Logic . . . 211--221
Alexander Bochman On a Logical Basis of Normal Logic
Programs . . . . . . . . . . . . . . . . 223--245
Nguyen Cat Ho A Method in Linguistic Reasoning on a
Knowledge Base Representing by Sentences
with Linguistic Belief Degree . . . . . 247--259
Patrick Doherty and
Witold \Lukaszewicz and
Andrzej Sza\las A Reduction Result for Circumscribed
Semi-Horn Formulas . . . . . . . . . . . 261--271
John Green and
Neil Horne and
Ewa Or\lowska and
Paul Siemens A Rough Set Model of Information
Retrieval . . . . . . . . . . . . . . . 273--296
Dima Grigoriev and
Marek Karpinski and
Andrew M. Odlyzko Short Proofs for Nondivisibility of
Sparse Polynomials under the Extended
Riemann Hypothesis . . . . . . . . . . . 297--301
Anna Gomoli\'nska On Semantics for the Nonmonotonic Modal
Formalization of the Logic of Acceptance
and Rejection . . . . . . . . . . . . . 303--313
Gheorghe P\uaun and
Lech Polkowski and
Andrzej Skowron Parallel communicating grammar systems
with negotiation . . . . . . . . . . . . 315--330
Slavian Radev Argumentation Systems . . . . . . . . . 331--346
W\ladys\law Skarbek Dynamic Behaviour of Spatial Signal
OR-Graphs . . . . . . . . . . . . . . . 347--352
Zbigniew Suraj Discovery of Concurrent Data Models from
Experimental Tables: A Rough Set
Approach . . . . . . . . . . . . . . . . 353--376
Karl Schlechta A Two-Stage Approach to First Order
Default Reasoning . . . . . . . . . . . 377--402
Józef Winkowski Concatenable Weighted Pomsets and Their
Applications to Modelling Processes of
Petri Nets . . . . . . . . . . . . . . . 403--421
Jakub Wróblewski Theoretical Foundations of Order-Based
Genetic Algorithms . . . . . . . . . . . 423--430
Günter Hotz and
Gisela Pitsch On Using Semi-Dyck Sets to Analyse
Coupled-Context-Free Languages . . . . . 1--26
Piotr Dembi\'nski Semantics of Timed Concurrent Systems 27--50
J. C. M. Baeten and
J. A. Bergstra Discrete Time Process Algebra: Absolute
Time, Relative Time and Parametric Time 51--76
Zbigniew Huzar and
Jan Magott Syntax and Semantics of Real-Time and
Performance Evaluation Extensions of
Specification Language Lotos . . . . . . 77--96
Anthony Karel Seda Quasi-Metrics and the Semantics of Logic
Programs . . . . . . . . . . . . . . . . 97--117
Ivo Düntsch and
Günther Gediga Algebraic Aspects of Attribute
Dependencies in Information Systems . . 119--133
James F. Peters Mechanization of Real-Time Linear CSP
with Higher Order Logic . . . . . . . . 135--163
Uwe Egly On Definitional Transformations to
Normal Form for Intuitionistic Logic . . 165--201
Francis Alexandre and
Khaled Bsa\"\ies A Methodology for Constructing Logic
Programs . . . . . . . . . . . . . . . . 203--223
Christel Baier and
Mila Majster-Cederbaum How to Interpret and Establish
Consistency Results for Semantics of
Concurrent Programming Languages . . . . 225--256
Markus Mohnen A Compiler Correctness Proof for the
Static Link Technique by Means of
Evolving Algebras . . . . . . . . . . . 257--303
A. Ehrenfeucht and
G. Rozenberg and
K. Salomaa Semantics of Nonsequential Tree-Based
Computation Schemes . . . . . . . . . . 305--324
Emanuela Fachini and
Angelo Monti Chomsky Hierarchy and Systolic $Y$-Tree
Automata . . . . . . . . . . . . . . . . 325--339
Gian-Luigi Ferrari Atomicity and Concurrency Control in
Process Calculi . . . . . . . . . . . . 341--368
Jouni Järvinen A Representation of Dependence Spaces
and Some Basic Algorithms . . . . . . . 369--382
Sukhamay Kundu and
Jianhua Chen A New Method of Circumscribing Beliefs
the Propositional Case . . . . . . . . . 383--390
William Gasarch and
Mahendran Velauthapillai Asking Questions versus Verifiability 1--9
Astrid Kiehn and
Matthew Hennessy On the Decidability of Non-Interleaving
Process Equivalences . . . . . . . . . . 11--30
Klaus Madlener and
Friedrich Otto Some Undecidability Results For Finitely
Generated Thue Congruences On A
Two-Letter Alphabet . . . . . . . . . . 31--44
Gheorghe P\uaun Controlled $H$ Systems and Chomsky
Hierarchy . . . . . . . . . . . . . . . 45--57
Nicolas Peltier Tree Automata and Automated Model
Building . . . . . . . . . . . . . . . . 59--81
B. A. Trakhtenbrot On the Power of Compositional Proofs for
Nets: Relationships Between
Completenesess and Modularity . . . . . 83--95
Józef Winkowski A Representation of Processes of Petri
Nets by Matrices . . . . . . . . . . . . 97--107
Yan Zhang and
Norman Y. Foo Deriving Invariants and Constraints from
Action Theories . . . . . . . . . . . . 109--123
\cSerban A. Basarab Directions and foldings on generalized
trees . . . . . . . . . . . . . . . . . 125--149
Nicholas V. Findler Some Techniques of Reducing the Dangers
of Combinatorial Explosion in Automatic
Knowledge Acquisition . . . . . . . . . 151--160
Lucian Ilie On The Computational Complexity of
Marcus Contextual Languages . . . . . . 161--167
Maciej Kandulski On Generalized Ajdukiewicz and Lambek
Calculi and Grammars . . . . . . . . . . 169--181
Erkki Mäkinen and
Ferucio Lauren\ctiu \cTiplea Pattern Ambiguities for Pure Context ---
Free Grammars . . . . . . . . . . . . . 183--191
Merc\`e Llabrés and
Francesc Rosselló Double-pushout hypergraph rewriting
using total conformisms . . . . . . . . 193--226
Maciej Michalewicz and
Zbigniew W. Ras Guest Editors' Note . . . . . . . . . . ??
Peter Clark and
Cao Feng and
Stan Matwin and
Ko Fung Improving Image Classification by
Combining Statistical, Case-Based and
Model-Based Prediction Methods . . . . . 227--240
Marek J. Druzdzel Five Useful Properties of Probabilistic
Knowledge Representations From the Point
of View of Intelligent Systems . . . . . 241--254
Jerzy W. Grzymala-Busse Classification of Unseen Examples under
Uncertainty . . . . . . . . . . . . . . 255--267
Gregory E. Kersten and
Stan Szpakowicz Formal Account of Sequential
Decision-Making in a Co-Operative
Setting . . . . . . . . . . . . . . . . 269--281
Ryszard S. Michalski Seeking Knowledge in the Deluge of Facts 283--297
Adam Mrózek and
Leszek P\lonka Knowledge Representation in Fuzzy and
Rough Controllers . . . . . . . . . . . 299--311
Zbigniew W. Ras and
Sucheta Joshi Query Approximate Answering System for
an Incomplete DKBS . . . . . . . . . . . 313--324
Marek Rusinkiewicz and
Mauro Bregolin Transactional Workflows in Distributed
Systems . . . . . . . . . . . . . . . . 325--344
Andrzej Skowron and
Lech Polkowski Decision Algorithms: a Survey of Rough
Set --- Theoretic Methods . . . . . . . 345--358
S. T. Wierzcho\'n and
M. A. K\lopotek and
M. Michalewicz Reasoning and Facts Explanation in
Valuation Based Systems . . . . . . . . 359--371
Wojciech Ziarko and
Ning Shan Machine Learning Through Data
Classification and Reduction . . . . . . 373--382
Jan M. \.Zytkow and
Robert Zembowicz Contingency Tables as the Foundation for
Concepts, Concept Hierarchies, and
Rules: The 49er System Approach . . . . 383--399
Wojciech Buszkowski and
Miros\lawa Ko\lowska-Gawiejnowicz Representation of Residuated Semigroups
in Some Algebras of Relations (The
Method of Canonical Models) . . . . . . 1--12
Javier Esparza Petri Nets, Commutative Context-Free
Grammars, and Basic Parallel Processes 13--25
Jerzy W. Grzymala-Busse A New Version of the Rule Induction
System LERS . . . . . . . . . . . . . . 27--39
Takeshi Koshiba On a Hierarchy of Slender Languages
Based on Control Sets . . . . . . . . . 41--47
Ryszard S. Michalski and
Ibrahim F. Imam On Learning Decision Structures . . . . 49--64
Anna Romanowska From Dissemilattices to Snack Algebras 65--77
Shie-Jue Lee and
Wei-Jer Lin Formal Verification and Diagnosis of
Combinational Circuit Designs with
Propositional Logic . . . . . . . . . . 79--105
Kazimir Majorinc Extension Rule for Non-Clausal
Propositional Calculus . . . . . . . . . 107--116
Carlos Martín-Vide Natural Computation for Natural Language 117--124
Mihhail Matskin and
Jan Komorowski Partial Structural Synthesis of Programs 125--144
Mikhail Moshkov and
Igor Chikalov Bounds on Average Weighted Depth of
Decision Trees . . . . . . . . . . . . . 145--156
Mikhail Moshkov Unimprovable Upper Bounds on Time
Complexity of Decision Trees . . . . . . 157--184
Andrei P\uaun Controlled $H$ Systems of Small Radius 185--193
Dimiter Skordev An Abstract Approach to Some Loop
Detection Problems . . . . . . . . . . . 195--212
Mohua Banerjee Rough Sets and $3$-valued \Lukasiewicz
Logic . . . . . . . . . . . . . . . . . 213--220
Gerhard Brewka and
Georg Gottlob Well-Founded Semantics for Default Logic 221--236
Hans-Dieter Burkhard Defining BDI with Abstract Languages . . 237--252
Olaf Chitil The $ \zeta $-Semantics: A Comprehensive
Semantics for Functional Programs . . . 253--294
Ana Deneva and
Dimiter Vakarelov Modal Logics for Local and Global
Similarity Relations . . . . . . . . . . 295--304
Andrea Maggiolo-Schettini and
Gionata Matteucci Processes in Cause-Effect Systems . . . 305--335
Andrea Maggiolo-Schettini and
Józef Winkowski A Partial Order Representation of
Processes of Transforming Graphs . . . . 337--355
Ugo Montanari and
Gioia Ristori A Concurrent Functional Semantics for a
Process Algebra Based on Action Systems 357--377
Jean-François Rey The Block Product of Categories and
Tilson's Division . . . . . . . . . . . 379--400
Jean-François Rey The Kernel of a Relational Morphism of
Categories . . . . . . . . . . . . . . . 401--421
Marcelo F. Frias and
Gabriel A. Baum and
Armando M. Haeberer Fork Algebras in Algebra, Logic and
Computer Science . . . . . . . . . . . . 1--25
Stefano Kasangian and
Sebastiano Vigna The Topos of Labelled Trees: A
Categorical Semantics for SCCS . . . . . 27--45
Don Pigozzi and
Antonino Salibra Lambda Abstraction Algebras:
Coordinatizing Models of Lambda Calculus 47--90
Jerzy Tyszkiewicz Queries and Algorithms Computable by
Polynomial Time Existential Reflective
Machines . . . . . . . . . . . . . . . . 91--105
J. Komorowski and
Z. W. Ra\'s Guest Editors' Preface --- In Memory of
Cecylia Rauszer . . . . . . . . . . . . ??
Mihir K. Chakraborty and
Ewa Orlowska Substitutivity Principles in Some
Theories of Uncertainty . . . . . . . . 107--120
Terry Gaasterland and
Jorge Lobo Qualifying Answers According to User
Needs and Preferences . . . . . . . . . 121--137
V. Wiktor Marek and
Anil Nerode and
Jeffrey B. Remmel Complexity of Recursive Normal Default
Logic . . . . . . . . . . . . . . . . . 139--147
Gheorghe P\uaun and
Lech Polkowski and
Andrzej Skowron Rough Set Approximations of Languages 149--162
Carolina Ruiz and
Jack Minker Combining Closed World Assumptions with
Stable Negation . . . . . . . . . . . . 163--181
Krister Segerberg Proposal for a Theory of Belief Revision
Along the Lines of Lindström and
Rabinowicz . . . . . . . . . . . . . . . 183--191
Fabio Alessi and
Mariangiola Dezani-Ciancaglini and
Ugo de' Liguoro A Convex Powerdomain over Lattices: its
Logic and $ \lambda $-Calculus . . . . . 193--250
Antonio Bucciarelli Bi-models: Relational Versus
Domain-theoretic Approaches . . . . . . 251--266
Andrés Bujosa and
Regino Criado and
Miguel A. Hernandez-Medina Unification: Nothing but the Solution of
a System of Linear Equations . . . . . . 267--280
Marcos A. Castilho and
Luis Fariñas del Cerro and
Olivier Gasquet and
Andreas Herzig Modal Tableaux with Propagation Rules
and Structural Rules . . . . . . . . . . 281--297
Mihir K. Chakraborty and
Sanjukta Basu Graded Consequence and Some Metalogical
Notions Generalized . . . . . . . . . . 299--311
Bogdan S. Chlebus and
Krzysztof Diks and
Andrzej Pelc Transition-optimal Token Distribution 313--328
Wan Fokkink An Axiomatization for Regular Processes
in Timed Branching Bisimulation . . . . 329--340
Juha Honkala Decision Problems Concerning a Power
Series Generalization of DTOL Systems 341--348
Mohamed A. Khamsi and
Driss Misane Disjunctive Signed Logic Programs . . . 349--357
W\ladys\law Skarbek On Relation of Image Compression and
Image Association . . . . . . . . . . . 359--371
Ferucio Lauren\ctiu \cTiplea and
Erkki Mäkinen Jumping Petri Nets. Specific Properties 373--392
Ludwik Czaja Minimal-Maximal Time Cause-Effect
Structures . . . . . . . . . . . . . . . 1--16
Ludwik Czaja Cause-Effect Structures --- Structural
and Semantic Properties Revisited . . . 17--42
Georgi Dimov and
Dimiter Vakarelov On Scott Consequence Systems . . . . . . 43--70
Vincent Schmitt CR-Structures . . . . . . . . . . . . . 71--83
Laurent Vigneron Automated Deduction Techniques for
Studying Rough Algebras . . . . . . . . 85--103
Cristian S. Calude and
Peter H. Hertling Computable Approximations of Reals: An
Information-Theoretic Analysis . . . . . 105--120
Tadeusz Pankowski Powerdomain of Paths for Representing
Object Structures . . . . . . . . . . . 121--148
Don Pigozzi and
Antonino Salibra Lambda Abstraction Algebras:
Coordinatizing Models of Lambda Calculus 149--200
Detlef Plump Termination of Graph Rewriting is
Undecidable . . . . . . . . . . . . . . 201--209
Solomon Marcus Preface . . . . . . . . . . . . . . . . ??
Radu Gramatovici An Efficient Parser for a Class of
Contextual Languages . . . . . . . . . . 211--238
Lucian Ilie Generalized Factors of Words . . . . . . 239--247
Manfred Kudlek and
Alexandru Mateescu Algebraic, Linear and Rational Languages
Defined by Mix Operation . . . . . . . . 249--264
Pavel Martinek Limits of Pure Grammars with Monotone
Productions . . . . . . . . . . . . . . 265--280
Victor Mitrana Parallelism in Contextual Grammars . . . 281--294
Miroslav Novotný Reduction of Pregrammars . . . . . . . . 295--307
Roger Hindley Preface . . . . . . . . . . . . . . . . ??
Michael Brandt and
Fritz Henglein Coinductive Axiomatization of Recursive
Type Equality and Subtyping . . . . . . 309--338
Torben Braüner A Simple Adequate Categorical Model for
PCF, II . . . . . . . . . . . . . . . . 339--368
Ian Stark Names, Equations, Relations: Practical
Ways to Reason about New . . . . . . . . 369--396
Izumi Takeuti An Axiomatic System of Parametricity . . 397--432
Gian Luigi Ferrari and
Ugo Montanari Parameterized Structured Operational
Semantics . . . . . . . . . . . . . . . 1--31
Anna Gomoli\'nska Credibility of Information for Modelling
Belief State and Its Change . . . . . . 33--51
B. van Linder and
W. van der Hoek and
J.-J. Ch. Meyer Formalising Abilities and Opportunities
of Agents . . . . . . . . . . . . . . . 53--101
Salvatore La Torre and
Margherita Napoli and
Domenico Parente Synchronization of a Line of Identical
Processors at a Given Time . . . . . . . 103--128
Sinh Hoa Nguyen and
Hung Son Nguyen Pattern Extraction from Data . . . . . . 129--144
Nguyen Hung Son From Optimal Hyperplanes to Optimal
Decision Trees . . . . . . . . . . . . . 145--174
Sandor Vágvölgyi The Ground Tree Transducer Game . . . . 175--201
Krzysztof R. Apt and
Claude Kirchner Guest Editors' Preface --- Foundations
of constraint programming . . . . . . . ??
Robert A. Kowalski and
Francesca Toni and
Gerhard Wetzel Executing Suspended Logic Programs . . . 203--224
Claude Kirchner and
Christophe Ringeissen Rule-Based Constraint Programming . . . 225--262
Carlos Castro Building Constraint Satisfaction Problem
Solvers Using Rewrite Rules and
Strategies . . . . . . . . . . . . . . . 263--293
Krzysztof R. Apt A Proof Theoretic View of Constraint
Programming . . . . . . . . . . . . . . 295--321
Jean-Hugues Réty Distributed Concurrent Constraint
Programming . . . . . . . . . . . . . . 323--346
W\ladys\law Skarbek Preface: Special Issue on Image
Compression . . . . . . . . . . . . . . ??
Leszek Cieplinski A Review of Image and Video Coding
Standards . . . . . . . . . . . . . . . 347--367
Artur Przelaskowski Detail Preserving Wavelet-based
Compression with Adaptive Context-based
Quantisation . . . . . . . . . . . . . . 369--388
Leszek Cieplinski Entropy-Constrained Multiresolution
Vector Quantisation for Image Coding . . 389--396
Remigiusz J. Rak Vector Quantisation . . . . . . . . . . 397--412
Suman K. Mitra and
C. A. Murthy and
Malay K. Kundu A Study on Partitioned Iterative
Function Systems for Image Compression 413--428
W\ladys\law Skarbek Analysis of Fractal Operator Convergence
by Graph Methods . . . . . . . . . . . . 429--440
Rados\law Sikora and
W\ladys\law Skarbek Stability Analysis of Oja--RLS Learning
Rule . . . . . . . . . . . . . . . . . . 441--453
Waldemar Rakowski and
Zbigniew Bartosiewicz Daubechies Filters in Wavelet Image
Compression . . . . . . . . . . . . . . 455--467
Piotr Wojdy\l\lo Wavelets and Mallat's Multiresolution
Analysis . . . . . . . . . . . . . . . . 469--474
A. E. Eiben and
Zbigniew Michalewicz Preface . . . . . . . . . . . . . . . . ??
David B. Fogel Unearthing a Fossil from the History of
Evolutionary Computation . . . . . . . . 1--16
Susana C. Esquivel and
Héctor Ariel Leiva and
Raúl H. Gallardt Selection Mechanisms in Evolutionary
Algorithms . . . . . . . . . . . . . . . 17--33
A. E. Eiben and
C. A. Schippers On Evolutionary Exploration and
Exploitation . . . . . . . . . . . . . . 35--50
Thomas Bäck An Overview of Parameter Control Methods
by Self-Adaptation in Evolutionary
Algorithms . . . . . . . . . . . . . . . 51--66
Günter Rudolph Finite Markov Chain Results in
Evolutionary Computation: A Tour
d'Horizon . . . . . . . . . . . . . . . 67--89
C. A. Murthy and
Dinabandhu Bhandari and
Sankar K. Pal $ \epsilon $-Optimal Stopping Time for
Genetic Algorithms . . . . . . . . . . . 91--111
Moutaz Khouja and
Zbigniew Michalewicz and
Poorani Vijayaragavan Evolutionary Algorithm for Economic lot
and Delivery Scheduling Problem . . . . 113--123
Mich\`ele Sebag and
Marc Schoenauer and
Mathieu Peyral Revisiting the Memory of Evolution . . . 125--162
A. Giordana and
G. Lo Bello Learning Classification Programs: The
Genetic Algorithm Approach . . . . . . . 163--177
Peter J. Angeline A Historical Perspective on the
Evolution of Executable Structures . . . 179--195
Mariusz Boryczka Some Aspects of Ant Systems for the TSP 197--209
Franciszek Seredy\'nski New Trends in Parallel and Distributed
Evolutionary Computing . . . . . . . . . 211--230
Russell Deaton and
Max Garzon and
John Rose and
D. R. Franceschetti and
S. E. Stevens DNA Computing: A Review . . . . . . . . 231--245
Kenneth De Jong Evolutionary Computation: Where we are
and where we're headed . . . . . . . . . 247--259
Girish Bhat and
Doron Peled Adding Partial Orders to Linear Temporal
Logic . . . . . . . . . . . . . . . . . 1--21
Patrick Doherty and
Witold \Lukaszewicz and
Andrzej Sza\las General Domain Circumscription and its
Effective Reductions . . . . . . . . . . 23--55
George Rahonis and
Kai Salomaa On the Size of Stack and Synchronization
Alphabets of Tree Automata . . . . . . . 57--69
Józef Winkowski Processes of Contextual Nets and their
Characteristics . . . . . . . . . . . . 71--101
Mohamed Amin Remarks on the Relationship Between
Cooperating Distributed Grammar Systems
and Lindenmayer Systems . . . . . . . . 103--107
Anastasia Analyti and
Nicolas Spyratos and
Panos Constantopoulos On the Semantics of a Semantic Network 109--144
Béatrice Bérard and
Antoine Petit and
Volker Diekert and
Paul Gastin Characterization of the Expressive Power
of Silent Transitions in Timed Automata 145--182
Jürgen Dassow and
Gheorghe P\uaun Remarks on Operations Suggested by
Mutations in Genomes . . . . . . . . . . 183--200
Agostino Dovier and
Alberto Policriti and
Gianfranco Rossi A Uniform Axiomatic View of Lists,
Multisets, and Sets, and the Relevant
Unification Algorithms . . . . . . . . . 201--234
Kees A. Middelburg Truth of Duration Calculus Formulae in
Timed Frames . . . . . . . . . . . . . . 235--263
Jaroslaw Stepaniuk Optimizations of Rough Set Model . . . . 265--283
Larissa Zhiltsova On Entropy and Optimal Coding Cost for
Stochastic Language . . . . . . . . . . 285--305
Dmitri Burago and
Michel de Rougemont On the Average-Case Complexity of the
Graph Reliability Problem on Gaussian
Distributions . . . . . . . . . . . . . 307--315
Zbigniew J. Czech and
Wojciech Mikanik Randomized PRAM Simulation . . . . . . . 317--336
Jan Ostravský Pregrammars Versus Submonoids . . . . . 337--343
W\ladys\law Skarbek and
Adam Pietrowcew and
Rados\law Sikora The Modified Oja-RLS Algorithm,
Stochastic Convergence Analysis and
Application for Image Compression . . . 345--365
Sándor Vágvölgyi Simple and Minimal Ground Term Equation
Systems . . . . . . . . . . . . . . . . 367--413
Sankar K. Pal Preface: Special Issue on Soft Computing ??
Didier Dubois and
Daniel Le Berre and
Henri Prade and
Régis Sabbadin Using Possibilistic Logic for Modeling
Qualitative Decision: ATMS-based
Algorithms . . . . . . . . . . . . . . . 1--30
Sitabhra Sinha Chaotic Dynamics in Iterated Map Neural
Networks with Piecewise Linear
Activation Function . . . . . . . . . . 31--50
Naoyuki Kubota and
Toshio Fukuda Ecological Model of Virus-Evolutionary
Genetic Algorithm . . . . . . . . . . . 51--70
Hideo Tanaka and
Haekwan Lee Interval Regression Analysis with
Polynomials and Its Similarity to Rough
Sets Concept . . . . . . . . . . . . . . 71--87
Menahem Friedman and
Ma Ming and
Abraham Kandel On Fuzzy Integral Equations . . . . . . 89--99
Vito Di Ges\`u Artificial Vision and Soft Computing . . 101--119
K. K. N. Sastry and
L. Behera and
I. J. Nagrath Differential Evolution Based Fuzzy Logic
Controller for Nonlinear Process Control 121--136
Nicolaos B. Karayiannis Reformulating Learning Vector
Quantization and Radial Basis Neural
Networks . . . . . . . . . . . . . . . . 137--175
Sanghamitra Bandyopadhyay and
Sankar K. Pal Relation Between VGA-classifier and MLP:
Determination of Network Architecture 177--199
Hans-Dieter Burkhard and
Peter Starke and
Ludwik Czaja Preface . . . . . . . . . . . . . . . . ??
Thomas Baar and
Ekkart Kindler ILF and DAWN for Verifying Distributed
Algorithms --- An Idea for a Tool . . . 201--211
Ludwik Czaja Net-Definability of Process Languages 213--223
Berndt Farwer A Linear Logic View of Object Petri Nets 225--246
Keijo Heljanko Using Logic Programs with Stable Model
Semantics to Solve Deadlock and
Reachability Problems for $1$-Safe Petri
Nets . . . . . . . . . . . . . . . . . . 247--268
Tommi A. Junttila Finding Symmetries of Algebraic System
Nets . . . . . . . . . . . . . . . . . . 269--289
Ekkart Kindler and
Sibylle Peuker Integrating Distributed Algorithms into
Distributed Systems . . . . . . . . . . 291--309
Louchka Popova-Zeugmann and
Dirk Schlatter Analyzing Paths in Time Petri Nets . . . 311--327
Corrado Böhm Fixed Point Equations Inside the Algebra
of Normal Forms . . . . . . . . . . . . 329--342
Ludwik Czaja Representing Hand-Shake Channel
Communication in the Calculus of
Cause-Effect Structures . . . . . . . . 343--368
Achim Jung and
Mathias Kegelmann and
M. Andrew Moshier Multi Lingual Sequent Calculus and
Coherent Spaces . . . . . . . . . . . . 369--412
Manfred Kudlek Iteration Lemmata for Certain Classes of
Word, Trace and Graph Languages . . . . 413--422
J. Karhumäki and
A. Mateescu and
G. Rozenberg Preface . . . . . . . . . . . . . . . . ??
Amir M. Ben-Amram and
Neil D. Jones A Precise Version of a Time Hierarchy
Theorem . . . . . . . . . . . . . . . . 1--15
Martti Penttonen Relative Cost Random Access Machines . . 17--23
Sven Skyum and
Gudmund S. Frandsen and
Peter Bro Miltersen and
Peter G. Binderup The Complexity of Identifying Large
Equivalence Classes . . . . . . . . . . 25--37
Merja Wanne and
Matti Linna A General Model for Adjacency . . . . . 39--50
S. Bogdanovi\'c and
M. \'Ciri\'c and
T. Petkovi\'c and
B. Imreh and
M. Steinby Traps, Cores, Extensions and Subdirect
Decompositions of Unary Algebras . . . . 51--60
Mogens Nielsen and
Thomas Hune Bisimulation and Open Maps for Timed
Transition Systems . . . . . . . . . . . 61--77
Eija Jurvanen and
Marjo Lipponen Distinguishability, Simulation and
Universality of Moore Tree Automata . . 79--91
Jarkko Kari On the Circuit Depth of Structurally
Reversible Cellular Automata . . . . . . 93--107
Lucian Ilie Subwords and Power-Free Words are not
Expressible by Word Equations . . . . . 109--118
Juhani Karhumäki and
Sabrina Mantaci Defect Theorems for Trees . . . . . . . 119--133
Keijo Ruohonen Solving Equivalence of Recurrent
Sequences in Groups by Polynomial
Manipulation . . . . . . . . . . . . . . 135--148
Cunsheng Ding and
Kwok Yan Lam and
Chaoping Xing Construction and Enumeration of All
Binary Duadic Codes of Length $ p^m $ 149--161
Jukka A. Koskinen Non-Injectivity and Knapsacks . . . . . 163--180
Valtteri Niemi and
Ari Renvall Solitaire Zero-knowledge . . . . . . . . 181--188
Vesa Halava and
Tero Harju Undecidability in Integer Weighted
Finite Automata . . . . . . . . . . . . 189--200
Juha Honkala The Equivalence Problem of D0L and DF0L
Power Series . . . . . . . . . . . . . . 201--208
Paavo Turakainen On the Decidability of Some Problems
Concerning Morphisms, Regular Sets, and
Post Correspondence Problem . . . . . . 209--221
Ryszard Janicki and
Maciej Koutny On Causality Semantics of Nets with
Priorities . . . . . . . . . . . . . . . 223--255
Martin Kappes Multi-Bracketed Contextual Rewriting
Grammars . . . . . . . . . . . . . . . . 257--280
Costas D. Koutras and
George Koletsos and
Stathis Zachos Many-Valued Modal Non-Monotonic
Reasoning: Sequential Stable Sets and
Logics with Linear Truth Spaces . . . . 281--324
Viviana Bono and
Michele Bugliesi and
Mariangiola Dezani-Ciancaglini and
Luigi Liquori A Subtyping for Extensible, Incomplete
Objects . . . . . . . . . . . . . . . . 325--364
Henning Bordihn and
Henning Fernau and
Markus Holzer On Accepting Pure Lindenmayer Systems 365--375
Flavio Corradini and
Domenicantonio D'Ortenzio and
Paola Inverardi On the Relationships among four Timed
Process Algebras . . . . . . . . . . . . 377--395
Gheorghe P\uaun and
Sheng Yu On Synchronization in $P$ Systems . . . 397--410
Jan A. Plaza and
John A. Campbell Preface . . . . . . . . . . . . . . . . ??
Clemens Ballarin and
Lawrence C. Paulson A Pragmatic Approach to Extending
Provers by Computer Algebra --- with
Applications to Coding Theory . . . . . 1--20
Belaid Benhamou and
Laurent Henocque A Hybrid Method for Finite Model Search
in Equational Theories . . . . . . . . . 21--38
P. G. Bertoli and
J. Calmet and
F. Giunchiglia and
K. Homann Specification and Integration of Theorem
Provers and Computer Algebra Systems . . 39--57
Uwe Egly and
Stephan Schmitt On Intuitionistic Proof Transformations,
their Complexity, and Application to
Constructive Program Synthesis . . . . . 59--83
Stéphane F\`evre and
Dongming Wang Combining Clifford Algebraic Computing
and Term-Rewriting for Geometric Theorem
Proving . . . . . . . . . . . . . . . . 85--104
Melvin Fitting On Quantified Modal Logic . . . . . . . 105--121
Dirk Fuchs On the Use of Subgoal Clauses in
Bottom-up and Top-down Calculi . . . . . 123--143
Christopher Lynch and
Christelle Scharff Basic Completion with E-cycle
Simplification . . . . . . . . . . . . . 145--165
Eric Monfroy and
Christophe Ringeissen An Open Automated Framework for
Constraint Solver Extension: the SoleX
Approach . . . . . . . . . . . . . . . . 167--187
Brigitte Pientka and
Christoph Kreitz Automating Inductive Specification
Proofs . . . . . . . . . . . . . . . . . 189--209
J. Rafael Sendra and
Franz Winkler Algorithms for Rational Real Algebraic
Curves . . . . . . . . . . . . . . . . . 211--228
Ivo Düntsch and
Hui Wang and
Stephen McCloskey Relations algebras in qualitative
spatial reasoning . . . . . . . . . . . 229--248
Sergey M. Dudakov On the Complexity of Perfect Models of
Logic Programs . . . . . . . . . . . . . 249--258
Bernhard Heinemann The Complexity of Certain Modal Formulas
on Binary Ramified Subset Trees . . . . 259--272
B. Intrigila and
P. Inverardi and
M. Venturini Zilli A Comprehensive Setting for Matching and
Unification over Iterative Terms . . . . 273--304
Teodor Knapik and
Hugues Calbrix Thue Specifications and Their Monadic
Second-order Properties . . . . . . . . 305--325
Heike Müller and
Torsten Hilbrich and
Ralf Kühnel An Assistant Agent . . . . . . . . . . . 327--336
Igor Chikalov On Average Time Complexity of Decision
Trees and Branching Programs . . . . . . 337--357
Piotr Ejdys and
Grzegorz Góra The More We Learn the Less We Know? . . 359--374
Jurriaan Hage The Membership Problem for Switching
Classes with Skew Gains . . . . . . . . 375--387
V. Wiktor Marek and
Miros\law Truszczy\'nski Contributions to the Theory of Rough
Sets . . . . . . . . . . . . . . . . . . 389--409
Prank Woltert and
Michael Zakharyaschev Modal description logics: modalizing
roles . . . . . . . . . . . . . . . . . 411--438
Andris Ambainis and
R\=usi\cn\vs Freivalds and
Carl H. Smith Inductive Inference with
Procrastination: Back to Definitions . . 1--16
Patrick Doherty and
Jaros\law Kachniarz and
Andrzej Sza\las Meta-Queries on Deductive Databases . . 17--30
C. A. Johnson Processing Deductive Databases under the
Disjunctive Stable Model Semantics . . . 31--51
Viorel Preoteasa A Relation Between Unambiguous Regular
Expressions and Abstract Data Types . . 53--77
Kaile Su and
Wei Li Computation of Extensions of Seminormal
Default Theories . . . . . . . . . . . . 79--102
Ryszard Janicki Preface . . . . . . . . . . . . . . . . ??
Maciej Koutny Peter Lauer and COSY . . . . . . . . . . 103--107
André Arnold and
Gérald Point and
Alain Griffault and
Antoine Rauzy The AltaRica Formalism for Describing
Concurrent Systems . . . . . . . . . . . 109--124
Eike Best and
Alexander Lavrov Generalised Composition Operations for
High-level Petri Nets . . . . . . . . . 125--163
Nadia Busi and
G. Michele Pinna Process Semantics for Place/Transition
Nets with Inhibitor and Read Arcs . . . 165--197
Raymond Devillers and
Joël Goossens General Response Time Computation for
the Deadline Driven Scheduling of
Periodic Tasks . . . . . . . . . . . . . 199--219
Andrea Maggiolo-Schettini and
Simone Tini Applying Techniques of Asynchronous
Concurrency to Synchronous Languages . . 221--250
Marta Pietkiewicz-Koutny The Synthesis Problem for Elementary Net
Systems with Inhibitor Arcs . . . . . . 251--283
M. W. Shields An Acceptance Vector Semantics for Path
Programs . . . . . . . . . . . . . . . . 285--316
Luis Fariñas del Cerro and
Olivier Gasquet Tableaux Based Decision Procedures for
Modal Logics of Confluence and Density 317--333
J. I. den Hartog and
E. P. de Vink and
J. W. de Bakker Full Abstractness of a Metric Semantics
for Action Refinement . . . . . . . . . 335--382
Hung Son Nguyen and
Sinh Hoa Nguyen Rough Sets and Association Rule
Generation . . . . . . . . . . . . . . . 383--405
E. T. Ordman and
E. Eberbach and
A. Anwar Generalized Mutual Exclusion with
Semaphores Only . . . . . . . . . . . . 407--422