394 search results - page 6 / 79 » Logical operations and Kolmogorov complexity |
103
Voted
IANDC
2007
14 years 11 months ago
2007
We investigate the complexity and expressive power of a spatial logic for reasoning about graphs. This logic was previously introduced by Cardelli, Gardner and Ghelli, and provide...
90
Voted
ITA
2007
14 years 11 months ago
2007
Abstract. This paper analyses the complexity of model checking Fixpoint Logic with Chop – an extension of the modal µ-calculus with a sequential composition operator. It uses tw...
93
Voted
JAPLL
2010
14 years 6 months ago
2010
The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments. In this p...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIMEcomplete in the presence of unrestricted axioms. Sev...
110
click to vote
ICS
2001
Tsinghua U.
15 years 4 months ago
2001
Tsinghua U.
The issue logic of dynamically scheduled superscalar processors is one of their most complex and power-consuming parts. In this paper we present alternative issue-logic designs th...