The SCEAS System
Navigation Menu

Conferences in DBLP

Fundamentals of Artificial Intelligence Research (fair)
1991 (conf/fair/1991)

  1. Ricardo Caferra, Michel Herment, Nicolas Zabel
    User-oriented theorem proving with the ATINF graphic proof editor. [Citation Graph (0, 0)][DBLP]
    FAIR, 1991, pp:2-10 [Conf]
  2. Luis Fariñas del Cerro, Andreas Herzig
    A modal analysis of possibility theory. [Citation Graph (0, 0)][DBLP]
    FAIR, 1991, pp:11-18 [Conf]
  3. Dov M. Gabbay, Anthony Hunter
    Making inconsistency respectable: a logical framework for inconsistency in reasoning. [Citation Graph (0, 0)][DBLP]
    FAIR, 1991, pp:19-32 [Conf]
  4. Ewa Orlowska
    Relational proof systems for some AI logics. [Citation Graph (0, 0)][DBLP]
    FAIR, 1991, pp:33-47 [Conf]
  5. Gheorghe Paun
    Formal grammars and cognitive architectures. [Citation Graph (0, 0)][DBLP]
    FAIR, 1991, pp:48-58 [Conf]
  6. Juraj Wiedermann
    Efficient simulations of nondeterministic computations and their speed-up by the ring of cooperating machines. [Citation Graph (0, 0)][DBLP]
    FAIR, 1991, pp:59-70 [Conf]
  7. Michael Freund
    A semantic charcterization of disjunctive relations. [Citation Graph (0, 0)][DBLP]
    FAIR, 1991, pp:72-83 [Conf]
  8. Anthony Hunter
    Execution of defeasible temporal clauses for building preferred models. [Citation Graph (0, 0)][DBLP]
    FAIR, 1991, pp:84-98 [Conf]
  9. Mieczyslaw A. Klopotek
    On the phenomenon of flattening "flexible prediction" concept hierarchy. [Citation Graph (0, 0)][DBLP]
    FAIR, 1991, pp:99-111 [Conf]
  10. Jérôme Lang
    Possibilistic logic as a logical framework for min-max discrete optimisation problems and prioritized constraints. [Citation Graph (0, 0)][DBLP]
    FAIR, 1991, pp:112-126 [Conf]
  11. Zdravko Markov
    An approach to data-driven learning. [Citation Graph (0, 0)][DBLP]
    FAIR, 1991, pp:127-140 [Conf]
  12. Pierre Marquis
    Extending abduction from propositional to first-order logic. [Citation Graph (0, 0)][DBLP]
    FAIR, 1991, pp:141-155 [Conf]
  13. Uwe Petermann
    Building in equational theories into the connection method. [Citation Graph (0, 0)][DBLP]
    FAIR, 1991, pp:156-169 [Conf]
  14. Jochen Pfalzgraf
    Logical fiberings and polycontextural systems. [Citation Graph (0, 0)][DBLP]
    FAIR, 1991, pp:170-184 [Conf]
  15. Michaël Rusinowitch, Laurent Vigneron
    Automated deduction with associative commutative operators. [Citation Graph (0, 0)][DBLP]
    FAIR, 1991, pp:185-199 [Conf]
  16. Andreas Strasser
    Towards a lattice of knowledge representation systems. [Citation Graph (0, 0)][DBLP]
    FAIR, 1991, pp:200-213 [Conf]
  17. Ján Sefránek
    Inconsistencies handling: nonmonotonic and paraconsistent reasoning. [Citation Graph (0, 0)][DBLP]
    FAIR, 1991, pp:214-219 [Conf]
  18. Grazina Taucaite, Justinas Laurinskas
    An approach to structural synthesis of data processing programs. [Citation Graph (0, 0)][DBLP]
    FAIR, 1991, pp:220-226 [Conf]
  19. Jacqueline Vauzeilles
    Negation as failure and intuitionistic three-valued logic. [Citation Graph (0, 0)][DBLP]
    FAIR, 1991, pp:227-241 [Conf]
  20. Alfonso Miola
    Symbolic Computation and Artificial Intelligence. [Citation Graph (0, 0)][DBLP]
    FAIR, 1991, pp:244-255 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002