778 search results - page 97 / 156 » Expressiveness and complexity of graph logic |
104
click to vote
ICPADS
1996
IEEE
15 years 4 months ago
1996
IEEE
A new multiagent programmingparadigm based on the transactional logic model' is developed. This paradigm enables us to construct a Distributed agent transactional program (DA...
121
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
Abstract. We present a categorical denotational semantics for a database mapping, based on views, in the most general framework of a database integration/exchange. Developed databa...
103
Voted
CORR
2008
Springer
15 years 16 days ago
2008
Springer
Depth of an object concerns a tradeoff between computation time and excess of program length over the shortest program length required to obtain the object. It gives an unconditio...
101
Voted
JMLR
2010
14 years 7 months ago
2010
Logic-based probabilistic models (LBPMs) enable us to handle problems with uncertainty succinctly thanks to the expressive power of logic. However, most of LBPMs have restrictions...
198
Voted
PODS
2009
ACM
16 years 1 months ago
2009
ACM
For many years, finite model theory was viewed as the backbone of database theory, and database theory in turn supplied finite model theory with key motivations and problems. By n...