Unification factoring for efficient execution of logic programs

S. Dawson, C. R. Ramakrishnan, I. V. Ramakrishnan, K. Sagonas, S. Skiena, T. Swift, D. S. Warren

Research output: Contribution to journalConference articlepeer-review

Abstract

Unification factoring for efficient execution of logic programs regards the indexing and unification phases of clause resolution as a single process. This paper formalizes this process through the construction of factoring automata. A polynomial-time algorithm is given for constructing optimal factoring automata which preserve the clause selection strategy of Prolog. More generally, when the clause selection is not fixed, constructing such an optimal automation is shown to be NP-complete, solving an open trie minimization problem.

Original languageEnglish (US)
Pages (from-to)247-258
Number of pages12
JournalConference Record of the Annual ACM Symposium on Principles of Programming Languages
DOIs
StatePublished - Jan 1 1995
EventProceedings of the 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - San Francisco, CA, USA
Duration: Jan 22 1995Jan 25 1995

ASJC Scopus subject areas

  • Software

Fingerprint Dive into the research topics of 'Unification factoring for efficient execution of logic programs'. Together they form a unique fingerprint.

Cite this