HEX Programs with Action Atoms

Basol, Selen; Erdem, Ozan; Fink, Michael; Ianni, Giovambattista

doi:10.4230/lipics.iclp.2010.24

Cited by 3 publications

(2 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A second promising ASP extension like HEX [1] provides the possibility of a bidirectional access to external sources of knowledge and/or computation using the concept of external atoms; the extension ActHEX [14] of HEX programs introduces the notion of action atoms, which are associated to corresponding functions capable of actually changing the state of external environments. Using this ASP extension it is in practice possible to realize artificial agents able to operate in many different settings (for instance, an HEX extension has been successfully used for implementing an AI agent operating in video-games scenarios as described in [7]).…”

Section: Goal Of the Researchmentioning

confidence: 99%

See 1 more Smart Citation

Reasoning in Highly Reactive Environments

Pacenza

2019

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

Section: Goal Of the Researchmentioning

confidence: 99%

“…In order to achieve our goal, we started to investigate the literature [1,3,4,7,14,15,17,19,21,22]. Then, we focused our research on artificial agents for video-games (also called "bots").…”

Section: First Yearmentioning

confidence: 99%

Reasoning in Highly Reactive Environments

Pacenza

2019

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

Efficient HEX-Program Evaluation Based on Unfounded Sets

Eiter

Fink

Krennwallner

et al. 2014

jair

View full text Add to dashboard Cite

HEX-programs extend logic programs under the answer set semantics with external computations through external atoms. As reasoning from ground Horn programs with nonmonotonic external atoms of polynomial complexity is already on the second level of the polynomial hierarchy, minimality checking of answer set candidates needs special attention. To this end, we present an approach based on unfounded sets as a generalization of related techniques for ASP programs. The unfounded set detection is expressed as a propositional SAT problem, for which we provide two different encodings and optimizations to them. We then integrate our approach into a previously developed evaluation framework for HEX-programs, which is enriched by additional learning techniques that aim at avoiding the reconstruction of the same or related unfounded sets. Furthermore, we provide a syntactic criterion that allows one to skip the minimality check in many cases. An experimental evaluation shows that the new approach significantly decreases runtime.

show abstract

Answer Set Programming with External Sources

Redl

2012

View full text Add to dashboard Cite

HEX Programs with Action Atoms

Cited by 3 publications

References 17 publications

Reasoning in Highly Reactive Environments

Reasoning in Highly Reactive Environments

Efficient HEX-Program Evaluation Based on Unfounded Sets

Answer Set Programming with External Sources

Contact Info

Product

Resources

About