725 search results - page 72 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
214
click to vote
ICDT
2012
ACM
13 years 8 months ago
2012
ACM
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
164
click to vote
CONCUR
2007
Springer
16 years 9 days ago
2007
Springer
Abstract. In the quest for tractable methods for reasoning about concurrent algorithms both rely/guarantee logic and separation logic have made great advances. They both seek to ta...
155
click to vote
AUSAI
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Quantified Boolean formulas (QBFs) play an important role in artificial intelligence subjects, specially in planning, knowledge representation and reasoning [20]. In th...
231
click to vote
FROCOS
2011
Springer
14 years 5 months ago
2011
Springer
Temporal data models have been used to describe how data can evolve in the context of temporal databases. Both the Extended Entity-Relationship (EER) model and the Unified Modelli...
171
click to vote
IEEEPACT
1999
IEEE
15 years 10 months ago
1999
IEEE
In current superscalar processors, all floating-point resources are idle during the execution of integer programs. As previous works show, this problem can be alleviated if the fl...