Logics in AI : European Workshop JELIA '92, Berlin, Germany, September 7-10, 1992 : proceedings
著者
書誌事項
Logics in AI : European Workshop JELIA '92, Berlin, Germany, September 7-10, 1992 : proceedings
（Lecture notes in computer science, 633 . Lecture notes in artificial intelligence）
Springer-Verlag, c1992
- : gw
- : us
- タイトル別名
-
Logics in artificial intelligence
大学図書館所蔵 件 / 全59件
-
: gw10092702113,10092702297,10092702849,10093700751,
007.08-L49-633//007.1927018116 -
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references
内容説明・目次
内容説明
This volume contains the proceedings of JELIA '92, les
Journ es Europ ennes sur la Logique en Intelligence
Artificielle, or the Third European Workshop on Logics in
Artificial Intelligence.
The volume contains 2 invited addresses and 21 selected
papers covering such topics as:
- Logical foundations of logic programming and
knowledge-based systems,
- Automated theorem proving,
- Partial and dynamic logics,
- Systems of nonmonotonic reasoning,
- Temporal and epistemic logics,
- Belief revision.
One invited paper, by D. Vakarelov, is on arrow logics,
i.e., modal logics for representing graph information. The
other, by L.M. Pereira,J.J. Alferes, and J.N. Apar cio, is
on default theory for well founded semantics with explicit
negation.
目次
A modal theory of arrows. Arrow logics I.- Knowledge without modality: A simplified framework for chronological ignorance.- Design complete sequential calculus for continuous fixpoint temporal logic.- Logical omniscience and classical logic.- Weak implication: Theory and applications.- Deriving inference rules for terminological logics.- Linear proofs and linear logic.- Relevance and revision.- Modellings for belief change: Base contraction, multiple contraction, and epistemic entrenchment (preliminary report).- A framework for default logics.- A conceptualization of preferences in non-monotonic proof theory.- Reasoning with defeasible arguments: Examples and applications.- About deductive generalization.- Transition systems and dynamic semantics.- Declarative semantics for inconsistent database programs.- Tableau-based theorem proving and synthesis of ?-terms in the intuitionistic logic.- A constructive type system based on data terms.- An ordered resolution and paramodulation calculus for finite many-valued logics.- An efficient constraint language for polymorphic order-sorted resolution.- Default theory for Well Founded Semantics with explicit negation.- Computing answers for disjunctive logic programs.- Expanding logic programs.- Disjunctive logic programming, constructivity and strong negation.
「Nielsen BookData」 より