000			05041nam a22003855i 4500
001			vtls001950090
003			NLI
005			20210630064925.0
007			cr nn 008mamaa
008			170531s2014 gw | s |||| 0|eng d
020			_a9783319115580 _9978-3-319-11558-0
039		9	_y201705311137 _zgopag
041	0		_aeng
044			_agw
245	1	0	_aLogics in Artificial Intelligence _h[electronic resource] : _b14th European Conference, JELIA 2014, Funchal, Madeira, Portugal, September 24-26, 2014. Proceedings / _cedited by Eduardo Fermé, João Leite.
260			_aCham : _bSpringer International Publishing, _c2014.
300			_a1 online resource (XVI, 704 p. 88 ill.)
440		0	_aLecture Notes in Computer Science, _x0302-9743 ; _v8761 _9833933
505	0		_aQuery Answering over Description Logic Ontologies -- Tools for the Investigation of Substructural and Paraconsistent Logics -- Non-classical Planning with a Classical Planner: The Power of Transformations -- Opportunities for Argument-Centric Persuasion in Behaviour Change -- The Fuzzy Description Logic G-FL0 with Greatest Fixed-Point Semantics -- Tight Complexity Bounds for Reasoning in the Description Logic BEL -- Relevant Closure: A New Form of Defeasible Reasoning for Description Logics -- Error-Tolerant Reasoning in the Description Logic EL -- Sub-propositional Fragments of the Interval Temporal Logic of Allen's Relations -- SAT Modulo Graphs: Acyclicity -- Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form -- Improving the Normalization of Weight Rules in Answer Set Programs -- Logical Foundations of Possibilistic Keys -- Possibilistic Boolean Games: Strategic Reasoning under Incomplete Information -- LEG Networks for Ranking Functions -- Logics for Approximating Implication Problems of Saturated Conditional Independence -- Non-Classical Logics Finitary S5-Theories -- Efficient Program Transformers for Translating LCC to PDL -- On the Expressiveness of the Interval Logic of Allen's Relations over Finite and Discrete Linear Orders -- Only-Knowing a la Halpern-Moses for Non-omniscient Rational Agents: A Preliminary Report -- Answer-Set Programming A Complexity Assessment for Queries Involving Sufficient and Necessary Causes -- Inductive Learning of Answer Set Programs -- Stable Models of Fuzzy Propositional Formulas -- A Free Logic for Stable Models with Partial Intensional Functions -- Constructive Models for Contraction with Intransitive Plausibility Indifference -- Four Floors for the Theory of Theory Change: The Case of Imperfect Discrimination -- Revisiting Postulates for Inconsistency Measures -- A Translation-Based Approach for Revision of Argumentation Frameworks -- Dealing with Inconsistency in ASP and DL Preserving Strong Equivalence while Forgetting -- Computing Repairs for Inconsistent DL-programs over EL Ontologies -- A Prioritized Assertional-Based Revision for DL-Lite Knowledge Bases -- Modular Paracoherent Answer Sets -- Action Theories over Generalized Databases with Equality Constraints -- A Dynamic View of Active Integrity Constraints -- Similarity Orders from Causal Equations -- Verification of Context-Sensitive Knowledge and Action Bases -- System Descriptions System aspmt2smt: Computing ASPMT Theories by SMT Solvers -- A Library of Anti-unification Algorithms -- The D-FLAT System for Dynamic Programming on Tree Decompositions -- ACUOS: A System for Modular ACU Generalization with Subtyping and Inheritance -- Drawing Euler Diagrams from Region Connection Calculus Specifications with Local Search -- Short Papers -- Probabilistic Abstract Dialectical Frameworks -- Argumentative Aggregation of Individual Opinions -- Measuring Dissimilarity between Judgment Sets -- Exploiting Answer Set Programming for Handling Information Diffusion in a Multi-Social-Network Scenario -- Reasoning about Dynamic Normative Systems -- A Modal Logic of Knowledge, Belief, and Estimation -- A Logic for Belief Contraction -- Logic Foundations of the OCL Modelling Language -- Constraint-Based Algorithm for Computing Temporal Invariants -- Answer Set Solver Backdoors -- Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem -- Revisiting Reductants in the Multi-adjoint Logic Programming Framework.
650		0	_aComputer science.
650		0	_aComputer programming. _9678756
650		0	_aComputer logic.
650		0	_aMathematical logic.
650		0	_aDatabase management. _9676040
650		0	_aInformation Storage and Retrieval. _9834596
650		0	_aArtificial intelligence.
700	1		_aFermé, Eduardo, _4edt _91310256
700	1		_aLeite, João, _4edt _91038794
856	4	0	_uhttp://dx.doi.org/10.1007/978-3-319-11558-0
887			_a Gopa
905			_aGopa
949			_AVIRTUAITEM _D10000 _X206 _6EBK000024900ENG _eEBK24900
942			_2ddc _cBKS
999			_aVIRTUA _c1375587 _d1375587
999			_aVTLSSORT0070*0080*0200*0410*0440*2450*2600*3000*4400*5050*6500*6501*6502*6503*6504*6505*6506*7000*7001*8560*9050*9992