An Approach Based on Predicate Correlation to the Reduction of Plethoric Answer Sets

2012 ◽  
pp. 213-233 ◽  
Author(s):  
Patrick Bosc ◽  
Allel Hadjali ◽  
Olivier Pivert ◽  
Grégory Smits
Keyword(s):  
Answer Sets

A Semantic Perspective on Omission Abstraction in ASP

2020 ◽  
Author(s):  
Zeynep G. Saribatur ◽  
Thomas Eiter
Keyword(s):  
Problem Solving ◽  
Program Analysis ◽  
Abstract Level ◽  
Answer Sets

The recently introduced notion of ASP abstraction is on reducing the vocabulary of a program while ensuring over-approximation of its answer sets, with a focus on having a syntactic operator that constructs an abstract program. It has been shown that such a notion has the potential for program analysis at the abstract level by getting rid of irrelevant details to problem solving while preserving the structure, that aids in the explanation of the solutions. We take here a further look on ASP abstraction, focusing on abstraction by omission with the aim to obtain a better understanding of the notion. We distinguish the key conditions for omission abstraction which sheds light on the differences to the well-studied notion of forgetting. We demonstrate how omission abstraction fits into the overall spectrum, by also investigating its behavior in the semantics of a program in the framework of HT logic.

Modular Paracoherent Answer Sets

2014 ◽  
pp. 457-471 ◽  
Author(s):  
Giovanni Amendola ◽  
Thomas Eiter ◽  
Nicola Leone
Keyword(s):  
Answer Sets

scholarly journals Grounding and Solving in Answer Set Programming

AI Magazine ◽  
2016 ◽  
Vol 37 (3) ◽  
pp. 25-32 ◽  
Author(s):  
Benjamin Kaufmann ◽  
Nicola Leone ◽  
Simona Perri ◽  
Torsten Schaub
Keyword(s):  
Problem Solving ◽  
Propositional Logic ◽  
Logic Program ◽  
Answer Set Programming ◽  
Key Issues ◽  
Answer Sets ◽  
Answer Set

Answer set programming is a declarative problem solving paradigm that rests upon a workflow involving modeling, grounding, and solving. While the former is described by Gebser and Schaub (2016), we focus here on key issues in grounding, or how to systematically replace object variables by ground terms in a effective way, and solving, or how to compute the answer sets of a propositional logic program obtained by grounding.

Routley Semantics for Answer Sets

2005 ◽  
pp. 343-355 ◽  
Author(s):  
Sergei Odintsov ◽  
David Pearce
Keyword(s):  
Answer Sets

Answer Sets in a Fuzzy Equilibrium Logic

2009 ◽  
pp. 135-149 ◽  
Author(s):  
Steven Schockaert ◽  
Jeroen Janssen ◽  
Dirk Vermeir ◽  
Martine De Cock
Keyword(s):  
Answer Sets

Multi-user Input in Determining Answer Sets (MIDAS)

2018 ◽  
Author(s):  
Albert Kalim ◽  
Jane Huffman Hayes ◽  
Satrio Husodo ◽  
Erin Combs ◽  
Jared Payne
Keyword(s):  
User Input ◽  
Answer Sets
Sign in / Sign up

Export Citation Format

Share Document