On the Relation Between Answer Set and SAT Procedures (or, Between cmodels and smodels)

2005 ◽  
pp. 37-51 ◽  
Author(s):  
Enrico Giunchiglia ◽  
Marco Maratea
Keyword(s):  
Answer Set

Paracoherent answer set computation

2021 ◽  
pp. 103519
Author(s):  
Giovanni Amendola ◽  
Carmine Dodaro ◽  
Wolfgang Faber ◽  
Francesco Ricca
Keyword(s):  
Answer Set

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

scholarly journals Splitting Computation of Answer Set Program and Its Application on E-service

2011 ◽  
Vol 4 (5) ◽  
pp. 977-990
Author(s):  
Bo Yang ◽  
Ying Zhang ◽  
Mingyi Zhang ◽  
Maonian Wu
Keyword(s):  
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.

scholarly journals Incremental and Iterative Learning of Answer Set Programs from Mutually Distinct Examples

2018 ◽  
Vol 18 (3-4) ◽  
pp. 623-637 ◽  
Author(s):  
ARINDAM MITRA ◽  
CHITTA BARAL
Keyword(s):  
Machine Learning ◽  
Learning Community ◽  
Question Answering ◽  
Learning Algorithms ◽  
Inductive Logic ◽  
Opportunity To Learn ◽  
Machine Learning Algorithms ◽  
Knowledge Representation And Reasoning ◽  
Handwritten Digit ◽  
Answer Set

AbstractOver the years the Artificial Intelligence (AI) community has produced several datasets which have given the machine learning algorithms the opportunity to learn various skills across various domains. However, a subclass of these machine learning algorithms that aimed at learning logic programs, namely the Inductive Logic Programming algorithms, have often failed at the task due to the vastness of these datasets. This has impacted the usability of knowledge representation and reasoning techniques in the development of AI systems. In this research, we try to address this scalability issue for the algorithms that learn answer set programs. We present a sound and complete algorithm which takes the input in a slightly different manner and performs an efficient and more user controlled search for a solution. We show via experiments that our algorithm can learn from two popular datasets from machine learning community, namely bAbl (a question answering dataset) and MNIST (a dataset for handwritten digit recognition), which to the best of our knowledge was not previously possible. The system is publicly available athttps://goo.gl/KdWAcV.

Improving the Normalization of Weight Rules in Answer Set Programs

2014 ◽  
pp. 166-180 ◽  
Author(s):  
Jori Bomanson ◽  
Martin Gebser ◽  
Tomi Janhunen
Keyword(s):  
Answer Set
Sign in / Sign up

Export Citation Format

Share Document