Finding optimal plans for multiple teams of robots through a mediator: A logic-based approach

2013 ◽  
Vol 13 (4-5) ◽  
pp. 831-846 ◽  
Author(s):  
ESRA ERDEM ◽  
VOLKAN PATOGLU ◽  
ZEYNEP G. SARIBATUR ◽  
PETER SCHÜLLER ◽  
TANSEL URAS
Keyword(s):  
Computational Complexity ◽  
Energy Efficient ◽  
State Of The Art ◽  
Answer Set Programming ◽  
The State ◽  
Action Languages ◽  
Mathematical Definition ◽  
Definition Of ◽  
Answer Set

AbstractWe study the problem of finding optimal plans for multiple teams of robots through a mediator, where each team is given a task to complete in its workspace on its own and where teams are allowed to transfer robots between each other, subject to the following constraints: 1) teams (and the mediator) do not know about each other's workspace or tasks (e.g., for privacy purposes); 2) every team can lend or borrow robots, but not both (e.g., transportation/calibration of robots between/for different workspaces is usually costly). We present a mathematical definition of this problem and analyze its computational complexity. We introduce a novel, logic-based method to solve this problem, utilizing action languages and answer set programming for representation, and the state-of-the-art ASP solvers for reasoning. We show the applicability and usefulness of our approach by experiments on various scenarios of responsive and energy-efficient cognitive factories.

scholarly journals The Seventh Answer Set Programming Competition: Design and Results

2019 ◽  
Vol 20 (2) ◽  
pp. 176-204 ◽  
Author(s):  
MARTIN GEBSER ◽  
MARCO MARATEA ◽  
FRANCESCO RICCA
Keyword(s):  
Knowledge Representation ◽  
Logic Programming ◽  
State Of The Art ◽  
Answer Set Programming ◽  
The State ◽  
International Conference ◽  
Knowledge Representation Language ◽  
Representation Language ◽  
The University ◽  
Answer Set

AbstractAnswer Set Programming (ASP) is a prominent knowledge representation language with roots in logic programming and non-monotonic reasoning. Biennial ASP competitions are organized in order to furnish challenging benchmark collections and assess the advancement of the state of the art in ASP solving. In this paper, we report on the design and results of the Seventh ASP Competition, jointly organized by the University of Calabria (Italy), the University of Genova (Italy), and the University of Potsdam (Germany), in affiliation with the 14th International Conference on Logic Programming and Non-Monotonic Reasoning (LPNMR 2017).

scholarly journals On Uniform Equivalence of Epistemic Logic Programs

2019 ◽  
Vol 19 (5-6) ◽  
pp. 826-840
Author(s):  
WOLFGANG FABER ◽  
MICHAEL MORAK ◽  
STEFAN WOLTRAN
Keyword(s):  
Computational Complexity ◽  
Epistemic Logic ◽  
State Of The Art ◽  
Answer Set Programming ◽  
Polynomial Hierarchy ◽  
Logic Programs ◽  
The Third ◽  
New Research ◽  
Answer Set

AbstractEpistemic Logic Programs (ELPs) extend Answer Set Programming (ASP) with epistemic negation and have received renewed interest in recent years. This led to the development of new research and efficient solving systems for ELPs. In practice, ELPs are often written in a modular way, where each module interacts with other modules by accepting sets of facts as input, and passing on sets of facts as output. An interesting question then presents itself: under which conditions can such a module be replaced by another one without changing the outcome, for any set of input facts? This problem is known as uniform equivalence, and has been studied extensively for ASP. For ELPs, however, such an investigation is, as of yet, missing. In this paper, we therefore propose a characterization of uniform equivalence that can be directly applied to the language of state-of-the-art ELP solvers. We also investigate the computational complexity of deciding uniform equivalence for two ELPs, and show that it is on the third level of the polynomial hierarchy.

Action language ℬ𝒞+

2015 ◽  
Vol 30 (4) ◽  
pp. 899-922 ◽  
Author(s):  
Joseph Babb ◽  
Joohyung Lee
Keyword(s):  
Main Idea ◽  
Answer Set Programming ◽  
Stable Model ◽  
Formal Models ◽  
Transition Systems ◽  
Action Languages ◽  
Action Language ◽  
Language Constructs ◽  
High Level ◽  
Answer Set

Abstract Action languages are formal models of parts of natural language that are designed to describe effects of actions. Many of these languages can be viewed as high-level notations of answer set programs structured to represent transition systems. However, the form of answer set programs considered in the earlier work is quite limited in comparison with the modern Answer Set Programming (ASP) language, which allows several useful constructs for knowledge representation, such as choice rules, aggregates and abstract constraint atoms. We propose a new action language called BC +, which closes the gap between action languages and the modern ASP language. The main idea is to define the semantics of BC + in terms of general stable model semantics for propositional formulas, under which many modern ASP language constructs can be identified with shorthands for propositional formulas. Language BC  + turns out to be sufficiently expressive to encompass the best features of other action languages, such as languages B , C , C + and BC . Computational methods available in ASP solvers are readily applicable to compute BC +, which led to an implementation of the language by extending system cplus2asp .

Visual Saliency and Perceptual Quality Assessment of 3D Meshes

2018 ◽  
pp. 38-115
Author(s):  
Anass Nouri ◽  
Christophe Charrier ◽  
Olivier Lezoray
Keyword(s):  
Quality Assessment ◽  
State Of The Art ◽  
Saliency Detection ◽  
Visual Saliency ◽  
Ground Truth ◽  
The State ◽  
Perceptual Quality ◽  
Adaptive Smoothing ◽  
Definition Of ◽  
Mesh Database

This chapter concerns the visual saliency and the perceptual quality assessment of 3D meshes. Firstly, the chapter proposes a definition of visual saliency and describes the state-of-the-art methods for its detection on 3D mesh surfaces. A focus is made on a recent model of visual saliency detection for 3D colored and non-colored meshes whose results are compared with a ground-truth saliency as well as with the literature's methods. Since this model is able to estimate the visual saliency on 3D colored meshes, named colorimetric saliency, a description of the construction of a 3D colored mesh database that was used to assess its relevance is presented. The authors also describe three applications of the detailed model that respond to the problems of viewpoint selection, adaptive simplification and adaptive smoothing. Secondly, two perceptual quality assessment metrics for 3D non-colored meshes are described, analyzed, and compared with the state-of-the-art approaches.

Developing the State-of-the-Art Space Suit

2020 ◽  
pp. 15-34
Author(s):  
Bill Ayrey
Keyword(s):  
High Altitude ◽  
Air Force ◽  
State Of The Art ◽  
The State ◽  
Space Suit ◽  
Definition Of

What is the definition of a space suit? This chapter explains and chronicles the development of the model XMC2-ILC pressure suit for the early U.S. Air Force high-altitude aircraft.

scholarly journals Action-Centered Information Retrieval

2019 ◽  
Vol 20 (2) ◽  
pp. 249-272
Author(s):  
MARCELLO BALDUCCINI ◽  
EMILY C. LEBLANC
Keyword(s):  
Information Retrieval ◽  
Side Effects ◽  
Answer Set Programming ◽  
The State ◽  
Semantic Level ◽  
Action Language ◽  
The World ◽  
Answer Set

AbstractInformation retrieval (IR) aims at retrieving documents that are most relevant to a query provided by a user. Traditional techniques rely mostly on syntactic methods. In some cases, however, links at a deeper semantic level must be considered. In this paper, we explore a type of IR task in which documents describe sequences of events, and queries are about the state of the world after such events. In this context, successfully matching documents and query requires considering the events’ possibly implicit uncertain effects and side effects. We begin by analyzing the problem, then propose an action language-based formalization, and finally automate the corresponding IR task using answer set programming.

scholarly journals Advancing Lazy-Grounding ASP Solving Techniques – Restarts, Phase Saving, Heuristics, and More

2020 ◽  
Vol 20 (5) ◽  
pp. 609-624
Author(s):  
ANTONIUS WEINZIERL ◽  
RICHARD TAUPE ◽  
GERHARD FRIEDRICH
Keyword(s):  
Knowledge Representation ◽  
State Of The Art ◽  
Answer Set Programming ◽  
Negative Effects ◽  
First Time ◽  
Domain Independent ◽  
Large Improvement ◽  
Answer Set ◽  
Art Techniques

AbstractAnswer-Set Programming (ASP) is a powerful and expressive knowledge representation paradigm with a significant number of applications in logic-based AI. The traditional ground-and-solve approach, however, requires ASP programs to be grounded upfront and thus suffers from the so-called grounding bottleneck (i.e., ASP programs easily exhaust all available memory and thus become unsolvable). As a remedy, lazy-grounding ASP solvers have been developed, but many state-of-the-art techniques for grounded ASP solving have not been available to them yet. In this work we present, for the first time, adaptions to the lazy-grounding setting for many important techniques, like restarts, phase saving, domain-independent heuristics, and learned-clause deletion. Furthermore, we investigate their effects and in general observe a large improvement in solving capabilities and also uncover negative effects in certain cases, indicating the need for portfolio solving as known from other solvers.

12. PIDGINS AND CREOLES AS MODELS OF LANGUAGE CHANGE: THE STATE OF THE ART

2003 ◽  
Vol 23 ◽  
pp. 202-212 ◽  
Author(s):  
John H. McWhorter
Keyword(s):  
Language Change ◽  
State Of The Art ◽  
The State ◽  
Generative Syntax ◽  
Distinct Process ◽  
Definition Of ◽  
Creole English

The interface between creole studies and language change has been a tumultuous area since the late 1990s. Evidence has been found confirming that children created Hawaiian Creole English; the “decreolization” approach to the creole continuum has become largely obsolete; work on creoles and grammaticalization has expanded beyond its former concentration on Tok Pisin; creolists working within the generative syntax tradition have questioned whether creolization is a distinct process at all; other work argues that creoles are synchronically as well as sociohistorically definable; and the very centrality of plantation contexts' sociology to creole genesis has been questioned. Concepts often taken as assumptions ten years ago are now widely questioned, even the very definition of creole itself.

scholarly journals Complex optimization in answer set programming

2011 ◽  
Vol 11 (4-5) ◽  
pp. 821-839 ◽  
Author(s):  
MARTIN GEBSER ◽  
ROLAND KAMINSKI ◽  
TORSTEN SCHAUB
Keyword(s):  
Computational Complexity ◽  
Answer Set Programming ◽  
Pareto Efficiency ◽  
Modeling Techniques ◽  
Complex Optimization ◽  
Answer Sets ◽  
Implementation Technique ◽  
Preference Handling ◽  
Answer Set ◽  
Qualitative Preferences

AbstractPreference handling and optimization are indispensable means for addressing nontrivial applications in Answer Set Programming (ASP). However, their implementation becomes difficult whenever they bring about a significant increase in computational complexity. As a consequence, existing ASP systems do not offer complex optimization capacities, supporting, for instance, inclusion-based minimization or Pareto efficiency. Rather, such complex criteria are typically addressed by resorting to dedicated modeling techniques, likesaturation. Unlike the ease of common ASP modeling, however, these techniques are rather involved and hardly usable by ASP laymen. We address this problem by developing a general implementation technique by means of meta-prpogramming, thus reusing existing ASP systems to capture various forms of qualitative preferences among answer sets. In this way, complex preferences and optimization capacities become readily available for ASP applications.

Sign in / Sign up

Export Citation Format

Share Document