A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
For the infinite case, we propose the stable chase, which generalises the core chase, and study its relation to incidental constraints. ... For dependency sets with a finite universal model, the core chase can be used to decide incidentality. ... I C D T 2 0 1 8 12:4 Preserving Constraints with the Stable Chase of each variable x. ...doi:10.4230/lipics.icdt.2018.12 dblp:conf/icdt/CarralK0OR18 fatcat:tmhsahbuezhkrk5tbcb7gdllnm
Datalog program, with the single clean instance as its standard model. ... General "answer sets programs" have been proposed to specify the MD-based cleaning task and its results. ... Conclusions Matching dependencies (MDs) are an important addition to the declarative approaches to data cleaning, in particular, to the common and difficult problem of entity resolution (ER). ...arXiv:1611.06951v2 fatcat:oqsltvzax5bkndiev6dxy2hxbe
Here we show that by forming chasing triplets in the predation process among the consumers and resources, the number of coexisting species of consumers can exceed that of resources at steady state, naturally ... In the past five decades, various mechanisms have been proposed to overcome the limit on diversity set by the competitive exclusion principle. ... some pathological cases with zero measure that occur when the system parameters satisfy certain accidental constraints 3,23 . ...doi:10.1101/312645 fatcat:vs3hbclqsveftku6hdeibsygbm
We show that many techniques developed in the context of predicate detection are applicable to the stable marriage problem. ... We also show that techniques in computation slicing can be used to represent the set of all constrained stable matchings. ... In the standard stable matching problem, there are no constraints on the order of proposals made by different men, and → p can be visualized as a partial order (E, → p ) with n disjoint chains. ...doi:10.4230/lipics.disc.2017.52 dblp:conf/wdag/Garg17 fatcat:5apoq4v7xraavcyvayd3gmgele
On the other hand, the decomposition should guarantee that the semantic knowledge and integrity constraints expressed by fuzzy functional dependency (FFD) are satisfactorily preserved by the resultant ... Then we show that stable formula functions and stable families behave as duals of each other, tying together elegantly the fixpoint and model the- ories for probabilistic logic programs with negation. ...
In particular, we consider various parameterizations of the constraint satisfaction problem, the evaluation problem of Boolean conjunctive database queries, and the propositional satisfiability problem ... Furthermore, we survey parameterized algorithms for problems arising in the context of the stable model semantics of logic programs, for a number of other problems of non-monotonic reasoning, and for the ... Stefan Szeider's work was supported by the EPSRC, Project EP/E001394/1 Fixed-parameter algorithms and satisfiability. ...doi:10.1093/comjnl/bxm056 fatcat:okmgxlprfjfdtl5sienm6b5vdu
Handbook of Data Quality
In the last few years we have seen the emergence of more generic solutions; and also of declarative and rule-based specifications of the intended solutions of data cleaning processes. ... Most of the time, those solutions have been applicable to specific problems and domains. ... We are grateful to our research collaborators with whom part of the research described here has been carried out. ...doi:10.1007/978-3-642-36257-6_9 fatcat:corj5f7yunfizby2ouib3duu5m
Chase rates with conspecifics were lower on the edge, but only differed significantly from the extreme center of the cluster. ... Chases with heterospecifics were signifi- cantly higher on the edge and then declined in the central positions. The central positions did not differ significantly from each other. ...
Author Contributions: XD created stable PDC cell lines expressing fluorescent proteins, carried out live-cell microscopy, determined effective pulse conditions for pulse-chase experiments and carried out ... In higher eukaryotic interphase nuclei, the 100s-1000s fold linear compaction of chromatin is difficult to reconcile with its function as a template for transcription, replication, and repair. ... We thank Christina Cardoso for the pENeGFPPCNA plasmid. We thank Furong Sun (UIUC, Laboratory for Mass Spectroscopy) for technical support with LC-MS/MS. ...doi:10.1016/j.cub.2016.07.020 pmid:27568589 pmcid:PMC5039087 fatcat:p5beyxs3zveh5dhkhw5fkw34p4
As winter dominance scores correlated best with social unit size, dominance status thus appeared to be mostly a by-product of a fluctuating trait: breeding success in the previous summer. ... When we considered only adults that had the same social unit size during two consecutive winters, we observed a significant preservation of dominance scores. ... Biteau, Sébastien Dalloyau, Alain Kim, David Pinaud, Alexandre Millon, Diane Desmonts, Sandra Blais, Daphné Durant and more particularly Bart Ebbinge, Gerard Müsken and Janien van der Greft for help with ...doi:10.1007/s10336-009-0437-8 fatcat:foixeif5xbhafc4ruxok5azbxu
2017 International Conference on Electromagnetics in Advanced Applications (ICEAA)
The study is conducted considering the typical constraints an actual designer has to cope with (concerning limited size and dielectric thickness and properties). ... As a result, a stable AMC in the 5.8GHz band is obtained, meeting the design requirements. ... Acknowledgements This work has been supported by the Gobierno del Principado de Asturias/FEDER under project GRUPIN14-114 and by the Ministerio de Economía y Competitividad under project TEC2014-54005- ...doi:10.1109/iceaa.2017.8065379 fatcat:v5akn7olejhl5ndwspyj556pzq
The dynamics of the heterotic theory is governed by a new superpotential and minimizing this superpotential reproduces all the torsional constraints. ... Most of these manifolds can be obtained by duality chasing a consistent F-theory compactification in the presence of fluxes. ... The topology change is achieved by considering an additional twist (along with the flux) so that a consistent solution that preserves minimal susy in four dimensions is obtained. ...arXiv:hep-th/0312221v2 fatcat:asxfkqj5une2dpvxmfh6mt34ze
Assuming the existence of matching functions for making two attributes values equal, we formally introduce the process of cleaning an instance using matching dependencies, as a chase-like procedure. ... Using the latter, we define the semantics of clean query answering in terms of certain/possible answers as the greatest lower bound/least upper bound of all possible answers obtained from the clean instances ... constraints. ...arXiv:1008.3743v1 fatcat:7snjyon7sbfshe2657dpwsvwbe
The main result asserts that, for such settings, the XR-certain answers of conjunctive queries can be rewritten as the certain answers of a union of conjunctive queries with respect to the stable models ... In a data exchange setting with target constraints, it is often the case that a given source instance has no solutions. In such cases, the semantics of target queries trivialize. ... Kolaitis' research was also supported by the project "Handling Uncertainty in Data Intensive Applications" under the program THALES. ...arXiv:1509.06390v1 fatcat:oklgm6bntjendecczvcypwdnfi
Assuming the existence of matching functions for making two attribute values equal, we formally introduce the process of cleaning an instance using matching dependencies, as a chase-like procedure. ... Using the latter, we define the semantics of clean query answering in terms of certain/possible answers as the greatest lower bound/least upper bound of all possible answers obtained from the clean instances ... From this, it follows that the stable instance D k associated with every chase sequence can be obtained in a finite number of steps which is polynomial in the size of D 0 . ...doi:10.1145/1938551.1938585 dblp:conf/icdt/BertossiKL11 fatcat:ki2e2hrylre53pfaotivlmvoni
« Previous Showing results 1 — 15 out of 13,655 results