➦ The price of query rewriting in ontology-based data access
➦ FLP answer set semantics without circular justifications for general logic programs
➦ Learning hierarchical task network domains from partially observed plan traces
➦ Erratum to ‘A logic for reasoning about ambiguity’ [Artificial Intelligence 209 (2014) 1–10]
➦ On topology-related properties of abstract argumentation semantics. A correction and extension to Dy
➦ Filtering AtMostNValue with difference constraints: Application to the shift minimisation personnel
➦ Computational protein design as an optimization problem
➦ Action-model acquisition for planning via transfer learning
➦ On the revision of informant credibility orders
➦ Explorative anytime local search for distributed constraint optimization
➦ A branch and prune algorithm for the computation of generalized aspects of parallel robots
➦ CTL update of Kripke models through protections
➦ Generating custom propagators for arbitrary constraints
➦ On the tractability of minimal model computation for some CNF theories
➦ The dropout learning algorithm
➦ An event-based distributed diagnosis framework using structural model decomposition
➦ Limitations of acyclic causal graphs for planning
➦ Consequence-based and fixed-parameter tractable reasoning in description logics
➦ A logic for reasoning about ambiguity
➦ Concept drift detection via competence models
➦ Weighted synergy graphs for effective team formation with heterogeneous ad hoc agents
➦ The actorʼs view of automated planning and acting: A position paper
➦ Hidden protocols: Modifying our expectations in an evolving world
➦ The complexity of manipulative attacks in nearly single-peaked electorates
➦ Algorithms for decision problems in argument systems under preferred semantics
➦ Linked taxonomies to capture usersʼ subjective assessments of items to facilitate accurate collabora
➦ Relating constraint answer set programming languages and algorithms
➦ Complexity-sensitive decision procedures for abstract argumentation
➦ Algorithm runtime prediction: Methods & evaluation
➦ Lost in translation: Language independence in propositional logic – application to belief change
➦ CROSS cyclic resource-constrained scheduling solver
➦ Approximating operators and semantics for abstract dialectical frameworks
➦ Evidential reasoning rule for evidence combination
➦ On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables
➦ An analysis on recombination in multi-objective evolutionary optimization
➦ End-user feature labeling: Supervised and semi-supervised approaches based on locally-weighted logis
➦ Local search for Boolean Satisfiability with configuration checking and subscore
➦ Speeding up many-objective optimization by Monte Carlo approximations
➦ Type Extension Trees for feature construction and learning in relational domains