Search Results for author:
Found 12 papers, 0 papers with code
Competitions in AI -- Robustly Ranking Solvers Using Statistical Resampling
To address this problem, we introduce a novel approach to statistically meaningful analysis of competition results based on resampling performance data.
Reformulation Techniques for Automated Planning: A Systematic Review
Automated planning is a prominent area of Artificial Intelligence, and an important component for intelligent autonomous agents.
On the Configuration of More and Less Expressive Logic Programs
The decoupling between the representation of a certain problem, i. e., its knowledge model, and the reasoning side is one of main strong points of model-based Artificial Intelligence (AI).
Fudge: A light-weight solver for abstract argumentation based on SAT reductions
We present Fudge, an abstract argumentation solver that tightly integrates satisfiability solving technology to solve a series of abstract argumentation problems.
On the Importance of Domain Model Configuration for Automated Planning Engines
The development of domain-independent planners within the AI Planning community is leading to "off-the-shelf" technology that can be used in a wide range of applications.
Manipulation of Articulated Objects using Dual-arm Robots via Answer Set Programming
We validate the overall framework in the extended scenario, thereby confirming the applicability of ASP also in more realistic Robotics settings, and showing the usefulness of macro actions for the robot-based manipulation of articulated objects.
Organising a Successful AI Online Conference: Lessons from SoCS 2020
The 13th Symposium on Combinatorial Search (SoCS) was held May 26-28, 2020.
A Hypercat-enabled Semantic Internet of Things Data Hub: Technical Report
In this work, we propose a semantic enrichment of the BT Hypercat Data Hub, using well-accepted Semantic Web standards and tools.
Solving Set Optimization Problems by Cardinality Optimization via Weak Constraints with an Application to Argumentation
Optimization - minimization or maximization - in the lattice of subsets is a frequent operation in Artificial Intelligence tasks.
A General Framework for Describing Creative Agents
Computational creativity is a subfield of AI focused on developing and studying creative systems.
Exploiting Parallelism for Hard Problems in Abstract Argumentation: Technical Report
Abstract argumentation framework (\AFname) is a unifying framework able to encompass a variety of nonmonotonic reasoning approaches, logic programming and computational argumentation.
Computing Preferred Extensions in Abstract Argumentation: a SAT-based Approach
This paper presents a novel SAT-based approach for the computation of extensions in abstract argumentation, with focus on preferred semantics, and an empirical evaluation of its performances.
