( en | de | ru )

 

Disambiguation of "Sagiv, Yehoshua"

Author of the publication

copydeleteadd this publication to your clipboard
On Testing Effective Computability of Magic Programs.

. DOOD, volume 566 of Lecture Notes in Computer Science, page 244-262. Springer, (1991)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Sagiv, Yehoshua
add a person with the name Sagiv, Yehoshua
 

Other publications of authors with the same name

Knowledge Management for Keyword Search over Data Graphs., and . CIKM, page 2051-2053. ACM, (2014)Modeling and querying probabilistic XML data., and . SIGMOD Record, 37 (4): 69-77 (2008)The TSIMMIS approach to mediation: Data models and languages, , , , , , , and . Journal of Intelligent Information Systems, 8 (2): 117--132 (2004)Maximally joining probabilistic data., and . PODS, page 303-312. ACM, (2007)A Decidable Class of Bounded Recursions., and . PODS, page 227-236. ACM, (1987)The Equivalence of Solving Queries and Production Tree Projections., and . PODS, page 160-172. ACM, (1986)On Termination of Datalog Programs., and . DOOD, page 47-64. North-Holland/Elsevier Science Publishers, (1989)Efficiently Enumerating Results of Keyword Search., and . DBPL, volume 3774 of Lecture Notes in Computer Science, page 58-73. Springer, (2005)On Testing Effective Computability of Magic Programs.. DOOD, volume 566 of Lecture Notes in Computer Science, page 244-262. Springer, (1991)An Abstract Framework for Generating Maximal Answers to Queries., and . ICDT, volume 3363 of Lecture Notes in Computer Science, page 129-143. Springer, (2005)