Logics in AI

European Workshop JELIA '92, Berlin, Germany, September 7-10, 1992. Proceedings

Häftad, Engelska, 1992

709 kr

Beställningsvara. Skickas inom 10-15 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

This volume contains the proceedings of JELIA '92, lesJourn es Europ ennes sur la Logique en IntelligenceArtificielle, or the Third European Workshop on Logics inArtificial Intelligence.The volume contains 2 invited addresses and 21 selectedpapers covering such topics as:- Logical foundations of logic programming andknowledge-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. Theother, by L.M. Pereira,J.J. Alferes, and J.N. Apar cio, ison default theory for well founded semantics with explicitnegation.

Produktinformation

Utgivningsdatum1992-08-19
Mått155 x 235 x undefined mm
FormatHäftad
SpråkEngelska
SerieLecture Notes in Artificial Intelligence
Antal sidor412
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540558873

Tillhör följande kategorier

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.