HEAL DSpace

Unification factoring for efficient execution of logic programs

Αποθετήριο DSpace/Manakin

Εμφάνιση απλής εγγραφής

dc.contributor.author Dawson, S en
dc.contributor.author Ramakrishnan, C en
dc.contributor.author Ramakrishnan, I en
dc.contributor.author Sagonas, K en
dc.contributor.author Skiena, S en
dc.contributor.author Swift, T en
dc.contributor.author Warren, D en
dc.date.accessioned 2014-03-01T02:48:19Z
dc.date.available 2014-03-01T02:48:19Z
dc.date.issued 1995 en
dc.identifier.uri https://dspace.lib.ntua.gr/xmlui/handle/123456789/33728
dc.subject Indexation en
dc.subject Logic Programs en
dc.subject Performance Improvement en
dc.subject Polynomial Time Algorithm en
dc.subject Programming Language en
dc.subject Set Theory en
dc.subject Source Code en
dc.title Unification factoring for efficient execution of logic programs en
heal.type conferenceItem en
heal.identifier.primary 10.1145/199448.199509 en
heal.identifier.secondary http://dx.doi.org/10.1145/199448.199509 en
heal.publicationDate 1995 en
heal.abstract The efficiency of resolution-based logic programming languages, such as Prolog, depends critically on selecting and executing sets of applicable clause heads to resolve against subgoals. Traditional approaches to this problem have focused on using indexing to determine the smallest possible applicable set. Despite their usefulness, these approaches ignore the non-determinism inherent in many programming languages to the extent that they en
heal.journalName ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages en
dc.identifier.doi 10.1145/199448.199509 en


Αρχεία σε αυτό το τεκμήριο

Αρχεία Μέγεθος Μορφότυπο Προβολή

Δεν υπάρχουν αρχεία που σχετίζονται με αυτό το τεκμήριο.

Αυτό το τεκμήριο εμφανίζεται στην ακόλουθη συλλογή(ές)

Εμφάνιση απλής εγγραφής