Filters








13,077 Hits in 2.1 sec

Super-Blocked Clauses [chapter]

Benjamin Kiesl, Martina Seidl, Hans Tompits, Armin Biere
2016 Lecture Notes in Computer Science  
We introduce more powerful generalizations, called set-blocked clauses and super-blocked clauses, respectively.  ...  A wide number of effective clause-elimination procedures is based on the clause-redundancy property called blocked clauses.  ...  set-blocked clauses and super-blocked clauses.  ... 
doi:10.1007/978-3-319-40229-1_5 fatcat:qgpj7i4thjdw5kwockiij2777i

Blockedness in Propositional Logic: Are You Satisfied With Your Neighborhood?

Benjamin Kiesl, Martina Seidl, Hans Tompits, Armin Biere
2017 Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence  
In this paper, we discuss powerful generalizations of blocked clauses that are still locally redundant, viz. set-blocked clauses and super-blocked clauses.  ...  We furthermore present complexity results for deciding whether a clause is set-blocked or super-blocked.  ...  Set-Blocking and Super-Blocking We now turn our attention to the local redundancy properties of set-blocked clauses and super-blocked clauses [Kiesl et al., 2016] .  ... 
doi:10.24963/ijcai.2017/687 dblp:conf/ijcai/KieslSTB17 fatcat:ku44r2deona7fnxx5kkgp3qlfm

Local Redundancy in SAT: Generalizations of Blocked Clauses [article]

Benjamin Kiesl, Martina Seidl, Hans Tompits, Armin Biere
2017 arXiv   pre-print
We furthermore introduce the syntax-based notions of set-blocking and super-blocking, and show that the latter coincides with our semantic blocking notion.  ...  For this reason, we say that the redundancy property of blocked clauses is local. In this paper, we show that there exist local redundancy properties that are even more general than blocked clauses.  ...  To see this, observe that for every k ∈ N + , C is k-super-blocked in F ′ if and only if it is 1-super-blocked in F ′ : If a clause is 1-super-blocked in a formula, then it is by definition also k-super-blocked  ... 
arXiv:1702.05527v2 fatcat:odttjqksrzhctm3fkkvo3wgex4

Classic Nintendo games are (computationally) hard

Greg Aloupis, Erik D. Demaine, Alan Guo, Giovanni Viglietta
2015 Theoretical Computer Science  
Our results apply to generalized versions of Super Mario Bros. 1-3, The Lost Levels, and Super Mario World; Donkey Kong Country 1-3; all Legend of Zelda games; all Metroid games; and all Pokémon role-playing  ...  In particular, Nadia Benbernou was involved in initial discussions of Super Mario Bros.  ...  Figure 8 :Figure 9 : 89 Left: Start gadget for Super Mario Bros. Right: The item block contains a Super Mushroom Finish gadget for Super Mario Bros.  ... 
doi:10.1016/j.tcs.2015.02.037 fatcat:tqa7e3gvvndozpvcyviyya3s4e

Classic Nintendo Games are (Computationally) Hard [article]

Greg Aloupis, Erik D. Demaine, Alan Guo, Giovanni Viglietta
2015 arXiv   pre-print
Our results apply to generalized versions of Super Mario Bros. 1-3, The Lost Levels, and Super Mario World; Donkey Kong Country 1-3; all Legend of Zelda games; all Metroid games; and all Pokemon role-playing  ...  In particular, Nadia Benbernou was involved in initial discussions of Super Mario Bros.  ...  Figure 8 :Figure 9 : 89 Left: Start gadget for Super Mario Bros. Right: The item block contains a Super Mushroom Finish gadget for Super Mario Bros.  ... 
arXiv:1203.1895v3 fatcat:pih6jluyw5d6tf6y63ix6h4zbm

The stable marriage problem with ties and restricted edges

Ágnes Cseh, Klaus Heeger
2020 Discrete Optimization  
Ties in the preferences allow for three different definitions for a stable matching: weak, strong and super-stability.  ...  A matching is called stable if it is not blocked by any pair of agents, who mutually prefer each other to their respective partner.  ...  Super-stable matchings are strongly stable and strongly stable matchings are weakly stable by definition, because weakly blocking edges are strongly blocking, and strongly blocking edges are super-blocking  ... 
doi:10.1016/j.disopt.2020.100571 fatcat:tr35jy4oxbg43nz7ezkiewpz7u

Stable Matching with Multilayer Approval Preferences: Approvals can be Harder than Strict Preferences [article]

Matthias Bentert, Niclas Boehmer, Klaus Heeger, Tomohiro Koana
2022 arXiv   pre-print
clauses and negatively in at most two clauses [6] .  ...  Consequently, if a and a ′ are a blocking pair in a layer in M , then they are also a blocking pair in the same layer in M * . Super Stability.  ...  Note that any pair of unmatched agents is a blocking pair in any empty layer.  ... 
arXiv:2205.07550v1 fatcat:n5jse36eafdabogjjass3jjs2q

Pairwise preferences in the stable marriage problem [article]

Ágnes Cseh, Attila Juhos
2018 arXiv   pre-print
We study all cases occurring when combining the three known notions of stability---weak, strong and super-stability---under the assumption that each side of the bipartite market obtains one of the six  ...  Super-stability In super-stability, an edge outside of M blocks M if neither of its end vertices prefer their matching edge to it. Definition 7 (blocking edge for super-stability).  ...  A blocking edge is at least as good as the matching edge for both end vertices in the super stable case.  ... 
arXiv:1810.00392v1 fatcat:z2ygftz4vfgezf7yag4mmsm2wq

A Whether Forecast [chapter]

Kjell Johan Sæbø
2007 Lecture Notes in Computer Science  
is necessary to assume an analysis of questions on which they denote propositions and to be more careful than has been customary about the formulation of the presuppositions of factive and what I call super-factive  ...  Observation The competition is at its strongest when a "strict" -super-factivepredicate combines with a whether clause.  ...  I will call these predicates super-factive.  ... 
doi:10.1007/978-3-540-75144-1_14 fatcat:crtsvgpmund6rfaj3p4p7unmzi

Jointly Stable Matchings

Shuichi Miyazaki, Kazuya Okamoto, Marc Herbstritt
2017 International Symposium on Algorithms and Computation  
We say that a matching is super-stable if it admits no blocking pair in super-stability.  ...  Thus (m, w) is a blocking pair in super-stability for M and therefore M is not super-stable in I . Conversely, suppose that M is not super-stable in I .  ... 
doi:10.4230/lipics.isaac.2017.56 dblp:conf/isaac/MiyazakiO17 fatcat:eeu7yzn4qbah5arxnumjvlo42y

Jointly stable matchings

Shuichi Miyazaki, Kazuya Okamoto
2019 Journal of combinatorial optimization  
We say that a matching is super-stable if it admits no blocking pair in super-stability.  ...  Thus (m, w) is a blocking pair in super-stability for M and therefore M is not super-stable in I . Conversely, suppose that M is not super-stable in I .  ... 
doi:10.1007/s10878-019-00402-4 fatcat:3mi43w2u6vdbfidfq7thrc2tni

Strongly Stable and Maximum Weakly Stable Noncrossing Matchings [article]

Koki Hamada, Shuichi Miyazaki, Kazuya Okamoto
2020 arXiv   pre-print
They defined two stability notions, strongly stable noncrossing matching (SSNM) and weakly stable noncrossing matching (WSNM), depending on the strength of blocking pairs.  ...  super-stability, a blocking pair for a matching M is an acceptable pair (m, w) ∈ M such that w m M (m) and m w M (w).  ...  In contrast, there is a simple instance that admits neither a strong-nor a super-WSNM (Fig. 9) . The empty matching is blocked by any acceptable pair.  ... 
arXiv:2001.08468v2 fatcat:fllsywcyozcglbwqgwcobsa3j4

'And I Turned Round to Her and Said...' A Preliminary Analysis of Shape and Structure in Women's Storytelling

Gillian Bennett
1989 Folklore  
The super-sentence and the and-linked block, which together we might term the ‘super-block, are a feature of 77.7% of all the stories in the corpus.  ...  Connie’s use of super-block, however, has another, very curious and important, effect.  ... 
doi:10.1080/0015587x.1989.9715764 fatcat:hrlepfsb3jfa5mq6sdjqtbtm2e

The effect of coordinate structure on the licensing of čto-clauses in noun complement constructions: An experimental study
Экспериментальное исследование приемлемости придаточных с союзом что в функции сентенциального актанта существительного в конструкциях с сочинением

Mikhail Yu. Knyazev
2020 Rhema  
licensing of čto-clauses.  ...  The paper presents the results of an acceptability rating study testing the prediction of this account, namely, that embedding the noun in a coordinate structure should block the incorporation and hence  ...  In statistical terms, this hypothesis predicts a (super-additive) interaction between factors frequency and clause type.  ... 
doi:10.31862/2500-2953-2020-1-56-69 fatcat:tm6wquff3nedziawvwwyr7gk7u

Stable partitions with W-preferences

Katarína Cechlárová, Jana Hajduková
2004 Discrete Applied Mathematics  
Any partition M that is not super W-stable, not strongly W-stable or not W-stable is sub-W-blocked, weakly W-blocked or W-blocked, respectively, by a singleton or a two-element set. Proof.  ...  A nonempty set Z ⊆ N sub-W-blocks a partition M, if (∀i ∈ Z)Z ¡ i M (i) and Z = M (i): A partition for which no sub-W-blocking set exists, is said to be super W-stable.  ... 
doi:10.1016/s0166-218x(03)00464-5 fatcat:mpwygbxrvzagja6zvgkb3ecvee
« Previous Showing results 1 — 15 out of 13,077 results