7 search results - page 1 / 2 » Resolution Games and Non-Liftable Resolution Orderings |
CSL
1994
Springer
13 years 8 months ago
1994
Springer
We prove the completeness of the combination of ordered resolution and factoring for a large class of non-liftable orderings, without the need for any additional rules like satura...
ECCC
2010
13 years 3 months ago
2010
Parameterized Resolution and, moreover, a general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider [16] (FOCS’07). In that paper, Dan...
FUIN
2010
13 years 3 months ago
2010
Abstract. Logic Programs with Annotated Disjunctions (LPADs) allow to express probabilistic information in logic programming. The semantics of an LPAD is given in terms of the well...
JCSS
2008
13 years 4 months ago
2008
We provide a characterization of the resolution width introduced in the context of propositional proof complexity in terms of the existential pebble game introduced in the context...
TWC
2010
12 years 11 months ago
2010
We propose a wireless access scheme which is based on a channel reservation sharing method for a group of mobile users. This proposed scheme exploits the mobility diversity of the ...