Artykuł w czasopiśmie
Brak miniatury
Licencja
ClosedAccessDostęp zamknięty
 

First-order Answer Set Programming as Constructive Proof Search

Uproszczony widok
cris.lastimport.scopus2024-02-12T19:51:49Z
dc.abstract.enWe propose an interpretation of the first-order answer set programming (FOASP) in terms of intuitionistic proof theory. It is obtained by two polynomial translations between FOASP and the bounded-arity fragment of the Σ1 level of the Mints hierarchy in first-order intuitionistic logic. It follows that Σ1 formulas using predicates of fixed arity (in particular unary) is of the same strength as FOASP. Our construction reveals a close similarity between constructive provability and stable entailment, or equivalently, between the construction of an answer set and an intuitionistic refutation.
dc.affiliationUniwersytet Warszawski
dc.conference.countryWielka Brytania
dc.conference.datefinish2018-07-17
dc.conference.datestart2018-07-14
dc.conference.placeOxford
dc.conference.seriesInternational Conference on Logic Programming
dc.conference.seriesInternational Conference on Logic Programming
dc.conference.seriesshortcutICLP
dc.conference.shortcutICLP 2018
dc.conference.weblinkhttps://www.cs.nmsu.edu/ALP/iclp2018/
dc.contributor.authorSchubert, Aleksy
dc.contributor.authorUrzyczyn, Paweł
dc.date.accessioned2024-01-25T00:41:14Z
dc.date.available2024-01-25T00:41:14Z
dc.date.issued2018
dc.description.financeNie dotyczy
dc.description.number3-4
dc.description.volume18
dc.identifier.doi10.1017/S147106841800008X
dc.identifier.issn1471-0684
dc.identifier.urihttps://repozytorium.uw.edu.pl//handle/item/107186
dc.identifier.weblinkhttps://www.cambridge.org/core/journals/theory-and-practice-of-logic-programming/article/firstorder-answer-set-programming-as-constructive-proof-search/8836B6EBE7A08C13738CE05FD34A98CF
dc.languageeng
dc.pbn.affiliationcomputer and information sciences
dc.relation.ispartofTheory and Practice of Logic Programming
dc.relation.pages673-690
dc.rightsClosedAccess
dc.sciencecloudnosend
dc.subject.enAnswer set programming
dc.subject.enintuitionistic logic
dc.subject.enproof terms
dc.subject.enlambda calculus
dc.titleFirst-order Answer Set Programming as Constructive Proof Search
dc.typeJournalArticle
dspace.entity.typePublication