Systems, Engineering Environments, and Competitions

AI Magazine ◽  
2016 ◽  
Vol 37 (3) ◽  
pp. 45-52 ◽  
Author(s):  
Yuliya Lierler ◽  
Marco Maratea ◽  
Francesco Ricca
Keyword(s):  
Systems Engineering ◽  
Answer Set Programming ◽  
Practical Applications ◽  
Development Tools ◽  
History Of ◽  
Answer Set

The goal of this article is threefold. First, we trace the history of the development of answer set solvers, by accounting for more than a dozen of them. Second, we discuss development tools and environments that facilitate the use of answer set programming technology in practical applications. Last, we present the evolution of the answer set programming competitions, prime venues for tracking advances in answer set solving technology.

scholarly journals Modal Logic S5 Satisfiability in Answer Set Programming

2021 ◽  
Vol 21 (5) ◽  
pp. 527-542
Author(s):  
MARIO ALVIANO ◽  
SOTIRIS BATSAKIS ◽  
GEORGE BARYANNIS
Keyword(s):  
Modal Logic ◽  
Possible Worlds ◽  
Answer Set Programming ◽  
Practical Applications ◽  
Simplified Approach ◽  
Modal Operators ◽  
Comparable Performance ◽  
Entailment Relations ◽  
Significant Attention ◽  
Answer Set

AbstractModal logic S5 has attracted significant attention and has led to several practical applications, owing to its simplified approach to dealing with nesting modal operators. Efficient implementations for evaluating satisfiability of S5 formulas commonly rely on Skolemisation to convert them into propositional logic formulas, essentially by introducing copies of propositional atoms for each set of interpretations (possible worlds). This approach is simple, but often results into large formulas that are too difficult to process, and therefore more parsimonious constructions are required. In this work, we propose to use Answer Set Programming for implementing such constructions, and in particular for identifying the propositional atoms that are relevant in every world by means of a reachability relation. The proposed encodings are designed to take advantage of other properties such as entailment relations of subformulas rooted by modal operators. An empirical assessment of the proposed encodings shows that the reachability relation is very effective and leads to comparable performance to a state-of-the-art S5 solver based on SAT, while entailment relations are possibly too expensive to reason about and may result in overhead.

scholarly journals Evaluation Techniques and Systems for Answer Set Programming: a Survey

2018 ◽  
Author(s):  
Martin Gebser ◽  
Nicola Leone ◽  
Marco Maratea ◽  
Simona Perri ◽  
Francesco Ricca ◽  
...  
Keyword(s):  
Knowledge Representation ◽  
Answer Set Programming ◽  
Knowledge Representation And Reasoning ◽  
Modeling Language ◽  
Scientific Applications ◽  
Two Factors ◽  
History Of ◽  
Evaluation Techniques ◽  
Answer Set

Answer set programming (ASP) is a prominent knowledge representation and reasoning paradigm that found both industrial and scientific applications. The success of ASP is due to the combination of two factors: a rich modeling language and the availability of efficient ASP implementations. In this paper we trace the history of ASP systems, describing the key evaluation techniques and their implementation in actual tools.

scholarly journals A Trajectory Calculus for Qualitative Spatial Reasoning Using Answer Set Programming

2018 ◽  
Vol 18 (3-4) ◽  
pp. 355-371 ◽  
Author(s):  
GEORGE BARYANNIS ◽  
ILIAS TACHMAZIDIS ◽  
SOTIRIS BATSAKIS ◽  
GRIGORIS ANTONIOU ◽  
MARIO ALVIANO ◽  
...  
Keyword(s):  
Natural Language ◽  
Real World ◽  
Moving Objects ◽  
Spatial Reasoning ◽  
Spatial Information ◽  
Scale Up ◽  
Answer Set Programming ◽  
Qualitative Spatial Reasoning ◽  
Practical Applications ◽  
Answer Set

AbstractSpatial information is often expressed using qualitative terms such as natural language expressions instead of coordinates; reasoning over such terms has several practical applications, such as bus routes planning. Representing and reasoning on trajectories is a specific case of qualitative spatial reasoning that focuses on moving objects and their paths. In this work, we propose two versions of a trajectory calculus based on the allowed properties over trajectories, where trajectories are defined as a sequence of non-overlapping regions of a partitioned map. More specifically, if a given trajectory is allowed to start and finish at the same region, 6 base relations are defined (TC-6). If a given trajectory should have different start and finish regions but cycles are allowed within, 10 base relations are defined (TC-10). Both versions of the calculus are implemented as ASP programs; we propose several different encodings, including a generalised program capable of encoding any qualitative calculus in ASP. All proposed encodings are experimentally evaluated using a real-world dataset. Experiment results show that the best performing implementation can scale up to an input of 250 trajectories for TC-6 and 150 trajectories for TC-10 for the problem of discovering a consistent configuration, a significant improvement compared to previous ASP implementations for similar qualitative spatial and temporal calculi.

scholarly journals Generalized Target Assignment and Path Finding Using Answer Set Programming

2017 ◽  
Author(s):  
Van Nguyen ◽  
Philipp Obermeier ◽  
Tran Cao Son ◽  
Torsten Schaub ◽  
William Yeoh
Keyword(s):  
Scale Up ◽  
Answer Set Programming ◽  
Specific Information ◽  
Path Finding ◽  
Practical Applications ◽  
Target Assignment ◽  
Specific Order ◽  
Multi Agent ◽  
Unequal Number ◽  
Answer Set

In Multi-Agent Path Finding (MAPF), a team of agents needs to find collision-free paths from their starting locations to their respective targets. Combined Target Assignment and Path Finding (TAPF) extends MAPF by including the problem of assigning targets to agents as a precursor to the MAPF problem. A limitation of both models is their assumption that the number of agents and targets are equal, which is invalid in some applications such as autonomous warehouse systems. We address this limitation by generalizing TAPF to allow for (1)~unequal number of agents and tasks; (2)~tasks to have deadlines by which they must be completed; (3)~ordering of groups of tasks to be completed; and (4)~tasks that are composed of a sequence of checkpoints that must be visited in a specific order. Further, we model the problem using answer set programming (ASP) to show that customizing the desired variant of the problem is simple one only needs to choose the appropriate combination of ASP rules to enforce it. We also demonstrate experimentally that if problem specific information can be incorporated into the ASP encoding then ASP based method can be efficient and can scale up to solve practical applications.

Animal Pain Scales in Public Policy

1990 ◽  
Vol 18 (1_part_1) ◽  
pp. 41-50
Author(s):  
F. Barbara Orlans
Keyword(s):  
Public Policy ◽  
Animal Welfare ◽  
The United States ◽  
Pain Scale ◽  
Laboratory Animals ◽  
Practical Applications ◽  
Animal Pain ◽  
Pain Scales ◽  
History Of ◽  
And Control

Pain scales classify the severity of pain inflicted on laboratory animals from little or none up to severe. A pain scale as part of public policy serves beneficial purposes that promote animal welfare. It can be used to educate people about the two alternatives of refinement and replacement, and the need to reduce animal pain. Furthermore, a pain scale has practical applications: 1) in review procedures for animal welfare concerns; 2) in developing policies on the use of animals in education; and 3) as a basis for collecting national data on animal experimentation, so that meaningful data can be collected on trends in reduction and control in animal pain. So far, only a few countries (including Sweden, the Netherlands, Canada and New Zealand) have adopted pain scales as part of their public policy. Most countries, including the United States, have not yet done so. The history of the development and adoption of pain scales by various countries is described and the case is presented for wider adoption of a pain scale in countries not currently using one.

scholarly journals Open answer set programming with guarded programs

2008 ◽  
Vol 9 (4) ◽  
pp. 1-53 ◽  
Author(s):  
Stijn Heymans ◽  
Davy Van Nieuwenborgh ◽  
Dirk Vermeir
Keyword(s):  
Answer Set Programming ◽  
Answer Set
Sign in / Sign up

Export Citation Format

Share Document