Work

Towards Quantified Answer Set Programming.

Year: 2018

Type: conference-paper

Abstract: This paper proposes an extension of Answer Set Programming (ASP) with quantifiers called Quantified ASP (QASP).This proposal is somehow inspired to the extension of SAT formulas in Quantified Boolean Formulas (QBF).The resulting language is more expressive than plain ASP (which remains a subclass of QASP), and allows modeling problems belonging to any level of the polynomial hierarchy.

Source: Archive of Doctoral Theses and Digital Collections (University of Calabria)

Author: Giovanni Amendola

Language: English

Topic: Logic, Reasoning, and Knowledge

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2908433935

FWCI: 0.177

Cites: 27

Cited by: 2

Related to: 10