Sciweavers

522 search results - page 85 / 105
» Real-time Logics: Complexity and Expressiveness
Sort
View
TPHOL
1999
IEEE
14 years 22 days ago
Three Tactic Theorem Proving
Abstract. We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to p...
Don Syme
PODS
2009
ACM
122views Database» more  PODS 2009»
14 years 9 months ago
Satisfiability of downward XPath with data equality tests
In this work we investigate the satisfiability problem for the logic XPath( , , =), that includes all downward axes as well as equality and inequality tests. We address this probl...
Diego Figueira
ER
2007
Springer
108views Database» more  ER 2007»
14 years 2 months ago
Reasoning over Extended ER Models
Abstract. We investigate the computational complexity of reasoning over various fragments of the Extended Entity-Relationship (EER) language, which includes a number of constructs:...
Alessandro Artale, Diego Calvanese, Roman Kontchak...
BPM
2008
Springer
125views Business» more  BPM 2008»
13 years 10 months ago
Checking Compliance of Execution Traces to Business Rules
Complex and flexible business processes are critical not only because they are difficult to handle, but also because they often tend to loose their intelligibility. Verifying compl...
Federico Chesani, Paola Mello, Marco Montali, Fabr...
DMDW
2000
161views Management» more  DMDW 2000»
13 years 9 months ago
View materialization for nested GPSJ queries
View materialization is a central issue in logical design of data warehouses since it is one of the most powerful techniques to improve the response to the workload. Most approach...
Matteo Golfarelli, Stefano Rizzi