Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 3,214 papers for “Answer set programming”

Functional Answer Set Programming

Pedro Cabalar · arXiv (Cornell University) · 2010

In this paper we propose an extension of Answer Set Programming (ASP), and in particular, of its most general logical counterpart, Quantified Equilibrium Logic (QEL), to deal with partial functions. Although the treatment of equality in QEL can be established in different ways, we first analyse the choice of decidable equality with complete functions and Herbrand models, recently proposed in the literature. We argue that this choice yields some counterintuitive effects from a logic programming and knowledge representation point of view. We then propose a variant called QELF where the set of functions is partitioned into partial and Herbrand functions (we also call constructors). In the rest of the paper, we show a direct connection to Scott's Logic of Existence and present a practical application, proposing an extension of normal logic programs to deal with partial functions and equality, so that they can be translated into function-free normal programs, being possible in this way to compute their answer sets with any standard ASP solver.

Cited by 2Open access

Sketched Answer Set Programming

Sergey Paramonov, Christian Bessière, Anton Dries et al. · Lirias (KU Leuven) · 2018

Answer Set Programming (ASP) is a powerful modeling formalism for combinatorial problems. However, writing ASP models can be hard. We propose a novel method, called Sketched Answer Set Programming (SkASP), aimed at facilitating this. In SkASP, the user writes partial ASP programs, in which uncertain parts are left open and marked with question marks. In addition, the user provides a number of positive and negative examples of the desired program behaviour. SkASP then synthesises a complete ASP program. This is realized by rewriting the SkASP program into another ASP program, which can then be solved by traditional ASP solvers. We evaluate our approach on 21 well known puzzles and combinatorial problems inspired by Karp's 21 NP-complete problems and on publicly available ASP encodings.

Cited by 0Open access

Temporal Answer Set Programming

Tesis Doctorals en Xarxa (Consorci de Serveis Universitaris de Catalunya)

Even though my name appears on the cover of this book, this thesis would not have been possible without the contributions of many people who deserve my infinite gratitude.First of all, I would like to

Cited by 0Open access

Probabilistic Answer Set Programming

Eduardo Christiano Caregnatto de Morais · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) · 2012

Este trabalho introduz uma técnica chamada Answer Set Programming Probabilístico (PASP), que permite a modelagem de teorias complexas e a verificação de sua consistência em relação a um conjunto de dados estatísticos. Propomos métodos de resolução baseados em uma redução para o problema da satisfazibilidade probabilística (PSAT) e um método de redução de Turing ao ASP.

Cited by 0

Stable Answer Set Programming

Mona Gharib, Amr I. Hassan Amr I. Hassan · Indian Journal Of Applied Research · 2011

IJAR - Indian Journal of Applied Research (IJAR) IJAR is a double reviewed monthly print journal that accepts research works from scholars, academicians, professors, doctorates, lecturers, and corporate in their respective expertise of studies.

Cited by 0

Parallel Answer Set Programming

Formisano, Andrea, Dovier, Agostino, Pontelli, Enrico · Institutional Research Information System (University of Udine) · 2021

Cited by 0

Temporal Answer Set Programming

Diéguez Lodeiro, Martín · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) · 2015

[Abstract]\n\t\t\t\t Commonsense temporal reasoning is full of situations that require drawing default conclusions, since we rarely have all the information available. Unfortunately,\n\t\t\t\t most modal temporal logics cannot accommodate default reasoning, since they typically deal with a monotonic inference relation. On the other hand, non-monotonic approaches are very expensive and their treatment of time is not so well delimited and studied as in modal logic.\n\t\t\t\t Temporal Equilibrium Logic (TEL) is the first non-monotonic temporal logic\n\t\t\t\t which fully covers the syntax of some standard modal temporal approach\n\t\t\t\t without requiring further constructions. TEL shares the syntax of Linear-time\n\t\t\t\t Temporal Logic (LTL) (first proposed by Arthur Prior and later extended by\n\t\t\t\t Hans Kamp) which has become one of the simplest, most used and best known\n\t\t\t\t temporal logics in Theoretical Computer Science.\n\t\t\t\t Although TEL had been already defined, few results were known about its fundamental properties and nothing at all on potential computational methods that could be applied for practical purposes. This situation unfavourably contrasted with the huge body of knowledge available for LTL, both in well-known formal properties and in computing methods with practical implementations.\n\t\t\t\t In this thesis we have mostly filled this gap, following a research program that\n\t\t\t\t has systematically analysed different essential properties of TEL and, simultaneously, built computational tools for its practical application. As an overall, this thesis collects a corpus of results that constitutes a significant breakthrough in the knowledge about TEL.

Cited by 0

Annotated Answer Set Programming

Umberto Straccia · 2006

We present Annotated Answer Set Programming, that extends the expressive power of disjunctive logic programming with annotation terms, taken from the general-ized annotated logic programming framework.

Cited by 28

Answer set programming probabilístico

Eduardo Menezes de Morais · Americanae (AECID Library) · 2012

Este trabalho introduz uma técnica chamada Answer Set Programming Probabilístico (PASP), que permite a modelagem de teorias complexas e a verificação de sua consistência em relação a um conjunto de dados estatísticos. Propomos métodos de resolução baseados em uma redução para o problema da satisfazibilidade probabilística (PSAT) e um método de redução de Turing ao ASP.

Cited by 0Open access

Functional answer set programming

Pedro Cabalar · Theory and Practice of Logic Programming · 2011

Abstract In this paper we propose an extension of Answer Set Programming (ASP) to deal with (possibly partial) evaluable functions. To this aim, we start from the most general logical counterpart of ASP, Quantified Equilibrium Logic (QEL), and propose a variant QEL = ℱ where the set of functions is partitioned into Herbrand functions (or constructors ) and evaluable functions (or operations ). We show how this extension has a direct connection to Scott's Logic of Existence , and introduce several useful derived operators, some of them directly borrowed from Scott's formalisation. Using this general framework for arbitrary theories, we proceed to focus on a syntactic subclass that corresponds to normal logic programs with evaluable functions and equality. We provide a translation of this class into function-free normal programs and consider a safety condition so that the resulting program is also safe, under the usual meaning in ASP. Finally, we also establish a formal comparison to Lin and Wang's approach (FASP) dealing with evaluable total functions.

Cited by 34

Monotonic Answer Set Programming

Martin Gebser, Mona Gharib, Robert E. Mercer et al. · Journal of Logic and Computation · 2008

Answer set programming (ASP) does not allow for incrementally constructing answer sets or locally validating constructions like proofs by only looking at a part of the given program. In this article, we elaborate upon an alternative approach to ASP that allows for incremental constructions. Our approach draws its basic intuitions from the area of default logics. We investigate the feasibility of the concept of semi-monotonicity known from default logics as a basis of incrementality. On the one hand, every logic program has at least one answer set in our alternative setting, which moreover can be constructed incrementally based on generating rules. On the other hand, the approach may produce answer sets lacking characteristic properties of standard answer sets, such as being a model of the given program. We show how integrity constraints can be used to re-establish such properties, even up to correspondence with standard answer sets. Furthermore, we develop an SLD-like proof procedure for our incremental approach to ASP, which allows for query-oriented computations. Also, we provide a characterization of our definition of answer sets via a modification of Clark's completion. Based on this notion of program completion, we present an algorithm for computing the answer sets of a logic program in our approach.

Cited by 14

Answer set programming probabilístico

Eduardo Menezes de Morais · 2012

\n Este trabalho introduz uma técnica chamada Answer Set Programming Probabilístico (PASP), que permite a modelagem de teorias complexas e a verificação de sua consistência em relação a um conjunto de dados estatísticos. Propomos métodos de resolução baseados em uma redução para o problema da satisfazibilidade probabilística (PSAT) e um método de redução de Turing ao ASP.\n

Cited by 0Open access