Equivalence of two Fixed-Point Semantics for Definitional Higher-Order Logic Programs

Two distinct research approaches have been proposed for assigning a purely extensional semantics to higher-order logic programming. The former approach uses classical domain theoretic tools while the latter builds on a fixed-point construction defined on a syntactic instantiation of the source progr...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Electronic proceedings in theoretical computer science Ročník 191; číslo Proc. FICS 2015; s. 18 - 32
Hlavní autoři: Charalambidis, Angelos, Rondogiannis, Panos, Symeonidou, Ioanna
Médium: Journal Article
Jazyk:angličtina
Vydáno: Open Publishing Association 09.09.2015
ISSN:2075-2180, 2075-2180
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract Two distinct research approaches have been proposed for assigning a purely extensional semantics to higher-order logic programming. The former approach uses classical domain theoretic tools while the latter builds on a fixed-point construction defined on a syntactic instantiation of the source program. The relationships between these two approaches had not been investigated until now. In this paper we demonstrate that for a very broad class of programs, namely the class of definitional programs introduced by W. W. Wadge, the two approaches coincide (with respect to ground atoms that involve symbols of the program). On the other hand, we argue that if existential higher-order variables are allowed to appear in the bodies of program rules, the two approaches are in general different. The results of the paper contribute to a better understanding of the semantics of higher-order logic programming.
AbstractList Two distinct research approaches have been proposed for assigning a purely extensional semantics to higher-order logic programming. The former approach uses classical domain theoretic tools while the latter builds on a fixed-point construction defined on a syntactic instantiation of the source program. The relationships between these two approaches had not been investigated until now. In this paper we demonstrate that for a very broad class of programs, namely the class of definitional programs introduced by W. W. Wadge, the two approaches coincide (with respect to ground atoms that involve symbols of the program). On the other hand, we argue that if existential higher-order variables are allowed to appear in the bodies of program rules, the two approaches are in general different. The results of the paper contribute to a better understanding of the semantics of higher-order logic programming.
Author Symeonidou, Ioanna
Charalambidis, Angelos
Rondogiannis, Panos
Author_xml – sequence: 1
  givenname: Angelos
  surname: Charalambidis
  fullname: Charalambidis, Angelos
– sequence: 2
  givenname: Panos
  surname: Rondogiannis
  fullname: Rondogiannis, Panos
– sequence: 3
  givenname: Ioanna
  surname: Symeonidou
  fullname: Symeonidou, Ioanna
BookMark eNpNkF1LwzAUhoNMcM5d-QdyL51JmjTNpcx9wWCDzeuQpic1o2s0rV__3rqJ-N6cl3Px8PJco0ETGkDolpIJZ4Tfz7b76W5CFZ3wCzRkRIqE0ZwM_vUrNG7bA-mTKsZVNkRPs9c3_25qaCzg4HD3EfDcf0KZbINvOryDo2k6b1vsQsSP4HzjOx8aU-Olr54hJptYQsTrUHmLtzFU0RzbG3TpTN3C-PeO0H4-20-XyXqzWE0f1ollQnaJIwQylfVjJBWukKQ01hhDZFYK50CQQuYFsQUTheLUpaW0IHhKXUalyV06QqsztgzmoF-iP5r4pYPx-vQIsdIm9uNr0EyQ3KZlz3IZB24VWCWYJCbPhaIk61l3Z5aNoW0juD8eJfrHrz751b1fzdNvZSBvLA
Cites_doi 10.1017/S1471068414000313
10.1016/0743-1066(93)90039-J
10.1007/978-3-642-83189-8
10.1017/CBO9781139021326
10.1007/3-540-44802-0_15
10.1145/2499937.2499942
ContentType Journal Article
DBID AAYXX
CITATION
DOA
DOI 10.4204/EPTCS.191.4
DatabaseName CrossRef
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
DatabaseTitleList
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 2075-2180
EndPage 32
ExternalDocumentID oai_doaj_org_article_2508c3dcb2f64e4c9ec95270a8859106
10_4204_EPTCS_191_4
GroupedDBID 5VS
AAYXX
ADBBV
ALMA_UNASSIGNED_HOLDINGS
BCNDV
CITATION
E3Z
GROUPED_DOAJ
KQ8
M~E
OK1
ID FETCH-LOGICAL-c257t-f00e696039715fb70dacaaa076d5ffe50b78b0cb25b941f3d7ce5431f617a8f3
IEDL.DBID DOA
ISICitedReferencesCount 2
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000367340500003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2075-2180
IngestDate Fri Oct 03 12:52:49 EDT 2025
Sat Nov 29 02:05:25 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed false
IsScholarly true
Issue Proc. FICS 2015
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c257t-f00e696039715fb70dacaaa076d5ffe50b78b0cb25b941f3d7ce5431f617a8f3
OpenAccessLink https://doaj.org/article/2508c3dcb2f64e4c9ec95270a8859106
PageCount 15
ParticipantIDs doaj_primary_oai_doaj_org_article_2508c3dcb2f64e4c9ec95270a8859106
crossref_primary_10_4204_EPTCS_191_4
PublicationCentury 2000
PublicationDate 2015-09-09
PublicationDateYYYYMMDD 2015-09-09
PublicationDate_xml – month: 09
  year: 2015
  text: 2015-09-09
  day: 09
PublicationDecade 2010
PublicationTitle Electronic proceedings in theoretical computer science
PublicationYear 2015
Publisher Open Publishing Association
Publisher_xml – name: Open Publishing Association
References Wadge (Wa91a) 1991
Lloyd (lloyd) 1987
Miller (MN2012) 2012
Charalambidis (CharalambidisER14) 2014; 14
Bezem (Bezem01) 2001; 2142
Bezem (Bezem2002) 2002
Chen (CKW93-187) 1993; 15
Bezem (Bezem99) 1999
Charalambidis (CharalambidisHRW13) 2013; 14
Kountouriotis (KRW05) 2005
References_xml – start-page: 395
  volume-title: Logic Programming: The 1999 International Conference, Las Cruces, New Mexico, USA, November 29 - December 4, 1999
  year: 1999
  ident: Bezem99
  article-title: Extensionality of Simply Typed Logic Programs
– volume: 14
  start-page: 725
  year: 2014
  ident: CharalambidisER14
  article-title: Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation
  publication-title: TPLP
  doi: 10.1017/S1471068414000313
– volume: 15
  start-page: 187
  issue: 3
  year: 1993
  ident: CKW93-187
  article-title: HILOG: A Foundation for Higher-Order Logic Programming
  publication-title: Journal of Logic Programming
  doi: 10.1016/0743-1066(93)90039-J
– start-page: 18
  volume-title: Proceedings NWPT’02, Institute of Cybernetics at TTU, Tallinn
  year: 2002
  ident: Bezem2002
  article-title: Hoapata programs are monotonic
– volume-title: Foundations of Logic Programming
  year: 1987
  ident: lloyd
  doi: 10.1007/978-3-642-83189-8
– volume-title: Programming with Higher-Order Logic
  year: 2012
  ident: MN2012
  doi: 10.1017/CBO9781139021326
– volume: 2142
  start-page: 203
  volume-title: Computer Science Logic, 15th International Workshop, CSL 2001. 10th Annual Conference of the EACSL, Paris, France, September 10-13, 2001, Proceedings
  year: 2001
  ident: Bezem01
  article-title: An Improved Extensionality Criterion for Higher-Order Logic Programs
  doi: 10.1007/3-540-44802-0_15
– start-page: 1
  volume-title: Short Paper Proceeding of the 12th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR)
  year: 2005
  ident: KRW05
  article-title: Extensional Higher-Order Datalog
– start-page: 289
  volume-title: Logic Programming, Proceedings of the 1991 International Symposium, San Diego, California, USA, Oct. 28 - Nov 1, 1991
  year: 1991
  ident: Wa91a
  article-title: Higher-Order Horn Logic Programming
– volume: 14
  issue: 3
  year: 2013
  ident: CharalambidisHRW13
  article-title: Extensional Higher-Order Logic Programming
  publication-title: ACM Trans. Comput. Log.
  doi: 10.1145/2499937.2499942
SSID ssj0000392496
Score 1.9656472
Snippet Two distinct research approaches have been proposed for assigning a purely extensional semantics to higher-order logic programming. The former approach uses...
SourceID doaj
crossref
SourceType Open Website
Index Database
StartPage 18
Title Equivalence of two Fixed-Point Semantics for Definitional Higher-Order Logic Programs
URI https://doaj.org/article/2508c3dcb2f64e4c9ec95270a8859106
Volume 191
WOSCitedRecordID wos000367340500003&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: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 2075-2180
  dateEnd: 20201231
  omitProxy: false
  ssIdentifier: ssj0000392496
  issn: 2075-2180
  databaseCode: DOA
  dateStart: 20090101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources (ISSN International Center)
  customDbUrl:
  eissn: 2075-2180
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000392496
  issn: 2075-2180
  databaseCode: M~E
  dateStart: 20090101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV09T8MwELVQxcDCN6J8yUNXt27ixM4IJRULJVKL1C1K_CFlIIU2BSZ-O2c7RWViYYkUK7Ki53PuXXR-D6GedQ2RoTIklDwgTHJKyiCRQOQkFbqEsBkqZzbBJxMxnyfZltWX7Qnz8sAeuAGkaAGTyTIwMdNMJlomUcBpIazymhfbpjzZKqbcNzi0dYVzloOcSCCPUX84jwWUDdJsNpr2oVLps1_paEu136WX8SHab3khvvXvc4R2dH2MDjaeC7jdgifoOX1bVxAd9g4vDG4-FnhcfWpFskVVN3iqXwCrSq4wsFF8r01VV_53H_YtHeTJim1i67Escea7s1anaDZOZ6MH0lojEAl7rCGGUh1D8QFsYhiZklNVyKIoKI9VZIyOaMlFSQG0qEzY0ISKS21PvRsgLIUw4Rnq1ItanyMM9E1IBUPaSc0rAXu-UFIEhvIyDlUX9TYA5a9eACOHwsHimDscc8AxZ110Z8H7ecSqVrsBWMu8Xcv8r7W8-I9JLtEekJrI9YElV6jTLNf6Gu3K96ZaLW9cmMD18Sv9BndHwPc
linkProvider Directory of Open Access Journals
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=Equivalence+of+two+Fixed-Point+Semantics+for+Definitional+Higher-Order+Logic+Programs&rft.jtitle=Electronic+proceedings+in+theoretical+computer+science&rft.au=Charalambidis%2C+Angelos&rft.au=Rondogiannis%2C+Panos&rft.au=Symeonidou%2C+Ioanna&rft.date=2015-09-09&rft.issn=2075-2180&rft.eissn=2075-2180&rft.volume=191&rft.spage=18&rft.epage=32&rft_id=info:doi/10.4204%2FEPTCS.191.4&rft.externalDBID=n%2Fa&rft.externalDocID=10_4204_EPTCS_191_4
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2075-2180&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2075-2180&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2075-2180&client=summon