Sciweavers

121 search results - page 24 / 25
» On Containment of Conjunctive Queries with Negation
Sort
View
PLANX
2007
13 years 7 months ago
XPath Typing Using a Modal Logic with Converse for Finite Trees
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
Pierre Genevès, Nabil Layaïda, Alan Sc...
CONCUR
2006
Springer
13 years 10 months ago
Sanity Checks in Formal Verification
One of the advantages of temporal-logic model-checking tools is their ability to accompany a negative answer to the correctness query by a counterexample to the satisfaction of the...
Orna Kupferman
ICLP
2010
Springer
13 years 10 months ago
Tight Semantics for Logic Programs
We define the Tight Semantics (TS), a new semantics for all NLPs complying with the requirements of: 2-valued semantics; preserving the models of SM; guarantee of model existence...
Luís Moniz Pereira, Alexandre Miguel Pinto
BMCBI
2005
147views more  BMCBI 2005»
13 years 6 months ago
GATA: a graphic alignment tool for comparative sequence analysis
Background: Several problems exist with current methods used to align DNA sequences for comparative sequence analysis. Most dynamic programming algorithms assume that conserved se...
David A. Nix, Michael B. Eisen
TKDE
2002
140views more  TKDE 2002»
13 years 5 months ago
Transaction Processing in Mobile, Heterogeneous Database Systems
As technological advances are made in software and hardware, the feasibility of accessing information "any time, anywhere" is becoming a reality. Furthermore, the diversi...
James B. Lim, Ali R. Hurson