Fundamentals of Artificial Intelligence Research: International Workshop Fair '91, Smolenice, Czechoslovakia, September 8-13, 1991. Proceedings (Lecture Notes in Computer Science)

"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 Coordinating Committee for Artificial Intelligence, ECCAI. FAIR'91, the first of an intended series of international workshops, addresses issues which belong to the theoretical foundations of artificial intelligence considered as a discipline focused on concise theoretical description of some aspects of intelligence by toolsand methods adopted from mathematics, logic, and theoretical computer science. The intended goal of the FAIR workshops is to provide a forum for the exchange of ideas and results in a domain where theoretical models play an essential role. It is felt that such theoretical studies, their development and their relations to AI experiments and applications have to be promoted in the AI research community."--PUBLISHER'S WEBSITE User-oriented theorem proving with the ATINF graphic proof editor....Pages 1-10 A modal analysis of possibility theory....Pages 11-18 Making inconsistency respectable: A logical framework for inconsistency in reasoning, part I — A position paper....Pages 19-32 Relational proof systems for some AI logics....Pages 33-47 Formal grammars and cognitive architectures....Pages 48-58 Efficient simulations of nondeterministic computations and their speed-up by the ring of cooperating machines....Pages 59-70 A semantic characterization of disjunctive relations....Pages 71-83 Execution of defeasible temporal clauses for building preferred models....Pages 84-98 On the phenomenon of flattening “flexible prediction” concept hierarchy....Pages 99-111 Possibilistic logic as a logical framework for min-max discrete optimisation problems and prioritized constraints....Pages 112-126 An approach to data-driven learning....Pages 127-140 Extending abduction from propositional to first-order logic....Pages 141-155 Building in equational theories into the connection method....Pages 156-169 Logical fiberings and polycontextural systems....Pages 170-184 Automated deduction with associative commutative operators....Pages 185-199 Towards a lattice of knowledge representation systems....Pages 200-213 Inconsistencies handling: nonmonotonic and paraconsistent reasoning....Pages 214-219 An approach to structural synthesis of data processing programs....Pages 220-226 Negation as failure and intuitionistic three-valued logic....Pages 227-241 Symbolic Computation and Artificial Intelligence....Pages 243-255

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 Coordinating Committee for Artificial Intelligence, ECCAI. FAIR'91, the first of an intended series of international workshops, addresses issues which belong to the theoretical foundations of artificial intelligence considered as a discipline focused on concise theoretical description of some aspects of intelligence by toolsand methods adopted from mathematics, logic, and theoretical computer science. The intended goal of the FAIR workshops is to provide a forum for the exchange of ideas and results in a domain where theoretical models play an essential role. It is felt that such theoretical studies,
their development and their relations to AI experiments and applications have to be promoted in the AI research community.

This volume contains the invited and submitted contributions to FAIR '91, the first of an intended series of workshops on issues in the theoretical foundations of artificial intelligence. FAIR '91 was held in Czechoslovakia in September 1991. In 1965 J.A. Robinson published his seminal paper on theorem proving "A machine-oriented logic based on the resolution principle".