➦ Confidence-based reasoning in stochastic constraint programming
➦ Characteristics of multiple viewpoints in abstract argumentation
➦ Inducing semantic relations from conceptual spaces: A data-driven approach to plausible reasoning
➦ From senses to texts: An all-in-one graph-based approach for measuring semantic similarity
➦ A new probabilistic constraint logic programming language based on a generalised distribution semant
➦ Bi-goal evolution for many-objective optimization problems
➦ Law and logic: A review from an argumentation perspective
➦ Differential evolution for noisy multiobjective optimization
➦ Optimal social choice functions: A utilitarian view
➦ Truthful learning mechanisms for multi-slot sponsored search auctions with externalities
➦ Measuring inconsistency in probabilistic logic: rationality postulates and Dutch book interpretation
➦ Optimal Sokoban solving using pattern databases with specific domain knowledge
➦ Fair assignment of indivisible objects under ordinal preferences
➦ A generic approach to planning in the presence of incomplete information: Theory and implementation
➦ Automatic construction of optimal static sequential portfolios for AI planning and beyond
➦ Transferring knowledge as heuristics in reinforcement learning: A case-based approach
➦ Semantic characterization of rational closure: From propositional logic to description logics
➦ Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint
➦ On redundant topological constraints
➦ Incorporating weights into real-time heuristic search
➦ Framing reinforcement learning from human reward: Reward positivity, temporal discounting, episodici
➦ Computer-aided proof of Erdős discrepancy properties
➦ Grounded fixpoints and their applications in knowledge representation
➦ Ordered completion for logic programs with aggregates
➦ An SMT-based approach to weak controllability for disjunctive temporal problems with uncertainty
➦ Efficient nonconvex sparse group feature selection via continuous and discrete optimization
➦ Overview and analysis of the SAT Challenge 2012 solver competition
➦ Optimizing ontology alignments through a Memetic Algorithm using both MatchFmeasure and Unanimous Im
➦ The deterministic part of the seventh International Planning Competition
➦ Semantical considerations on multiagent only knowing
➦ Modular robotic systems: Methods and algorithms for abstraction, planning, control, and synchronizat
➦ Bounded model checking of strategy ability with perfect recall
➦ HTN planning: Overview, comparison, and beyond
➦ Playing with knowledge: A virtual player for “Who Wants to Be a Millionaire?” that leverages questio
➦ Achieving fully proportional representation: Approximability results
➦ Moving average reversion strategy for on-line portfolio selection
➦ A new semantics for overriding in description logics
➦ Finding core for coalition structure utilizing dual solution
➦ Red–black planning: A new systematic approach to partial delete relaxation
➦ Wanted: Collaborative intelligence
➦ POMDPs under probabilistic semantics
➦ Asynchronous knowledge with hidden actions in the situation calculus