s(CASP) for SWI-prolog

Jan Wielemaker; Joaquín Arias; Gopal Gupta

s(CASP) for SWI-prolog

Jan Wielemaker^*
, Joaquín Arias
, Gopal Gupta

^*Corresponding author for this work

Research output: Chapter in Book / Report / Conference proceeding › Conference contribution › Academic › peer-review

Abstract

s(CASP) is related to ASP. Unlike ASP, which is traditionally solved using grounding and a SAT solver, s(CASP) is solved using top-down goal directed search without grounding. This allows s(CASP) to solve problems that cannot be grounded, while the generated proof tree is a good basis for giving a justification for the answer. s(CASP) supports both negation as failure (NAF) and classical negation. These features make s(CASP) particularly suitable for commonsense reasoning tasks that require a justification of the answer. Currently, scasp is an executable generated using Ciao. We ported s(CASP) to SWI-Prolog. The primary aim of this is to provide s(CASP) as a library that allows for embedding and managing multiple s(CASP) programs from multiple threads. Here, ‘Managing’ means being able to construct and modify an s(CASP) program dynamically and dynamically run queries against s(CASP) programs.

Original language	English
Title of host publication	ICLP Workshops 2021 International Conference on Logic Programming 2021 Workshops
Subtitle of host publication	Proceedings of the International Conference on Logic Programming 2021 Workshops co-located with the 37th International Conference on Logic Programming (ICLP 2021) Porto, Portugal (virtual), September 20th-21st, 2021
Editors	Joaquin Arias
Publisher	CEUR Workshop Proceedings
Number of pages	5
Publication status	Published - 2021
Event	2021 International Conference on Logic Programming Workshops, ICLP Workshops 2021 - Virtual, Porto, Portugal Duration: 20 Sept 2021 → 21 Sept 2021

Publication series

Name	CEUR Workshop Proceedings
Publisher	CEUR Workshop Proceedings
Volume	2970
ISSN (Print)	1613-0073

Conference

Conference	2021 International Conference on Logic Programming Workshops, ICLP Workshops 2021
Country/Territory	Portugal
City	Virtual, Porto
Period	20/09/21 → 21/09/21

Bibliographical note

Publisher Copyright:
© 2021 CEUR-WS. All rights reserved.

Keywords

Answer set programming
Multi-paradigm
Prolog
S(CASP)

Access to Document

http://ceur-ws.org/Vol-2970/gdeinvited4.pdf

Persistent URL (handle)

Persistent link

Cite this

Wielemaker, J., Arias, J., & Gupta, G. (2021). s(CASP) for SWI-prolog. In J. Arias (Ed.), ICLP Workshops 2021 International Conference on Logic Programming 2021 Workshops: Proceedings of the International Conference on Logic Programming 2021 Workshops co-located with the 37th International Conference on Logic Programming (ICLP 2021) Porto, Portugal (virtual), September 20th-21st, 2021 (CEUR Workshop Proceedings; Vol. 2970). CEUR Workshop Proceedings. http://ceur-ws.org/Vol-2970/gdeinvited4.pdf

Wielemaker, Jan ; Arias, Joaquín ; Gupta, Gopal. / s(CASP) for SWI-prolog. ICLP Workshops 2021 International Conference on Logic Programming 2021 Workshops: Proceedings of the International Conference on Logic Programming 2021 Workshops co-located with the 37th International Conference on Logic Programming (ICLP 2021) Porto, Portugal (virtual), September 20th-21st, 2021. editor / Joaquin Arias. CEUR Workshop Proceedings, 2021. (CEUR Workshop Proceedings).

@inproceedings{9d7912b3ab9f4bf7b91c7db3e6d0259b,

title = "s(CASP) for SWI-prolog",

abstract = "s(CASP) is related to ASP. Unlike ASP, which is traditionally solved using grounding and a SAT solver, s(CASP) is solved using top-down goal directed search without grounding. This allows s(CASP) to solve problems that cannot be grounded, while the generated proof tree is a good basis for giving a justification for the answer. s(CASP) supports both negation as failure (NAF) and classical negation. These features make s(CASP) particularly suitable for commonsense reasoning tasks that require a justification of the answer. Currently, scasp is an executable generated using Ciao. We ported s(CASP) to SWI-Prolog. The primary aim of this is to provide s(CASP) as a library that allows for embedding and managing multiple s(CASP) programs from multiple threads. Here, {\textquoteleft}Managing{\textquoteright} means being able to construct and modify an s(CASP) program dynamically and dynamically run queries against s(CASP) programs.",

keywords = "Answer set programming, Multi-paradigm, Prolog, S(CASP)",

author = "Jan Wielemaker and Joaqu{\'i}n Arias and Gopal Gupta",

note = "Publisher Copyright: {\textcopyright} 2021 CEUR-WS. All rights reserved.; 2021 International Conference on Logic Programming Workshops, ICLP Workshops 2021 ; Conference date: 20-09-2021 Through 21-09-2021",

year = "2021",

language = "English",

series = "CEUR Workshop Proceedings",

publisher = "CEUR Workshop Proceedings",

editor = "Joaquin Arias",

booktitle = "ICLP Workshops 2021 International Conference on Logic Programming 2021 Workshops",

address = "Germany",

}

Wielemaker, J, Arias, J & Gupta, G 2021, s(CASP) for SWI-prolog. in J Arias (ed.), ICLP Workshops 2021 International Conference on Logic Programming 2021 Workshops: Proceedings of the International Conference on Logic Programming 2021 Workshops co-located with the 37th International Conference on Logic Programming (ICLP 2021) Porto, Portugal (virtual), September 20th-21st, 2021. CEUR Workshop Proceedings, vol. 2970, CEUR Workshop Proceedings, 2021 International Conference on Logic Programming Workshops, ICLP Workshops 2021, Virtual, Porto, Portugal, 20/09/21. <http://ceur-ws.org/Vol-2970/gdeinvited4.pdf>

s(CASP) for SWI-prolog. / Wielemaker, Jan; Arias, Joaquín; Gupta, Gopal.
ICLP Workshops 2021 International Conference on Logic Programming 2021 Workshops: Proceedings of the International Conference on Logic Programming 2021 Workshops co-located with the 37th International Conference on Logic Programming (ICLP 2021) Porto, Portugal (virtual), September 20th-21st, 2021. ed. / Joaquin Arias. CEUR Workshop Proceedings, 2021. (CEUR Workshop Proceedings; Vol. 2970).

Research output: Chapter in Book / Report / Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - s(CASP) for SWI-prolog

AU - Wielemaker, Jan

AU - Arias, Joaquín

AU - Gupta, Gopal

PY - 2021

Y1 - 2021

N2 - s(CASP) is related to ASP. Unlike ASP, which is traditionally solved using grounding and a SAT solver, s(CASP) is solved using top-down goal directed search without grounding. This allows s(CASP) to solve problems that cannot be grounded, while the generated proof tree is a good basis for giving a justification for the answer. s(CASP) supports both negation as failure (NAF) and classical negation. These features make s(CASP) particularly suitable for commonsense reasoning tasks that require a justification of the answer. Currently, scasp is an executable generated using Ciao. We ported s(CASP) to SWI-Prolog. The primary aim of this is to provide s(CASP) as a library that allows for embedding and managing multiple s(CASP) programs from multiple threads. Here, ‘Managing’ means being able to construct and modify an s(CASP) program dynamically and dynamically run queries against s(CASP) programs.

AB - s(CASP) is related to ASP. Unlike ASP, which is traditionally solved using grounding and a SAT solver, s(CASP) is solved using top-down goal directed search without grounding. This allows s(CASP) to solve problems that cannot be grounded, while the generated proof tree is a good basis for giving a justification for the answer. s(CASP) supports both negation as failure (NAF) and classical negation. These features make s(CASP) particularly suitable for commonsense reasoning tasks that require a justification of the answer. Currently, scasp is an executable generated using Ciao. We ported s(CASP) to SWI-Prolog. The primary aim of this is to provide s(CASP) as a library that allows for embedding and managing multiple s(CASP) programs from multiple threads. Here, ‘Managing’ means being able to construct and modify an s(CASP) program dynamically and dynamically run queries against s(CASP) programs.

KW - Answer set programming

KW - Multi-paradigm

KW - Prolog

KW - S(CASP)

UR - https://www.scopus.com/pages/publications/85116964053

UR - https://www.scopus.com/pages/publications/85116964053#tab=citedBy

UR - http://ceur-ws.org/Vol-2970/

M3 - Conference contribution

AN - SCOPUS:85116964053

T3 - CEUR Workshop Proceedings

BT - ICLP Workshops 2021 International Conference on Logic Programming 2021 Workshops

A2 - Arias, Joaquin

PB - CEUR Workshop Proceedings

T2 - 2021 International Conference on Logic Programming Workshops, ICLP Workshops 2021

Y2 - 20 September 2021 through 21 September 2021

ER -

Wielemaker J, Arias J, Gupta G. s(CASP) for SWI-prolog. In Arias J, editor, ICLP Workshops 2021 International Conference on Logic Programming 2021 Workshops: Proceedings of the International Conference on Logic Programming 2021 Workshops co-located with the 37th International Conference on Logic Programming (ICLP 2021) Porto, Portugal (virtual), September 20th-21st, 2021. CEUR Workshop Proceedings. 2021. (CEUR Workshop Proceedings). Epub 2021 Oct 6.

s(CASP) for SWI-prolog

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Persistent URL (handle)

Other files and links

Fingerprint

Cite this