Nonmonotonic and Inductive Logic: 1st International Workshop, Karlsruhe, Germany, December 4-7, 1990. Proceedings
Klaus P. Jantke, Peter H. Schmitt
Springer Science & Business Media, Sep 18, 1991 - Computers - 250 pages
This proceedings volume contains revised and reviewed papers based on talks presented at the first International Workshop on Nonmonotonic and Inductive Logic held in Karlsruhe, December 1990. The workshop was supported by the Volkswagen-Stiftung, Hannover, and provided a forum for researchers from the two fields to communicate and find areas of cooperation. The papersare organized into sections on: - Nonmonotonicity in logic programs - Axiomatic approach to nonmonotonic reasoning - Inductive inference - Autoepistemic logic - Belief updates The bulk of the papers are devoted to nonmonotonic logic and provide an up-to-date view of the current state of research presented by leading experts in the field. A novelty in the contributions from the area of inductive logic is the analysis of nonmonotonicity in the theory of inductive learning.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Cumulative Inference Relations for JTMS and Logic Programming
Cumulativity and Rationality in Semantics of Normal Logic Programs
Nonmonotonic Reasoning and Logic Programs
Supracompact Inference Operations
Notions of nonmonotonic derivability
Ranges of strong modal nonmonotonic logics
On Generation of Cumulative Inference Operators By Default Deduction Rules
Qualitative Magnitude Reasoning
Monotonic and NonMonotonic Inductive Inference of Functions and Patterns
A Thesis in Inductive Inference
Inductive Inference of Optimal Programs A Survey and Open Problems
Autoepistemic Expansions With Incomplete Belief Introspection
Is it Impossible to Keep Up to Date?
Other editions - View all
0-optimal arbitrary Artificial Intelligence Assume assumption autoepistemic expansions autoepistemic logic axiom belief belief revision Brewka cautious monotony characterization closed world assumption Cn(A compact complete Computer condition consequence consistent cumulative inference operation default deduction rules default logic defined denote example extensions finite sets finite subset fixed Y C F formal ground atom grounded models hence Herbrand model Herbrand universe hypothesis identified implies indexed propositions inductive definition inductive inference inference relation inference strategies inference types infimum intuitive JTMS justification rules least fixpoint Lemma Logic Programming Makinson Min(S minimal modal logic model operator monotonic non-Godel numberings nonmonotonic derivability nonmonotonic logic nonmonotonic reasoning notion paper pattern inference pattern languages properties prove qualitative magnitude rational recursive functions respect S(fn self-blocking semantics sequence SLD-refutation stable stratified supracompact Theorem three-valued universal theory weakly well-founded semantics WFS(P X C F