7106 search results - page 257 / 1422 » Restricted Complexity, General Complexity |
143
click to vote
COCO
2010
Springer
15 years 8 months ago
2010
Springer
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...
143
click to vote
FLAIRS
2007
15 years 6 months ago
2007
In this paper we explore a class of belief update operators, in which the definition of the operator is compositional with respect to the sentence to be added. The goal is to pro...
193
click to vote
FASE
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. To guarantee the security of computer systems, it is necessary to define security permissions to restrict the access to the systems' resources. These permissions enf...
140
click to vote
ICFP
2010
ACM
15 years 5 months ago
2010
ACM
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...
161
click to vote
IANDC
2011
14 years 11 months ago
2011
Partial transition systems support abstract model checking of complex temporal propercombining both over- and under-approximatingabstractions into a single model. Over the years, ...