+612 9045 4394
Logics in Artificial Intelligence : Lecture Notes in Computer Science - Farinas Luis Cerro

Logics in Artificial Intelligence

Lecture Notes in Computer Science

By: Farinas Luis Cerro (Editor), Ulrich Furbach (Editor)

Paperback ISBN: 9783540651413
Number Of Pages: 390

Share This Book:


or 4 easy payments of $31.26 with Learn more
Ships in 5 to 9 business days

This book constitutes the refereed proceedings of the European Workshop on Logics in Artificial Intelligence, JELTA '98, held in Dagstuhl, Germany, in October 1998.The 25 revised full papers presented were carefully selected from a total of 65 submissions. Also included are two abstracts of invited talks. The papers are organized in topical sections on logic programming, epistemic logics, theorem proving, non-monotonic reasoning, non-standard logics, knowledge representation, and higher order logics.

The Well-Founded Semantics Is the Principle of Inductive Definitionp. 1
Combining Introspection and Communication with Rationality and Reactivity in Agentsp. 17
Disjunctive Logic Program = Horn Program + Control Programp. 33
Semantics of Partial-Order Programsp. 47
Persistence and Minimality in Epistemic Logicp. 62
Prohairetic Deontic Logic (PDL)p. 77
Phased Labeled Logics of Conditional Goalsp. 92
Analysis of Distributed-Search Contraction-Based Strategiesp. 107
A Deduction Method Complete for Refutation and Finite Satisfiabilityp. 122
Requirement-Based Cooperative Theorem Provingp. 139
[Omega]-Resolution: An Inference Rule for Regular Multiple-Valued Logicsp. 154
A Matrix Characterization for MELLp. 169
A Resolution Calculus for Dynamic Semanticsp. 184
Algorithms on Atomic Representations of Herbrand Modelsp. 199
On the Intertranslatability of Autoepistemic, Default and Priority Logics, and Parallel Circumscriptionp. 216
An Approach to Query-Answering in Reiter's Default Logic and the Underlying Existence of Extensions Problemp. 233
Towards State Update Axioms: Reifying Successor State Axiomsp. 248
A Mechanised Proof System for Relation Algebra Using Display Logicp. 264
Relative Similarity Logics are Decidable: Reduction to FO[superscript 2] with Equalityp. 279
A Conditional Logic for Belief Revisionp. 294
Implicates and Reduction Techniques for Temporal Logicsp. 309
A Logic for Anytime Deduction and Anytime Compilationp. 324
On Knowledge, Strings, and Paradoxesp. 342
Propositional Lower Bounds: Generalization and Algorithmsp. 355
Higher Order Generalizationp. 368
The Logical Characterization of Goal-Directed Behavior in the Presence of Exogenous Eventsp. 382
Towards Inference and Computation Mobility: The Jinni Experimentp. 385
Author Indexp. 391
Table of Contents provided by Blackwell. All Rights Reserved.

ISBN: 9783540651413
ISBN-10: 3540651411
Series: Lecture Notes in Computer Science
Audience: General
Format: Paperback
Language: English
Number Of Pages: 390
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6  x 2.13
Weight (kg): 0.57