A Case for Query-driven Predicate Answer Set Programming

5 pages•Published: November 8, 2017

Gopal Gupta, Elmer Salazar, Kyle Marple, Zhuo Chen and Farhad Shakerin

Abstract

Answer Set Programming (ASP) has emerged as a successful paradigm for developing intelligent applications. ASP is based on adding negation as failure to logic programming under the stable model semantics regime. ASP allows for sophisticated reasoning mechanisms that are employed by humans to be modeled elegantly. We argue that being able to model common sense reasoning as used by humans is critical for success of automated reasoning. We also argue that extending answer programming systems to general predicates is critical to realizing the full power of ASP. Goal-directed predicate ASP systems are needed to make the ASP technology practical for building large, scalable knowledge-based applications.

Keyphrases: answer set programming, predicate asp, usable automated reasoning

In: Giles Reger and Dmitriy Traytel (editors). ARCADE 2017. 1st International Workshop on Automated Reasoning: Challenges, Applications, Directions, Exemplary Achievements, vol 51, pages 64-68.

Links:	https://easychair.org/publications/paper/GbHL
	https://doi.org/10.29007/ngm2

BibTeX entry

@inproceedings{ARCADE2017:Case_Query_driven_Predicate,
  author    = {Gopal Gupta and Elmer Salazar and Kyle Marple and Zhuo Chen and Farhad Shakerin},
  title     = {A Case for Query-driven Predicate Answer Set Programming},
  booktitle = {ARCADE 2017. 1st International Workshop on Automated Reasoning: Challenges, Applications, Directions, Exemplary Achievements},
  editor    = {Giles Reger and Dmitriy Traytel},
  series    = {EPiC Series in Computing},
  volume    = {51},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/GbHL},
  doi       = {10.29007/ngm2},
  pages     = {64-68},
  year      = {2017}}

Download PDF Open PDF in browser