Author of the publication

A Computational Model for Functional Logic Deductive Databases.

, , and . ICLP, volume 2237 of Lecture Notes in Computer Science, page 331-347. Springer, (2001)

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.

 

Other publications of authors with the same name

A simple rewrite notion for call-time choice semantics., , and . PPDP, page 197-208. ACM, (2007)TOY: A Multiparadigm Declarative System., and . RTA, volume 1631 of Lecture Notes in Computer Science, page 244-247. Springer, (1999)Narrowing for First Order Functional Logic Programs with Call-Time Choice Semantics., , and . INAP/WLP, volume 5437 of Lecture Notes in Computer Science, page 206-222. Springer, (2007)Proving Failure in Functional Logic Programs., and . Computational Logic, volume 1861 of Lecture Notes in Computer Science, page 179-193. Springer, (2000)A Fully Abstract Semantics for Constructor Systems., , and . RTA, volume 5595 of Lecture Notes in Computer Science, page 320-334. Springer, (2009)Constructive Failure in Functional-Logic Programming: From Theory to Implementation.. J. Univers. Comput. Sci., 12 (11): 1574-1593 (2006)HR-SQL: Extending SQL with hypothetical reasoning and improved recursion for current database systems., , and . Inf. Comput., (2020)Incorporating Hypothetical Views and Extended Recursion into SQL Database Systems., , , and . LPAR (short papers), volume 26 of EPiC Series in Computing, page 9-22. EasyChair, (2013)White-Box Path Generation in Recursive Programs., and . TFP, volume 12222 of Lecture Notes in Computer Science, page 121-135. Springer, (2020)Disequalities May Help to Narrow., and . APPIA-GULP-PRODE, page 89-104. (1999)