000 06383nam a22006135i 4500
001 978-3-319-11558-0
003 DE-He213
005 20200421112040.0
007 cr nn 008mamaa
008 140916s2014 gw | s |||| 0|eng d
020 _a9783319115580
_9978-3-319-11558-0
024 7 _a10.1007/978-3-319-11558-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 _aLogics in Artificial Intelligence
_h[electronic resource] :
_b14th European Conference, JELIA 2014, Funchal, Madeira, Portugal, September 24-26, 2014. Proceedings /
_cedited by Eduardo Ferm�e, Jo�ao Leite.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2014.
300 _aXVI, 704 p. 88 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 ;
_v8761
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.
520 _aThis book constitutes the proceedings of the 14th European Conference on Logics in Artificial Intelligence, JELIA 2014, held in Funchal, Madeira, Portugal, in September 2014. The 35 full papers and 14 short papers included in this volume were carefully reviewed and selected from 121 submissions. They are organized in topical sections named: description logics; automated reasoning; logics for uncertain reasoning; non-classical logics; answer-set programming; belief revision; dealing with inconsistency in ASP and DL; reason about actions and causality; system descriptions; short system descriptions; and short papers. The book also contains 4 full paper invited talks.
650 0 _aComputer science.
650 0 _aComputer programming.
650 0 _aComputer logic.
650 0 _aMathematical logic.
650 0 _aDatabase management.
650 0 _aInformation storage and retrieval.
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 _aLogics and Meanings of Programs.
650 2 4 _aProgramming Techniques.
650 2 4 _aInformation Storage and Retrieval.
650 2 4 _aDatabase Management.
700 1 _aFerm�e, Eduardo.
_eeditor.
700 1 _aLeite, Jo�ao.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783319115573
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v8761
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-319-11558-0
912 _aZDB-2-SCS
912 _aZDB-2-LNC
942 _cEBK
999 _c56591
_d56591