Logics in Artificial Intelligence: 14th European Conference, JELIA 2014, Funchal, Madeira, Portugal, September 24-26, 2014. Proceedings

Front Matter....Pages -
Query Answering over Description Logic Ontologies....Pages 1-17
Tools for the Investigation of Substructural and Paraconsistent Logics....Pages 18-32
Non-classical Planning with a Classical Planner: The Power of Transformations....Pages 33-47
Opportunities for Argument-Centric Persuasion in Behaviour Change....Pages 48-61
The Fuzzy Description Logic $\mathsf{G}\text{-}{\mathcal{F\!L}_0} $ with Greatest Fixed-Point Semantics....Pages 62-76
Tight Complexity Bounds for Reasoning in the Description Logic $\mathcal{BE{\kern-.1em}L}$ ....Pages 77-91
Relevant Closure: A New Form of Defeasible Reasoning for Description Logics....Pages 92-106
Error-Tolerant Reasoning in the Description Logic $\mathcal{E{\kern-.1em}L}$ ....Pages 107-121
Sub-propositional Fragments of the Interval Temporal Logic of Allen’s Relations....Pages 122-136
SAT Modulo Graphs: Acyclicity....Pages 137-151
Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form....Pages 152-165
Improving the Normalization of Weight Rules in Answer Set Programs....Pages 166-180
Logical Foundations of Possibilistic Keys....Pages 181-195
Possibilistic Boolean Games: Strategic Reasoning under Incomplete Information....Pages 196-209
LEG Networks for Ranking Functions....Pages 210-223
Logics for Approximating Implication Problems of Saturated Conditional Independence....Pages 224-238
Finitary S5 -Theories....Pages 239-252
Efficient Program Transformers for Translating LCC to PDL ....Pages 253-266
On the Expressiveness of the Interval Logic of Allen’s Relations Over Finite and Discrete Linear Orders....Pages 267-281
Only-Knowing à la Halpern-Moses for Non-omniscient Rational Agents: A Preliminary Report....Pages 282-296
A Complexity Assessment for Queries Involving Sufficient and Necessary Causes....Pages 297-310
Inductive Learning of Answer Set Programs....Pages 311-325
Stable Models of Fuzzy Propositional Formulas....Pages 326-339
A Free Logic for Stable Models with Partial Intensional Functions....Pages 340-354
Constructive Models for Contraction with Intransitive Plausibility Indifference....Pages 355-367
Four Floors for the Theory of Theory Change: The Case of Imperfect Discrimination....Pages 368-382
Revisiting Postulates for Inconsistency Measures....Pages 383-396
A Translation-Based Approach for Revision of Argumentation Frameworks....Pages 397-411
Preserving Strong Equivalence while Forgetting....Pages 412-425
Computing Repairs for Inconsistent DL-programs over $\mathcal{EL}$ Ontologies....Pages 426-441
A Prioritized Assertional-Based Revision for DL-Lite Knowledge Bases....Pages 442-456
Modular Paracoherent Answer Sets....Pages 457-471
Action Theories over Generalized Databases with Equality Constraints....Pages 472-485
A Dynamic View of Active Integrity Constraints....Pages 486-499
Similarity Orders from Causal Equations....Pages 500-513
Verification of Context-Sensitive Knowledge and Action Bases....Pages 514-528
System aspmt2smt : Computing ASPMT Theories by SMT Solvers....Pages 529-542
A Library of Anti-unification Algorithms....Pages 543-557
The D-FLAT System for Dynamic Programming on Tree Decompositions....Pages 558-572
ACUOS: A System for Modular ACU Generalization with Subtyping and Inheritance....Pages 573-581
Drawing Euler Diagrams from Region Connection Calculus Specifications with Local Search....Pages 582-590
Probabilistic Abstract Dialectical Frameworks....Pages 591-599
Argumentative Aggregation of Individual Opinions....Pages 600-608
Measuring Dissimilarity between Judgment Sets....Pages 609-617
Exploiting Answer Set Programming for Handling Information Diffusion in a Multi-Social-Network Scenario....Pages 618-627
Reasoning about Dynamic Normative Systems....Pages 628-636
A Modal Logic of Knowledge, Belief, and Estimation....Pages 637-646
A Logic for Belief Contraction....Pages 647-656
Logic Foundations of the OCL Modelling Language....Pages 657-664
Constraint-Based Algorithm for Computing Temporal Invariants....Pages 665-673
Answer Set Solver Backdoors....Pages 674-683
Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem....Pages 684-693
Revisiting Reductants in the Multi-adjoint Logic Programming Framework....Pages 694-702
Back Matter....Pages -