On testing effective computability of magic programs

Yehoshua Sagiv*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

A sufficient condition is given for effective computability of a magic program, assuming that predicates satisfy some finiteness and monotonicity constraints. Effective computability means that a bottom-up evaluation is a finite process. This sufficient condition can show effective computability in cases that could not be handled by previous methods. Testing the condition is exponential in the arity of predicates.

Original languageEnglish
Title of host publicationDeductive and Object-Oriented Databases - 2nd International Conference, DOOD 1991, Proceedings
EditorsYoshifumi Masunaga, Michael Kifer, Claude Delobel
PublisherSpringer Verlag
Pages244-262
Number of pages19
ISBN (Print)9783540550150
DOIs
StatePublished - 1991
Event2nd International Conference on Deductive and Object-Oriented Databases, DOOD 1991 - Munich, Germany
Duration: 16 Dec 199118 Dec 1991

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume566 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference2nd International Conference on Deductive and Object-Oriented Databases, DOOD 1991
Country/TerritoryGermany
CityMunich
Period16/12/9118/12/91

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1991.

Fingerprint

Dive into the research topics of 'On testing effective computability of magic programs'. Together they form a unique fingerprint.

Cite this