778 search results - page 133 / 156 » Expressiveness and complexity of graph logic |
114
Voted
ICALP
2009
Springer
16 years 21 days ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
111
Voted
AAAI
1990
15 years 1 months ago
1990
This paper provides an account of the representation of defaults in Cyc and their semantics in terms of first order logic with reification. Default reasoning is a complex thing, a...
105
click to vote
ENTCS
2008
15 years 14 days ago
2008
The verification of quantitative aspects like performance and dependability by means of model checking has become an important and vivid area of research over the past decade. An ...
204
Voted
ICDT
2009
ACM
16 years 1 months ago
2009
ACM
We formalize and study business process systems that are centered around "business artifacts", or simply "artifacts". This approach focuses on data records, kn...
115
click to vote
NJC
2000
15 years 6 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 ...