000			04206nam a22005895i 4500
001			978-3-642-15675-5
003			DE-He213
005			20160624102148.0
007			cr nn 008mamaa
008			100913s2010 gw | s |||| 0|eng d
020			_a9783642156755 _9978-3-642-15675-5
024	7		_a10.1007/978-3-642-15675-5 _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] : _b12th European Conference, JELIA 2010, Helsinki, Finland, September 13-15, 2010. Proceedings / _cedited by Tomi Janhunen, Ilkka Niemelä.
260		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2010.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2010.
300			_aXIV, 374p. 48 illus. _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 ; _v6341
505	0		_aInvited Talks -- Nonmonotonic Tools for Argumentation -- Relax, Compensate and Then Recover: A Theory of Anytime, Approximate Inference -- Counter Systems for Data Logics -- Regular Papers -- Similarity-Based Inconsistency-Tolerant Logics -- Decomposition of Distributed Nonmonotonic Multi-Context Systems -- Bridging Possibilistic Conditional Knowledge Bases and Partially Ordered Bases -- A Decidable Constructive Description Logic -- A Normal Form for Linear Temporal Equilibrium Logic -- Rational Closure for Defeasible Description Logics -- Extensional Higher-Order Logic Programming -- dl2asp: Implementing Default Logic via Answer Set Programming -- Sets of Boolean Connectives That Make Argumentation Easier -- Retroactive Subsumption-Based Tabled Evaluation of Logic Programs -- Preference-Based Inconsistency Assessment in Multi-Context Systems -- A Logical Semantics for Description Logic Programs -- An Incremental Answer Set Programming Based System for Finite ModelComputation -- Parametrized Logic Programming -- Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription -- : A Context Description Logic -- Stable Belief Sets Revisited -- Efficient Inferencing for OWL EL -- Translating First-Order Causal Theories into Answer Set Programming -- Preprocessing Boolean Formulae for BDDs in a Probabilistic Context -- Minimal Knowledge and Belief via Minimal Topology -- A Logical Account of Lying -- Tabling with Answer Subsumption: Implementation, Applications and Performance -- Embracing Events in Causal Modelling: Interventions and Counterfactuals in CP-Logic -- An Approximative Inference Method for Solving ???SO Satisfiability Problems -- Horn Contraction via Epistemic Entrenchment -- System Descriptions -- The DMCS Solver for Distributed Nonmonotonic Multi-Context Systems -- The mcs-ie System for Explaining Inconsistency in Multi-Context Systems -- Coala: A Compiler from Action Languages to ASP -- DLV MC : Enhanced Model Checking in DLV -- A Dynamic-Programming Based ASP-Solver.
650		0	_aComputer science.
650		0	_aSoftware engineering.
650		0	_aLogic design.
650		0	_aAlgebra _xData processing.
650		0	_aInformation systems.
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	_aInformation Systems Applications (incl.Internet).
650	2	4	_aSoftware Engineering.
650	2	4	_aLogics and Meanings of Programs.
650	2	4	_aSymbolic and Algebraic Manipulation.
700	1		_aJanhunen, Tomi. _eeditor.
700	1		_aNiemelä, Ilkka. _eeditor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9783642156748
786			_dSpringer
830		0	_aLecture Notes in Computer Science, _x0302-9743 ; _v6341
856	4	0	_uhttp://dx.doi.org/10.1007/978-3-642-15675-5
942			_2EBK9284 _cEBK
999			_c38578 _d38578