Search Results for author:
Found 18 papers, 1 papers with code
Stable Marriage Problems with Ties and Incomplete Preferences: An Empirical Comparison of ASP, SAT, ILP, CP, and Local Search Methods
This problem is called the Stable Marriage problem with Ties and Incomplete preferences (SMTI).
Knowledge-Based Stable Roommates Problem: A Real-World Application
However, in real-world applications (e. g., assigning students as roommates at a dormitory), we usually consider a variety of domain-specific criteria depending on preferences over the habits and desires of the agents.
Solving Gossip Problems using Answer Set Programming: An Epistemic Planning Approach
We investigate the use of Answer Set Programming to solve variations of gossip problems, by modeling them as epistemic planning problems.
Dynamic Multi-Agent Path Finding based on Conflict Resolution using Answer Set Programming
We study a dynamic version of multi-agent path finding problem (called D-MAPF) where existing agents may leave and new agents may join the team at different times.
Reasoning about Cardinal Directions between 3-Dimensional Extended Objects using Answer Set Programming
We propose a novel formal framework (called 3D-nCDC-ASP) to represent and reason about cardinal directions between extended objects in 3-dimensional (3D) space, using Answer Set Programming (ASP).
Human Robot Collaborative Assembly Planning: An Answer Set Programming Approach
We propose a novel method for collaborative assembly planning under uncertainty, that utilizes hybrid conditional planning extended with commonsense reasoning and a rich set of communication actions for collaborative tasks.
Explanation Generation for Multi-Modal Multi-Agent Path Finding with Optimal Resource Utilization using Answer Set Programming
Our earlier studies on mMAPF have focused on the former challenge of flexibility.
A General Framework for Stable Roommates Problems using Answer Set Programming
For that reason, there are also variations of SR that try to find a good-enough solution (e. g., Almost SR).
Proceedings 35th International Conference on Logic Programming (Technical Communications)
Since the first conference held in Marseille in 1982, ICLP has been the premier international event for presenting research in logic programming.
Introduction to the 35th International Conference on Logic Programming Special Issue
We are proud to introduce this special issue of Theory and Practice of Logic Programming (TPLP), dedicated to the regular papers accepted for the 35th International Conference on Logic Programming (ICLP).
Object Placement on Cluttered Surfaces: A Nested Local Search Approach
For planning rearrangements of objects in a clutter, it is required to know the goal configuration of the objects.
A Formal Framework for Robot Construction Problems: A Hybrid Planning Approach
This framework not only decides for a stable final configuration of the structure, but also computes the order of manipulation tasks for multiple autonomous robots to build the structure from an initial configuration, while simultaneously ensuring the stability, supportedness and other desired properties of the partial construction at each step of the plan.
Hybrid Conditional Planning using Answer Set Programming
We introduce a parallel offline algorithm for computing hybrid conditional plans, called HCP-ASP, oriented towards robotics applications.
Generating Shortest Synchronizing Sequences using Answer Set Programming
For a finite state automaton, a synchronizing sequence is an input sequence that takes all the states to the same state.
Generating Explanations for Biomedical Queries
We introduce novel mathematical models and algorithms to generate (shortest or k different) explanations for biomedical queries, using answer set programming.
Levels of Integration between Low-Level Reasoning and Task Planning
We provide a systematic analysis of levels of integration between discrete high-level reasoning and continuous low-level reasoning to address hybrid planning problems in robotics.
ReAct! An Interactive Tool for Hybrid Planning in Robotics
enables robotic researchers to describe robots' actions and change in dynamic domains, without having to know about the syntactic and semantic details of the underlying formalism in advance, and solve planning problems using state-of-the-art automated reasoners, without having to learn about their input/output language or usage.
Integration of 3D Object Recognition and Planning for Robotic Manipulation: A Preliminary Report
We investigate different approaches to integrating object recognition and planning in a tabletop manipulation domain with the set of objects used in the 2012 RoboCup@Work competition.
