2084 search results - page 291 / 417 » Set Constraints in Logic Programming |
FSTTCS
2004
Springer
14 years 1 months ago
2004
Springer
We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA pr...
RSCTC
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. This paper focuses on the use and interpretation of approximate databases where both rough sets and indiscernibility partitions are generalized and replaced by approximat...
COOPIS
1994
IEEE
14 years 10 days ago
1994
IEEE
We present a logical framework for representing the agents in two different cooperating information systems. We define an architecture for Integrated Supply Chain Management in wh...
POPL
2012
ACM
12 years 3 months ago
2012
ACM
We present a general theory of Gifford-style type and effect annotations, where effect annotations are sets of effects. Generality is achieved by recourse to the theory of algebra...
WWW
2007
ACM
14 years 9 months ago
2007
ACM
Data-driven web applications are usually structured in three tiers with different programming models at each tier. This division forces developers to manually partition applicatio...