• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 38
Next 10 →

IQ: Towards Incremental Query Processing in Non-Deterministic Concurrent Constraint Logic Programming

by J. H. M. Lee, H.F. Leung - In Proceedings of the 1994 ACM Symposium on Applied Computing , 1994
"... Van Emden's incremental queries addresses the inadequacy of current Prolog-style querying mechanism in most logic programming systems for interactive problem-solving. There has been little published work on efficient implementation of incremental queries and all work is on sequential systems. I ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
. In the context of constraint logic programming, incremental queries involves adding new constraints or deleting old ones from a query after a solution is found. This paper presents an implementation scheme IQ of incremental queries in Constraint Pandora, which defines a class of non-deterministic concurrent

An Execution Scheme for Interactive Problem-Solving in Concurrent Constraint Logic Programming Languages

by Jimmy H. M. Lee, Ho-fung Leung
"... Van Emden's incremental queries address the inadequacy of current Prolog-style querying mechanism in most logic programming systems for interactive problem-solving. In the context of constraint logic programming, incremental queries involve adding new constraints or deleting old ones from a que ..."
Abstract - Add to MetaCart
query after a solution is found. This paper presents an implementation scheme IQ of incremental queries in Constraint Pandora, which defines a class of non-deterministic concurrent constraint logic programming languages. We use Van Hentenryck and Le Provost's scheme (VHLP-scheme hereafter), a re

Incremental Querying In The Concurrent Clp Language Ifd-Constraint Pandora

by J. H. M. Lee, H.F. Leung , 1996
"... Lee and Leung propose the IQ-scheme [11], a framework for efficient incremental query processing in concurrent constraint logic programming. They show that the performance of the IQ-scheme is in general better than the scheme proposed by Van Hentenryck and Le Provost [22]. IFD-Constraint Pandora is ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Lee and Leung propose the IQ-scheme [11], a framework for efficient incremental query processing in concurrent constraint logic programming. They show that the performance of the IQ-scheme is in general better than the scheme proposed by Van Hentenryck and Le Provost [22]. IFD-Constraint Pandora

Query Evaluation with Constant Delay

by Thèse De Doctorat, Normale Supérieure, De Cachan, Présentée Par, Monsieur Wojciech Kazana, Docteur De, Supérieure De Cachan, Nicole Bidoit, Professeur Président, Arnaud Durand, Patrice Ossona, Mendez Chargé, Victor Vianu, Professeur Examinateur, Luc Segoufin, Directeur Recherche Directeur
"... I am grateful to Luc Segoufin who kindly accepted me to be his PhD student. He introduced me to the problem of query enumeration and encouraged me to look for the answers to all the questions that emerged during our collaboration. He was a truly great advisor, always supportive and available for dis ..."
Abstract - Add to MetaCart
I am grateful to Luc Segoufin who kindly accepted me to be his PhD student. He introduced me to the problem of query enumeration and encouraged me to look for the answers to all the questions that emerged during our collaboration. He was a truly great advisor, always supportive and available

Object/relational query optimization with chase

by Lucian Popa
"... and backchase ..."
Abstract - Add to MetaCart
and backchase

Author manuscript, published in "ICDT (2012) 46-60" Highly Expressive Query Languages for Unordered Data Trees ∗

by Serge Abiteboul, Pierre Bourhis, Victor Vianu , 2012
"... We study highly expressive query languages for unordered data trees, using as formal vehicles Active XML and extensions of languages in the while family. All languages may be seen as adding some form of control on top of a set of basic pattern queries. The results highlight the impact and interplay ..."
Abstract - Add to MetaCart
of different factors: the expressive power of basic queries, the embedding of computation into data (as in Active XML), and the use of deterministic vs. nondeterministic control. All languages are Turing complete, but not necessarily query complete in the sense of Chandra and Harel. Indeed, we show that some

Chapter 12 Rough Sets and Rough Logic: A KDD Perspective

by Zdzis Law Pawlak, Lech Polkowski, Andrzej Skowron
"... Abstract Basic ideas of rough set theory were proposed by Zdzis law Pawlak [85, 86] in the early 1980’s. In the ensuing years, we have witnessed a systematic, world–wide growth of interest in rough sets and their applications. The main goal of rough set analysis is induction of approximations of con ..."
Abstract - Add to MetaCart
of their reflections (i.e. approx-imations) in the chosen language. The most important issues in this induction process are: – construction of relevant primitive concepts from which approximations of more complex concepts are assembled, – measures of inclusion and similarity (closeness) on concepts, – construction

Saskatoon By

by Dmytro Dyachuk
"... In presenting this thesis in partial fulfilment of the requirements for a Postgraduate degree ..."
Abstract - Add to MetaCart
In presenting this thesis in partial fulfilment of the requirements for a Postgraduate degree

(Invited Paper)

by Salvatore Tomaselli, Olaf L, Salvatore Tomaselli, Olaf L , 2013
"... HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific research documents, whether they are pub-lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte p ..."
Abstract - Add to MetaCart
pluridisciplinaire HAL, est destinée au dépôt et a ̀ la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

Acknowledgements

by Alejandro Houspanossian, Facultad De Ciencias Exactas , 2006
"... First, I would like to thank to Dimka Karastoyanova and Mariano Cilia for all the fruitful discussions, their guidance and support through the course of this project. Thanks also to Prof. Alejandro Buchmann who sponsored my stay at Technische Universität Darmstadt during the spring of 2004. The spec ..."
Abstract - Add to MetaCart
First, I would like to thank to Dimka Karastoyanova and Mariano Cilia for all the fruitful discussions, their guidance and support through the course of this project. Thanks also to Prof. Alejandro Buchmann who sponsored my stay at Technische Universität Darmstadt during the spring of 2004. The special thanks go to my advisor, Mariano Cilia, who has made all this possible. Finally, I’d like to thank to my family for all these years of support.
Next 10 →
Results 1 - 10 of 38
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University