778 search results - page 67 / 156 » Expressiveness and complexity of graph logic |
116
click to vote
ESOP
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We show how to formalise a constraint-based data flow analysis in the specification language of the Coq proof assistant. This involves defining a dependent type of lat...
117
click to vote
ATAL
2010
Springer
15 years 1 months ago
2010
Springer
We propose Alternating-time Dynamic Logic (ADL) as a multi-agent variant of Dynamic Logic in which atomic programs are replaced by coalitions. In ADL, the Dynamic Logic operators ...
109
Voted
FCS
2006
15 years 1 months ago
2006
- There is continuing research interest in comparison of the complexity of problems within the class NP-Complete. This paper examines the representational power of conjunctive norm...
112
Voted
CORR
2007
Springer
15 years 15 days ago
2007
Springer
We introduce ‘atomic flows’: they are graphs obtained from derivations by tracing atom occurrences and forgetting the logical structure. We study simple manipulations of atomi...
112
Voted
ML
2006
ACM
15 years 14 days ago
2006
ACM
The application of Inductive Logic Programming to scientific datasets has been highly successful. Such applications have led to breakthroughs in the domain of interest and have dri...