FAIR 1991: Smolenice, Czechoslovakia

Philippe Jorrand, Jozef Kelemen (Eds.): Fundamentals of Artificial Intelligence Research, International Workshop FAIR '91, Smolenice, Czechoslovakia, September 8-13, 1991, Proceedings. Lecture Notes in Computer Science 535 Springer 1991, ISBN 3-540-54507-7

@proceedings{DBLP:conf/fair/1991,
  editor    = {Philippe Jorrand and
               Jozef Kelemen},
  title     = {Fundamentals of Artificial Intelligence Research, International
               Workshop FAIR '91, Smolenice, Czechoslovakia, September 8-13,
               1991, Proceedings},
  booktitle = {FAIR},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {535},
  year      = {1991},
  isbn      = {3-540-54507-7},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Lectures

Ricardo Caferra, Michel Herment, Nicolas Zabel: User-oriented theorem proving with the ATINF graphic proof editor. 2-10
Luis Fariñas del Cerro, Andreas Herzig: A modal analysis of possibility theory. 11-18
Dov M. Gabbay, Anthony Hunter: Making inconsistency respectable: a logical framework for inconsistency in reasoning. 19-32
Ewa Orlowska: Relational proof systems for some AI logics. 33-47
Gheorghe Paun: Formal grammars and cognitive architectures. 48-58
Juraj Wiedermann: Efficient simulations of nondeterministic computations and their speed-up by the ring of cooperating machines. 59-70

Selected Contributions

Michael Freund: A semantic charcterization of disjunctive relations. 72-83
Anthony Hunter: Execution of defeasible temporal clauses for building preferred models. 84-98
Mieczyslaw A. Klopotek: On the phenomenon of flattening "flexible prediction" concept hierarchy. 99-111
Jérôme Lang: Possibilistic logic as a logical framework for min-max discrete optimisation problems and prioritized constraints. 112-126
Zdravko Markov: An approach to data-driven learning. 127-140
Pierre Marquis: Extending abduction from propositional to first-order logic. 141-155
Uwe Petermann: Building in equational theories into the connection method. 156-169
Jochen Pfalzgraf: Logical fiberings and polycontextural systems. 170-184
Michaël Rusinowitch, Laurent Vigneron: Automated deduction with associative commutative operators. 185-199
Andreas Strasser: Towards a lattice of knowledge representation systems. 200-213
Ján Sefránek: Inconsistencies handling: nonmonotonic and paraconsistent reasoning. 214-219
Grazina Taucaite, Justinas Laurinskas: An approach to structural synthesis of data processing programs. 220-226
Jacqueline Vauzeilles: Negation as failure and intuitionistic three-valued logic. 227-241

Appendix

Alfonso Miola: Symbolic Computation and Artificial Intelligence. 244-255