The Intricacies of Three-Valued Extensional Semantics for Higher-Order Logic Programs
Abstract
In this paper we examine the problem of providing a purely extensional three-valued semantics for higher-order logic programs with negation. We demonstrate that a technique that was proposed by M. Bezem for providing extensional semantics to positive higher-order logic programs, fails when applied to higher-order logic programs with negation. On the positive side, we demonstrate that for stratified higher-order logic programs, extensionality is indeed achieved by the technique. We analyze the reasons of the failure of extensionality in the general case, arguing that a three-valued setting can not 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.
Cite
Text
Rondogiannis and Symeonidou. "The Intricacies of Three-Valued Extensional Semantics for Higher-Order Logic Programs." International Joint Conference on Artificial Intelligence, 2018. doi:10.24963/IJCAI.2018/750Markdown
[Rondogiannis and Symeonidou. "The Intricacies of Three-Valued Extensional Semantics for Higher-Order Logic Programs." International Joint Conference on Artificial Intelligence, 2018.](https://mlanthology.org/ijcai/2018/rondogiannis2018ijcai-intricacies/) doi:10.24963/IJCAI.2018/750BibTeX
@inproceedings{rondogiannis2018ijcai-intricacies,
title = {{The Intricacies of Three-Valued Extensional Semantics for Higher-Order Logic Programs}},
author = {Rondogiannis, Panos and Symeonidou, Ioanna},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2018},
pages = {5344-5348},
doi = {10.24963/IJCAI.2018/750},
url = {https://mlanthology.org/ijcai/2018/rondogiannis2018ijcai-intricacies/}
}