Fundamentals of artificial intelligence research : International Workshop FAIR '91, Smolenice, Czechoslovakia, September 8-13, 1991 : proceedings
This volume contains 6 invited lectures and 13 submitted contributions to the scientific programme of the international workshop Fundamentals of Artificial Intelligence Research, FAIR '91, held at Smolenice Castle, Czechoslovakia, September 8-12, 1991, under the sponsorship of the European Coor...
Enregistré dans:
| Auteur principal: | |
|---|---|
| Autres auteurs: | |
| Format: | Livre numérique |
| Langue: | Anglais |
| Publié: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Collection: | Lecture notes in computer science. Lecture notes in artificial intelligence
535 |
| Sujets: | |
| Accès en ligne: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Note: |
Actes d'un séminaire tenu à Smolenice du 8 au 13 septembre 1991, d'après l écran-titre Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Fundamentals of artificial intelligence research, International Workshop FAIR '91, Smolenice, Czechoslovakia, September 3-13, 1991, proceedings, Ph. Jorrand, J. Kelemen, (eds.), Berlin, Springer-Verlag, 1991, 1 vol. (VIII-255 p.), Lecture notes in computer science, 3-540-54507-7 • Fundamentals of Artificial Intelligence Research, Texte imprimé, 9783662169681 |
Table des matières:
- User-oriented theorem proving with the ATINF graphic proof editor
- A modal analysis of possibility theory
- Making inconsistency respectable: A logical framework for inconsistency in reasoning, part I A position paper
- Relational proof systems for some AI logics
- Formal grammars and cognitive architectures
- Efficient simulations of nondeterministic computations and their speed-up by the ring of cooperating machines
- A semantic characterization of disjunctive relations
- Execution of defeasible temporal clauses for building preferred models
- On the phenomenon of flattening flexible prediction concept hierarchy
- Possibilistic logic as a logical framework for min-max discrete optimisation problems and prioritized constraints
- An approach to data-driven learning
- Extending abduction from propositional to first-order logic
- Building in equational theories into the connection method
- Logical fiberings and polycontextural systems
- Automated deduction with associative commutative operators
- Towards a lattice of knowledge representation systems
- Inconsistencies handling: nonmonotonic and paraconsistent reasoning
- An approach to structural synthesis of data processing programs
- Negation as failure and intuitionistic three-valued logic
- Symbolic Computation and Artificial Intelligence.