2022 search results - page 40 / 405 » Complexity of Non-Monotonic Logics |
92
Voted
AIML
2008
15 years 2 months ago
2008
In this paper we prove that Japaridze's Polymodal Logic is PSPACE-decidable. To show this, we describe a decision procedure for satisfiability on hereditarily ordered frames t...
131
click to vote
JLP
2011
14 years 7 months ago
2011
Formal languages for policy have been developed for access control and conformance checking. In this paper, we describe a formalism that combines features that have been developed...
158
Voted
AAAI
2011
14 years 18 days ago
2011
Inspired by “GoogleTM Sets” and Bayesian sets, we consider the problem of retrieving complex objects and relations among them, i.e., ground atoms from a logical concept, given...
120
Voted
MICRO
2010
IEEE
14 years 10 months ago
2010
IEEE
To extend the exponential performance scaling of future chip multiprocessors, improving energy efficiency has become a first-class priority. Single-chip heterogeneous computing ha...
113
Voted
TCS
2011
14 years 7 months ago
2011
We give a semantic account of the execution time (i.e. the number of cut elimination steps leading to the normal form) of an untyped MELL net. We first prove that: 1) a net is he...