On testing effective computability of magic programs

Yehoshua Sagiv

doi:10.1007/3-540-55015-1_13

On testing effective computability of magic programs

Yehoshua Sagiv^*

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	Deductive and Object-Oriented Databases - 2nd International Conference, DOOD 1991, Proceedings
Editors	Yoshifumi Masunaga, Michael Kifer, Claude Delobel
Publisher	Springer Verlag
Pages	244-262
Number of pages	19
ISBN (Print)	9783540550150
DOIs	https://doi.org/10.1007/3-540-55015-1_13
State	Published - 1991
Event	2nd International Conference on Deductive and Object-Oriented Databases, DOOD 1991 - Munich, Germany Duration: 16 Dec 1991 → 18 Dec 1991

Publication series

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

Conference

Conference	2nd International Conference on Deductive and Object-Oriented Databases, DOOD 1991
Country/Territory	Germany
City	Munich
Period	16/12/91 → 18/12/91

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1991.

Access to Document

10.1007/3-540-55015-1_13

Cite this

Sagiv, Y. (1991). On testing effective computability of magic programs. In Y. Masunaga, M. Kifer, & C. Delobel (Eds.), Deductive and Object-Oriented Databases - 2nd International Conference, DOOD 1991, Proceedings (pp. 244-262). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 566 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-55015-1_13

Sagiv, Yehoshua. / On testing effective computability of magic programs. Deductive and Object-Oriented Databases - 2nd International Conference, DOOD 1991, Proceedings. editor / Yoshifumi Masunaga ; Michael Kifer ; Claude Delobel. Springer Verlag, 1991. pp. 244-262 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{fbcc866186824052bbb70a6614ebe82e,

title = "On testing effective computability of magic programs",

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.",

author = "Yehoshua Sagiv",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1991.; 2nd International Conference on Deductive and Object-Oriented Databases, DOOD 1991 ; Conference date: 16-12-1991 Through 18-12-1991",

year = "1991",

doi = "10.1007/3-540-55015-1\_13",

language = "אנגלית",

isbn = "9783540550150",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "244--262",

editor = "Yoshifumi Masunaga and Michael Kifer and Claude Delobel",

booktitle = "Deductive and Object-Oriented Databases - 2nd International Conference, DOOD 1991, Proceedings",

address = "גרמניה",

}

Sagiv, Y 1991, On testing effective computability of magic programs. in Y Masunaga, M Kifer & C Delobel (eds), Deductive and Object-Oriented Databases - 2nd International Conference, DOOD 1991, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 566 LNCS, Springer Verlag, pp. 244-262, 2nd International Conference on Deductive and Object-Oriented Databases, DOOD 1991, Munich, Germany, 16/12/91. https://doi.org/10.1007/3-540-55015-1_13

On testing effective computability of magic programs. / Sagiv, Yehoshua.
Deductive and Object-Oriented Databases - 2nd International Conference, DOOD 1991, Proceedings. ed. / Yoshifumi Masunaga; Michael Kifer; Claude Delobel. Springer Verlag, 1991. p. 244-262 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 566 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - On testing effective computability of magic programs

AU - Sagiv, Yehoshua

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1991.

PY - 1991

Y1 - 1991

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/85030479777

U2 - 10.1007/3-540-55015-1_13

DO - 10.1007/3-540-55015-1_13

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85030479777

SN - 9783540550150

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 244

EP - 262

BT - Deductive and Object-Oriented Databases - 2nd International Conference, DOOD 1991, Proceedings

A2 - Masunaga, Yoshifumi

A2 - Kifer, Michael

A2 - Delobel, Claude

PB - Springer Verlag

T2 - 2nd International Conference on Deductive and Object-Oriented Databases, DOOD 1991

Y2 - 16 December 1991 through 18 December 1991

ER -

Sagiv Y. On testing effective computability of magic programs. In Masunaga Y, Kifer M, Delobel C, editors, Deductive and Object-Oriented Databases - 2nd International Conference, DOOD 1991, Proceedings. Springer Verlag. 1991. p. 244-262. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-55015-1_13

On testing effective computability of magic programs

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this