Logics in AI. European workshop JELIA '92. Berlin, Germany, September 7--10, 1992 (Q1369228)

The articles of this volume will be reviewed individually. Indexed articles: \textit{Vakarelov, Dimiter}, A modal theory of arrows. Arrow logics. I, 1-24 [Zbl 0915.03014] \textit{MacNish, Craig}, Knowledge without modality: A simplified framework for chronological ignorance, 25-35 [Zbl 0925.68418] \textit{Pliuškevičius, Regimantas}, Design complete sequential calculus for continuous fixpoint temporal logic, 36-51 [Zbl 0915.03015] \textit{Muskens, Reinhard}, Logical omniscience and classical logic, 52-64 [Zbl 0915.03016] \textit{Kwast, Karen; van Denneheuvel, Sieger}, Weak implication: Theory and applications, 65-83 [Zbl 0925.03042] \textit{Boyer, Véronique; Quantz, J. Joachim}, Deriving inference rules for terminological logics, 84-105 [Zbl 0925.68416] \textit{Fronhöfer, Bertram}, Linear proofs and linear logics, 106-125 [Zbl 0915.03030] \textit{Weydert, Emil}, Relevance and revision about generalizing syntax-based belief revision, 126-138 [Zbl 0925.03131] \textit{Rott, Hans}, Modellings for belief change: Base contraction, multiple contraction, and epistemic entrenchment, 139-153 [Zbl 0916.03023] \textit{Froidevaux, Christine; Mengin, Jérôme}, A framework for default logics, 154-173 [Zbl 0925.68413] \textit{Hunter, Anthony}, A conceptualization of preferences in non-monotonic proof theory, 174-188 [Zbl 0925.03124] \textit{Vreeswijk, Gerard}, Reasoning with defeasible arguments: Examples and applications, 189-211 [Zbl 0925.68419] \textit{Besnard, Ph.; Grégoire, E.}, About deductive generalization, 212-231 [Zbl 0925.68414] \textit{Fernando, Tim}, Transition systems and dynamic semantics, 232-251 [Zbl 0925.03153] \textit{Bittel, Oliver}, Tableau-based theorem proving and synthesis of lambda-terms in the intuitionistic logic, 262-278 [Zbl 0925.03083] \textit{Goltz, Hans-Joachim}, A constructive type system base on data terms, 279-303 [Zbl 0925.68412] \textit{Zabel, Nicolas}, An ordered resolution and paramodulation calculus for finite many-valued logics, 304-318 [Zbl 0925.03119] \textit{Prehofer, Christian}, An efficient constraint language for polymorphic order-sorted resolution, 319-338 [Zbl 0925.68415] \textit{Pereira, Luís Moniz; Alferes, José Júlio; Aparício, Joaquim Nunes}, Default theory for well founded semantics with explicit negation, 339-356 [Zbl 0925.68097] \textit{Furbach, Ulrich}, Computing answers for disjunctive logic programs, 357-372 [Zbl 0925.68096] \textit{Witteveen, Cees}, Expanding logic programs, 373-390 [Zbl 0925.68099] \textit{Herre, Heinrich; Pearce, David}, Disjunctive logic programming, constructivity and strong negation, 391-410 [Zbl 0925.68098]