Author image not provided
 Konstantinos Handjopoulos

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article3.00
Citation Count6
Publication count2
Publication years2010-2013
Available for download1
Average downloads per article184.00
Downloads (cumulative)184
Downloads (12 Months)30
Downloads (6 Weeks)5
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


2 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 2 of 2
Sort by:

1 published by ACM
August 2013 ACM Transactions on Computational Logic (TOCL): Volume 14 Issue 3, August 2013
Publisher: ACM
Bibliometrics:
Citation Count: 5
Downloads (6 Weeks): 5,   Downloads (12 Months): 30,   Downloads (Overall): 184

Full text available: PDFPDF
We propose a purely extensional semantics for higher-order logic programming. In this semantics program predicates denote sets of ordered tuples, and two predicates are equal iff they are equal as sets. Moreover, every program has a unique minimum Herbrand model which is the greatest lower bound of all Herbrand models ...
Keywords: Higher-order logic programming, algebraic lattices, denotational semantics, extensionality

2
September 2010 JELIA'10: Proceedings of the 12th European conference on Logics in artificial intelligence
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

We propose a purely extensional semantics for higher-order logic programming. Under this semantics, every program has a unique minimum Herbrand model which is the greatest lower bound of all Herbrand models of the program and the least fixed-point of the immediate consequence operator of the program. We also propose an ...



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us