Answer Set Programming: Language, Applications and Development Tools

2013 ◽  
pp. 19-34 ◽  
Author(s):  
Giovanni Grasso ◽  
Nicola Leone ◽  
Francesco Ricca
Keyword(s):  
Programming Language ◽  
Answer Set Programming ◽  
Development Tools ◽  
Answer Set

scholarly journals Here and There with Arithmetic

2021 ◽  
pp. 1-15
Author(s):  
VLADIMIR LIFSCHITZ
Keyword(s):  
Programming Language ◽  
Propositional Logic ◽  
Answer Set Programming ◽  
The Other ◽  
Arithmetic Operations ◽  
First Order ◽  
The Relationship ◽  
Answer Set

Abstarct In the theory of answer set programming, two groups of rules are called strongly equivalent if, informally speaking, they have the same meaning in any context. The relationship between strong equivalence and the propositional logic of here-and-there allows us to establish strong equivalence by deriving rules of each group from rules of the other. In the process, rules are rewritten as propositional formulas. We extend this method of proving strong equivalence to an answer set programming language that includes operations on integers. The formula representing a rule in this language is a first-order formula that may contain comparison symbols among its predicate constants, and symbols for arithmetic operations among its function constants. The paper is under consideration for acceptance in TPLP.

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 Relating Multi-Adjoint Normal Logic Programs to Core Fuzzy Answer Set Programs from a Semantical Approach

Mathematics ◽  
2020 ◽  
Vol 8 (6) ◽  
pp. 881
Author(s):  
M. Eugenia Cornejo ◽  
David Lobo ◽  
Jesús Medina
Keyword(s):  
Fuzzy Logic ◽  
Logic Programming ◽  
Programming Language ◽  
Answer Set Programming ◽  
Logic Programs ◽  
The Core ◽  
Normal Logic ◽  
Answer Sets ◽  
Stable Models ◽  
Answer Set

This paper relates two interesting paradigms in fuzzy logic programming from a semantical approach: core fuzzy answer set programming and multi-adjoint normal logic programming. Specifically, it is shown how core fuzzy answer set programs can be translated into multi-adjoint normal logic programs and vice versa, preserving the semantics of the starting program. This translation allows us to combine the expressiveness of multi-adjoint normal logic programming with the compactness and simplicity of the core fuzzy answer set programming language. As a consequence, theoretical properties and results which relate the answer sets to the stable models of the respective logic programming frameworks are obtained. Among others, this study enables the application of the existence theorem of stable models developed for multi-adjoint normal logic programs to ensure the existence of answer sets in core fuzzy answer set programs.

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

Answer set programming for collaborative housekeeping robotics: representation, reasoning, and execution

2012 ◽  
Vol 5 (4) ◽  
pp. 275-291 ◽  
Author(s):  
Esra Erdem ◽  
Erdi Aker ◽  
Volkan Patoglu
Keyword(s):  
Answer Set Programming ◽  
Answer Set

scholarly journals Exhaustively characterizing feasible logic models of a signaling network using Answer Set Programming

2013 ◽  
Vol 29 (18) ◽  
pp. 2320-2326 ◽  
Author(s):  
Carito Guziolowski ◽  
Santiago Videla ◽  
Federica Eduati ◽  
Sven Thiele ◽  
Thomas Cokelaer ◽  
...  
Keyword(s):  
Answer Set Programming ◽  
Signaling Network ◽  
Logic Models ◽  
Answer Set

CoreALMlib: An library translated from the Component Library

2016 ◽  
Vol 16 (5-6) ◽  
pp. 800-816 ◽  
Author(s):  
DANIELA INCLEZAN
Keyword(s):  
Natural Language ◽  
Answer Set Programming ◽  
Natural Language Understanding ◽  
Inference Engine ◽  
Lexical Resources ◽  
Language Understanding ◽  
Commonsense Knowledge ◽  
Component Library ◽  
Action Language ◽  
Answer Set

AbstractThis paper presents CoreALMlib, an $\mathscr{ALM}$ library of commonsense knowledge about dynamic domains. The library was obtained by translating part of the Component Library (CLib) into the modular action language $\mathscr{ALM}$. CLib consists of general reusable and composable commonsense concepts, selected based on a thorough study of ontological and lexical resources. Our translation targets CLibstates (i.e., fluents) and actions. The resulting $\mathscr{ALM}$ library contains the descriptions of 123 action classes grouped into 43 reusable modules that are organized into a hierarchy. It is made available online and of interest to researchers in the action language, answer-set programming, and natural language understanding communities. We believe that our translation has two main advantages over its CLib counterpart: (i) it specifies axioms about actions in a more elaboration tolerant and readable way, and (ii) it can be seamlessly integrated with ASP reasoning algorithms (e.g., for planning and postdiction). In contrast, axioms are described in CLib using STRIPS-like operators, and CLib's inference engine cannot handle planning nor postdiction.

Sign in / Sign up

Export Citation Format

Share Document