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