000 04391nam a22005175i 4500
001 978-3-540-45402-1
003 DE-He213
005 20160624102001.0
007 cr nn 008mamaa
008 121227s2001 gw | s |||| 0|eng d
020 _a9783540454021
_9978-3-540-45402-1
024 7 _a10.1007/3-540-45402-0
_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 _aLogic Programming and Nonmotonic Reasoning
_h[electronic resource] :
_b6th International Conference, LPNMR 2001 Vienna, Austria, September 17–19, 2001 Proceedings /
_cedited by Thomas Eiter, Wolfgang Faber, Miros law Truszczyński.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2001.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2001.
300 _aX, 454 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,
_x0302-9743 ;
_v2173
505 0 _aInvited Papers -- A Computational Logic Approach to Heterogenous Agent Systems -- Declarative Information Extraction, Web Crawling, and Recursive Wrapping with Lixto -- On The Complexity of Model Checking and Inference in Minimal Models -- Data Integration Needs Reasoning -- Nonmonotomic Inductive Logic Programming -- Regular Papers -- Strong Equivalence for Logic Programs and Default Theories (Made Easy) -- On the Effect of Default Negation on the Expressiveness of Disjunctive Rules -- On the Expressibility of Stable Logic Programming -- On the Relationship between Defeasible Logic and Well-Founded Semantics -- A Comparative Study of Well-Founded Semantics for Disjunctive Logic Programs -- Reasoning with Open Logic Programs -- Representation of Incomplete Knowledge by Induction of Default Theories -- Explicity Using Default Knowledge in Concept Learning: An Extended Description Logics Plus Strict and Default Rules -- Declarative Specification and Solution of Combinatorial Auctions Using Logic Programming -- Bounded LTL Model Checking with Stable Models -- Diagnosing Physical Systems in A-Prolog -- Planning with Different Forms of Domain-Dependent Control Knowledge — An Answer Set Programming Approach -- Encoding Solutions of the Frame Problem in Dynamic Logic -- ?-RES: Reasoning about Actions, Events and Observations -- Omega-Restricted Logic Programs -- Improving ASP Instantiators by Join-Ordering Methods -- Optimizing the Computation of Heuristics for Answer Set Programming Systems -- New Generation Systems for Non-monotonic Reasoning -- Algorithms for Computing X-Minimal Models -- Fixpoint Characterizations for Many-Valued Disjunctive Logic Programs with Probabilistic Semantics -- Multi-adjoint Logic Programming with Continous Semantics -- Multi-dimensional Dynamic Knowledge Representation -- Antitonic Logic Programs -- System Description -- A-system: Declarative Programming with Abduction -- An Update Front-End for Extended Logic Programs -- aspps — An Implementation of Answer-Set Programming with Propositional Schemata -- NoMoRe: A System for Non-Monotonic Reasoning under Answer Set Semantics -- plp: A Generic Compiler for Ordered Logic Programs -- Prototypes for Reasoning with Infinite Stable Models and Function Symbols -- psmodels: Stable Models Based on Pertinence -- System Description: DLV -- System Description: The DLVK Planning System -- The Smodels System -- The USA-Advisor: A Case Study in Answer Set Planning.
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.
650 2 4 _aProgramming Techniques.
700 1 _aEiter, Thomas.
_eeditor.
700 1 _aFaber, Wolfgang.
_eeditor.
700 1 _aTruszczyński, Miros law.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540425939
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v2173
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-45402-0
942 _2EBK5348
_cEBK
999 _c34642
_d34642