1438 search results - page 120 / 288 » An Expressive Extension of TLC |
102
click to vote
JCSS
2000
15 years 19 days ago
2000
It is a well-known result of Fagin that the complexity class NP coincides with the class of problems expressible in existential second-order logic ( 1 1), which allows sentences c...
111
Voted
ECAI
1998
Springer
15 years 4 months ago
1998
Springer
Abstract. We extend different Description Logics by concrete domains (such as integers and reals) and by aggregation functions over these domains (such as min;max;count;sum), which...
118
click to vote
NJC
2000
15 years 19 days ago
2000
We show how linear typing can be used to obtain functional programs which modify heap-allocated data structures in place. We present this both as a "design pattern" for ...
198
click to vote
POPL
2006
ACM
16 years 1 months ago
2006
ACM
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
102
click to vote
ICDM
2009
IEEE
15 years 7 months ago
2009
IEEE
—With the vast increase in collection and storage of data, the problem of data summarization is most critical for effective data management. Since much of this data is categorica...