000 04177nam a22005175i 4500
001 978-3-540-70643-4
003 DE-He213
005 20160624102102.0
007 cr nn 008mamaa
008 121227s1996 gw | s |||| 0|eng d
020 _a9783540706434
_9978-3-540-70643-4
024 7 _a10.1007/3-540-61630-6
_2doi
050 4 _aQ334-342
050 4 _aTJ210.2-211.495
072 7 _aUYQ
_2bicssc
072 7 _aTJFM1
_2bicssc
072 7 _aCOM004000
_2bisacsh
082 0 4 _a006.3
_223
245 1 0 _aLogics in Artificial Intelligence
_h[electronic resource] :
_bEuropean Workshop, JELIA '96 Évora, Portugal September 30 – October 3, 1996 Proceedings /
_cedited by José Jülio Alferes, Luís Moniz Pereira, Ewa Orlowska.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1996.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c1996.
300 _aX, 426 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science, Lecture Notes in Artificial Intelligence,
_x0302-9743 ;
_v1126
505 0 _aHyper tableaux -- An algorithm for the retrieval of unifiers from discrimination trees -- Building proofs or counterexamples by analogy in a resolution framework -- What you always wanted to know about rigid E-unification -- Labelled proofs for quantified modal logic -- A uniform tableaux method for nonmonotonic modal logics -- Design and implementation of diagnostic strategies using modal logic -- A modal action logic based framework for organization specification and analysis -- McCarthy's idea -- Strong and explicit negation in non-monotonic reasoning and logic programming -- Only persistence makes nonmonotonicity monotonous -- Ordering-based representations of rational inference -- Semi-representability of default theories in rational default logic -- A query answering algorithm for Lukaszewicz' general open default theory -- Infinitary default logic for specification of nonmonotonic reasoning -- A system for computing constrained default logic extensions -- The Oz programming model -- An abductive framework for negation in disjunctive logic programming -- Characterizing D-WFS: Confluence and iterated GCWA -- Modules and specifications -- Logic programming with integrity constraints -- Temporal reasoning over linear discrete time -- Similarity saturation for first order linear temporal logic with UNLESS -- Carving Up space: Steps towards construction of an absolutely complete theory of spatial regions -- Informational logic for automated reasoning -- Extensions for open default theories via the domain closure assumption -- Revising and updating using a back-up semantics -- A simple signed system for paraconsistent reasoning.
520 _aThis book presents the refereed proceedings of the Sixth European Workshop on Logics in Artificial Intelligence, JELIA '96, held in Evora, Portugal in September/October 1996. The 25 revised full papers included together with three invited papers were selected from 57 submissions. Many relevant aspects of AI logics are addressed. The papers are organized in sections on automated reasoning, modal logics, applications, nonmonotonic reasoning, default logics, logic programming, temporal and spatial logics, and belief revision and paraconsistency.
650 0 _aComputer science.
650 0 _aArtificial intelligence.
650 1 4 _aComputer Science.
650 2 4 _aArtificial Intelligence (incl. Robotics).
650 2 4 _aMathematical Logic and Formal Languages.
700 1 _aAlferes, José Jülio.
_eeditor.
700 1 _aPereira, Luís Moniz.
_eeditor.
700 1 _aOrlowska, Ewa.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540616306
786 _dSpringer
830 0 _aLecture Notes in Computer Science, Lecture Notes in Artificial Intelligence,
_x0302-9743 ;
_v1126
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-61630-6
942 _2EBK7430
_cEBK
999 _c36724
_d36724