9626 search results - page 421 / 1926 » Invariant Based Programming |
177
click to vote
GI
1999
Springer
15 years 11 months ago
1999
Springer
We discuss the properties of strictly typed languages on the one hand and soft typing of the other and identify disadvantages of these approaches to type checking in the context of...
168
click to vote
DEXAW
1998
IEEE
15 years 11 months ago
1998
IEEE
Within a database mobile environment, cached data on mobile clients can take the form of materialized views. In order to e ciently maintain such materialized views while taking in...
166
click to vote
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
We describe semidefinite programming methods for system realization and identification. For each of these two applications, a variant of a simple subspace algorithm is presented, i...
137
click to vote
EPIA
1995
Springer
15 years 10 months ago
1995
Springer
We provide a nine-valued logic to characterize the models of logic programs under a paraconsistent well-founded semantics with explicit negation WFSX p. We define a truth-function...
176
click to vote
AAAI
2008
15 years 9 months ago
2008
We formulate loop formulas for logic programs with arbitrary constraint atoms, for the semantics based on conditional satisfaction. This provides a method for answer set computati...