The intricacies of three-valued extensional semantics for higher-order logic programs

M. Bezem defined an extensional semantics for positive higher-order logic programs. Recently, it was demonstrated by Rondogiannis and Symeonidou that Bezem's technique can be extended to higher-order logic programs with negation, retaining its extensional properties, provided that it is interpr...

Full description

Saved in:
Bibliographic Details
Published in:Theory and practice of logic programming Vol. 17; no. 5-6; pp. 974 - 991
Main Authors: RONDOGIANNIS, PANOS, SYMEONIDOU, IOANNA
Format: Journal Article
Language:English
Published: Cambridge, UK Cambridge University Press 01.09.2017
Subjects:
Failure analysis
Graphs
Logic
Logic programming
Logic programs
Regular Papers
Semantics
Extensional higher-order logic programming
Negation in logic programming
ISSN:1471-0684, 1475-3081
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract M. Bezem defined an extensional semantics for positive higher-order logic programs. Recently, it was demonstrated by Rondogiannis and Symeonidou that Bezem's technique can be extended to higher-order logic programs with negation, retaining its extensional properties, provided that it is interpreted under a logic with an infinite number of truth values. Rondogiannis and Symeonidou also demonstrated that Bezem's technique, when extended under the stable model semantics, does not in general lead to extensional stable models. In this paper, we consider the problem of extending Bezem's technique under the well-founded semantics. We demonstrate that the well-founded extension fails to retain extensionality in the general case. On the positive side, we demonstrate that for stratified higher-order logic programs, extensionality is indeed achieved. We analyze the reasons of the failure of extensionality in the general case, arguing that a three-valued setting cannot distinguish between certain predicates that appear to have a different behaviour inside a program context, but which happen to be identical as three-valued relations.
AbstractList M. Bezem defined an extensional semantics for positive higher-order logic programs. Recently, it was demonstrated by Rondogiannis and Symeonidou that Bezem's technique can be extended to higher-order logic programs with negation, retaining its extensional properties, provided that it is interpreted under a logic with an infinite number of truth values. Rondogiannis and Symeonidou also demonstrated that Bezem's technique, when extended under the stable model semantics, does not in general lead to extensional stable models. In this paper, we consider the problem of extending Bezem's technique under the well-founded semantics. We demonstrate that the well-founded extension fails to retain extensionality in the general case. On the positive side, we demonstrate that for stratified higher-order logic programs, extensionality is indeed achieved. We analyze the reasons of the failure of extensionality in the general case, arguing that a three-valued setting cannot distinguish between certain predicates that appear to have a different behaviour inside a program context, but which happen to be identical as three-valued relations.
M. Bezem defined an extensional semantics for positive higher-order logic programs. Recently, it was demonstrated by Rondogiannis and Symeonidou that Bezem's technique can be extended to higher-order logic programs with negation, retaining its extensional properties, provided that it is interpreted under a logic with an infinite number of truth values. Rondogiannis and Symeonidou also demonstrated that Bezem's technique, when extended under the stable model semantics, does not in general lead to extensional stable models. In this paper, we consider the problem of extending Bezem's technique under the well-founded semantics. We demonstrate that the well-founded extension fails to retain extensionality in the general case. On the positive side, we demonstrate that for stratified higher-order logic programs, extensionality is indeed achieved. We analyze the reasons of the failure of extensionality in the general case, arguing that a three-valued setting cannot distinguish between certain predicates that appear to have a different behaviour inside a program context, but which happen to be identical as three-valued relations.
Author RONDOGIANNIS, PANOS
SYMEONIDOU, IOANNA
Author_xml – sequence: 1
  givenname: PANOS
  surname: RONDOGIANNIS
  fullname: RONDOGIANNIS, PANOS
  email: prondo@di.uoa.gr
  organization: National and Kapodistrian University of Athens, Athens, Greece (e-mail: prondo@di.uoa.gr, i.symeonidou@di.uoa.gr)
– sequence: 2
  givenname: IOANNA
  surname: SYMEONIDOU
  fullname: SYMEONIDOU, IOANNA
  email: prondo@di.uoa.gr
  organization: National and Kapodistrian University of Athens, Athens, Greece (e-mail: prondo@di.uoa.gr, i.symeonidou@di.uoa.gr)
BookMark eNp1UDtPwzAQtlCRaAs_gM0Ss8Gu49geUcVLqsRAO0eOfUlcJXGxUwT_npR2QEJMd7r7HnffDE360ANC14zeMsrk3RvLJKO5ypiklHIhz9B0HAnCqWKTn56Rw_4CzVLaUspyvsimaLNuAPt-iN4a6yHhUOGhiQDkw7R7cBg-B-iTD71pcYLO9IO3CVch4sbXDUQSooOI21B7i3cx1NF06RKdV6ZNcHWqc7R5fFgvn8nq9elleb8idpHrgSgFuTQOMkO5EyCo5ZXMrBGlE9Jmmpsys1q7SnNtjKhyakEtnFLalU6WlM_RzVF3NH7fQxqKbdjH8dRUMD1-rzgTekSxI8rGkFKEqthF35n4VTBaHNIr_qQ3cviJY7oyelfDL-l_Wd-6yXRr
Cites_doi 10.1016/j.tcs.2017.01.005
10.1017/S1471068414000313
10.1145/1055686.1055694
10.1016/B978-0-934613-40-8.50006-3
10.1016/0743-1066(93)90039-J
10.1007/978-3-662-47709-0_13
10.1145/958942.958946
10.1016/0743-1066(89)90032-0
10.1007/3-540-44802-0_15
10.24963/ijcai.2018/750
10.1007/978-3-642-83189-8
10.1016/B978-0-934613-40-8.50009-9
10.1017/CBO9781139021326
10.1007/978-3-642-30743-0_13
ContentType Journal Article
Copyright Copyright © Cambridge University Press 2017
Copyright_xml – notice: Copyright © Cambridge University Press 2017
DBID AAYXX
CITATION
3V.
7SC
7XB
8AL
8FD
8FE
8FG
8FK
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
GNUQQ
HCIFZ
JQ2
K7-
L7M
L~C
L~D
M0N
P5Z
P62
PHGZM
PHGZT
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
Q9U
DOI 10.1017/S1471068417000357
DatabaseName CrossRef
ProQuest Central (Corporate)
Computer and Information Systems Abstracts
ProQuest Central (purchase pre-March 2016)
Computing Database (Alumni Edition)
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
ProQuest Central (Alumni Edition)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials
ProQuest Central
ProQuest Technology Collection
ProQuest One Community College
ProQuest Central Korea
ProQuest Central Student
SciTech Premium Collection
ProQuest Computer Science Collection
Computer Science Database
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
Computing Database
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic (New)
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
ProQuest Central Basic
DatabaseTitle CrossRef
Computer Science Database
ProQuest Central Student
Technology Collection
Technology Research Database
Computer and Information Systems Abstracts – Academic
ProQuest One Academic Middle East (New)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Central Korea
ProQuest Central (New)
Advanced Technologies Database with Aerospace
Advanced Technologies & Aerospace Collection
ProQuest Computing
ProQuest Central Basic
ProQuest Computing (Alumni Edition)
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest SciTech Collection
Computer and Information Systems Abstracts Professional
Advanced Technologies & Aerospace Database
ProQuest One Academic UKI Edition
ProQuest One Academic
ProQuest Central (Alumni)
ProQuest One Academic (New)
DatabaseTitleList CrossRef
Computer Science Database
Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
DocumentTitleAlternate The intricacies of three-valued extensional semantics for higher-order LP
P. Rondogiannis and I. Symeonidou
EISSN 1475-3081
EndPage 991
ExternalDocumentID 10_1017_S1471068417000357
GroupedDBID -E.
.FH
09C
09E
0E1
0R~
123
29Q
3V.
4.4
5VS
74X
74Y
7~V
8FE
8FG
8R4
8R5
AAAZR
AABES
AABWE
AACJH
AAEED
AAFUK
AAGFV
AAKTX
AANRG
AARAB
AASVR
AAUKB
AAYOK
ABBXD
ABITZ
ABJNI
ABKKG
ABMWE
ABMYL
ABQTM
ABQWD
ABROB
ABTCQ
ABUWG
ABZCX
ACBMC
ACCHT
ACGFS
ACIMK
ACNCT
ACQFJ
ACREK
ACUIJ
ACUYZ
ACWGA
ACYZP
ACZBM
ACZUX
ACZWT
ADCGK
ADDNB
ADFEC
ADGEJ
ADKIL
ADOCW
ADOVH
ADVJH
AEBAK
AEHGV
AEMTW
AENEX
AENGE
AEYYC
AFFUJ
AFKQG
AFKRA
AFKSM
AFLOS
AFLVW
AFUTZ
AGABE
AGBYD
AGJUD
AGOOT
AHQXX
AHRGI
AIGNW
AIHIV
AIOIP
AISIE
AJ7
AJCYY
AJPFC
AJQAS
ALMA_UNASSIGNED_HOLDINGS
ALVPG
ALWZO
AQJOH
ARABE
ARAPS
ATUCA
AUXHV
AZQEC
BBLKV
BENPR
BGHMG
BGLVJ
BLZWO
BMAJL
BPHCQ
C0O
CAG
CBIIA
CCPQU
CCQAD
CCTKK
CFAFE
CHEAL
CJCSC
COF
CS3
DC4
DOHLZ
DU5
DWQXO
EBS
EJD
GNUQQ
HCIFZ
HG-
HST
HZ~
I.6
IH6
IOEEP
IPYYG
IS6
I~P
J36
J38
J3A
J9A
JHPGK
JQKCU
K6V
K7-
KCGVB
KFECR
L98
LW7
M-V
M0N
NIKVX
O9-
OK1
OYBOY
P2P
P62
PQQKQ
PROAC
PYCCK
Q2X
RAMDC
RCA
ROL
RR0
S6-
S6U
SAAAG
T9M
UT1
WFFJZ
WQ3
WXU
WXY
WYP
ZYDXJ
AAYXX
ABGDZ
ABVKB
ABVZP
ABXHF
ACAJB
ACDLN
AFFHD
AFZFC
AKMAY
CITATION
PHGZM
PHGZT
PQGLB
7SC
7XB
8AL
8FD
8FK
JQ2
L7M
L~C
L~D
PKEHL
PQEST
PQUKI
PRINS
Q9U
ID FETCH-LOGICAL-c269t-88e67ade4a03d5e50c3f74ca5bd57c493ab4c99df939aa5f60ce82d889dbd7b03
IEDL.DBID P5Z
ISICitedReferencesCount 4
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000412567800018&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1471-0684
IngestDate Sun Jul 13 03:43:28 EDT 2025
Sat Nov 29 04:58:36 EST 2025
Wed Mar 13 05:53:13 EDT 2024
IsPeerReviewed true
IsScholarly true
Issue 5-6
Keywords Extensional higher-order logic programming
Negation in logic programming
Language English
License https://www.cambridge.org/core/terms
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c269t-88e67ade4a03d5e50c3f74ca5bd57c493ab4c99df939aa5f60ce82d889dbd7b03
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
PQID 1947583159
PQPubID 43613
PageCount 18
ParticipantIDs proquest_journals_1947583159
crossref_primary_10_1017_S1471068417000357
cambridge_journals_10_1017_S1471068417000357
PublicationCentury 2000
PublicationDate 20170900
2017-09-00
20170901
PublicationDateYYYYMMDD 2017-09-01
PublicationDate_xml – month: 09
  year: 2017
  text: 20170900
PublicationDecade 2010
PublicationPlace Cambridge, UK
PublicationPlace_xml – name: Cambridge, UK
– name: Cambridge
PublicationTitle Theory and practice of logic programming
PublicationTitleAlternate Theory and Practice of Logic Programming
PublicationYear 2017
Publisher Cambridge University Press
Publisher_xml – name: Cambridge University Press
References Bloom (S1471068417000357_ref4) 1993
Przymusinska (S1471068417000357_ref19) 1990
Denecker (S1471068417000357_ref11) 2012
Gelder (S1471068417000357_ref14) 1991; 38
S1471068417000357_ref20
S1471068417000357_ref13
S1471068417000357_ref24
S1471068417000357_ref12
S1471068417000357_ref23
S1471068417000357_ref22
S1471068417000357_ref21
S1471068417000357_ref10
S1471068417000357_ref17
S1471068417000357_ref16
S1471068417000357_ref15
S1471068417000357_ref9
S1471068417000357_ref8
Charalambidis (S1471068417000357_ref7) 2013; 14
S1471068417000357_ref6
S1471068417000357_ref5
S1471068417000357_ref18
S1471068417000357_ref3
S1471068417000357_ref2
S1471068417000357_ref1
References_xml – ident: S1471068417000357_ref8
  doi: 10.1016/j.tcs.2017.01.005
– ident: S1471068417000357_ref24
– ident: S1471068417000357_ref6
  doi: 10.1017/S1471068414000313
– ident: S1471068417000357_ref16
– ident: S1471068417000357_ref23
  doi: 10.1145/1055686.1055694
– ident: S1471068417000357_ref1
  doi: 10.1016/B978-0-934613-40-8.50006-3
– ident: S1471068417000357_ref9
  doi: 10.1016/0743-1066(93)90039-J
– ident: S1471068417000357_ref12
  doi: 10.1007/978-3-662-47709-0_13
– ident: S1471068417000357_ref10
  doi: 10.1145/958942.958946
– volume: 38
  start-page: 620
  year: 1991
  ident: S1471068417000357_ref14
  article-title: The well-founded semantics for general logic programs
  publication-title: Journal of ACM
– ident: S1471068417000357_ref15
– start-page: 321
  volume-title: Formal Techniques in Artificial Intelligence
  year: 1990
  ident: S1471068417000357_ref19
– ident: S1471068417000357_ref13
  doi: 10.1016/0743-1066(89)90032-0
– volume-title: Iteration Theories - The Equational Logic of Iterative Processes
  year: 1993
  ident: S1471068417000357_ref4
– ident: S1471068417000357_ref3
  doi: 10.1007/3-540-44802-0_15
– ident: S1471068417000357_ref22
  doi: 10.24963/ijcai.2018/750
– ident: S1471068417000357_ref2
– volume: 14
  start-page: 21
  year: 2013
  ident: S1471068417000357_ref7
  article-title: Extensional higher-order logic programming
  publication-title: ACM Transaction on Computational Logic
– ident: S1471068417000357_ref21
– ident: S1471068417000357_ref17
  doi: 10.1007/978-3-642-83189-8
– ident: S1471068417000357_ref20
  doi: 10.1016/B978-0-934613-40-8.50009-9
– ident: S1471068417000357_ref18
  doi: 10.1017/CBO9781139021326
– ident: S1471068417000357_ref5
– start-page: 178
  volume-title: Correct Reasoning - Essays on Logic-Based AI in Honour of Vladimir Lifschitz
  year: 2012
  ident: S1471068417000357_ref11
  doi: 10.1007/978-3-642-30743-0_13
SSID ssj0016324
Score 2.1110122
Snippet M. Bezem defined an extensional semantics for positive higher-order logic programs. Recently, it was demonstrated by Rondogiannis and Symeonidou that Bezem's...
SourceID proquest
crossref
cambridge
SourceType Aggregation Database
Index Database
Publisher
StartPage 974
SubjectTerms Failure analysis
Graphs
Logic
Logic programming
Logic programs
Regular Papers
Semantics
Title The intricacies of three-valued extensional semantics for higher-order logic programs
URI https://www.cambridge.org/core/product/identifier/S1471068417000357/type/journal_article
https://www.proquest.com/docview/1947583159
Volume 17
WOSCitedRecordID wos000412567800018&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVPQU
  databaseName: Advanced Technologies & Aerospace Database
  customDbUrl:
  eissn: 1475-3081
  dateEnd: 20241213
  omitProxy: false
  ssIdentifier: ssj0016324
  issn: 1471-0684
  databaseCode: P5Z
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Computer Science Database (ProQuest)
  customDbUrl:
  eissn: 1475-3081
  dateEnd: 20241213
  omitProxy: false
  ssIdentifier: ssj0016324
  issn: 1471-0684
  databaseCode: K7-
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1475-3081
  dateEnd: 20241213
  omitProxy: false
  ssIdentifier: ssj0016324
  issn: 1471-0684
  databaseCode: BENPR
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8NAEB5s68GL9YnVWvbgSVzMY5PdPYmKRRBKEQvFS9jsA3swrU3197u7TapF6MXrJISw3-zMZPbLNwAXTvWKhybEwoQEk1AJnKec4zBlJqVSB1wRP2yCDgZsPObDquFWVrTKOib6QK2m0vXIr-3Hti1tY5t9b2Yf2E2Ncqer1QiNBrScSoIb3TBMXlenCE6K3P9dRB27h5H6VNNJRjujszl9uiB22elHW2E9R62HaJ93-u3_vvEe7FYVJ7pdusg-bOniANr1NAdUbe5DGFmPQZPCKfYLayvR1KCFRVpjJwiuFfL98qWIByr1u4VkIktki1705ski2Mt4Ih9MUcX7Ko9g1H94uX_E1dAFLKOULzBjOqVCaSKCWCU6CWRsKJEiyVVCJeGxyInkXBkecyESkwZSs0gxxlWuaB7Ex9AspoU-AUSFJNTYAsvoyK62yEXMiTVpyalJGe3A1WrJs2rrlNmSdkazPwh14LJGJZstpTg23dytQfn16BUip5svn8FO5NK355J1obmYf-pz2JZfi0k570Hr7mEwfO5B44ninne5bwaM2i8
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LS8QwEB58gV58i29z0IsYbJu0SQ4i4gNldfGg4K2meeAe3FW7Kv4pf6NJ2q6K4M2D12kJpPPNI53JNwCbnvVKxDbG0sYU01hLXGRC4DjjNmPKRELTMGyCtdv85kZcDsF7cxfGt1U2PjE4at1T_h_5rjtsu9SWuOi7__CI_dQoX11tRmhUsGiZt1d3ZCv3zo6cfreS5OT46vAU11MFsEoy0cecm4xJbaiMiE5NGiliGVUyLXTKFBVEFlQJoa0gQsrUZpEyPNGcC11oVkTErTsMo5Rw5u2qxfCgauGpz8NtJua7iThtqqieotoLvczz4UXER8NPLofvMfF7SAhx7mTqv32haZisM2p0UJnADAyZ7ixMNdMqUO285uDaWQTqdP1EAulkJepZ1HdINtgTnhuNQj2gIilBpbl3kOuoErmkHt2FZhgcaEpRCBao7msr5-H6Tza3ACPdXtcsAmJSUWZdAmlN4rQrC0kEdSKjBLMZZ0uwM1BxXruGMq_a6lj-AxFLsN2gIH-oqEZ-e3m1AcGXpQcIWP798QaMn15dnOfnZ-3WCkwkPlUJfXOrMNJ_ejZrMKZe-p3yaT0AHMHtX-PlAyyEN0E
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=The+intricacies+of+three-valued+extensional+semantics+for+higher-order+logic+programs&rft.jtitle=Theory+and+practice+of+logic+programming&rft.au=RONDOGIANNIS%2C+PANOS&rft.au=SYMEONIDOU%2C+IOANNA&rft.date=2017-09-01&rft.pub=Cambridge+University+Press&rft.issn=1471-0684&rft.eissn=1475-3081&rft.volume=17&rft.issue=5-6&rft.spage=974&rft_id=info:doi/10.1017%2FS1471068417000357
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1471-0684&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1471-0684&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1471-0684&client=summon