Items where Subject is "03-XX Mathematical logic and foundations > 03Bxx General logic > 03B05 Classical propositional logic"
![]() | Up a level |
- MSC Classification Numbers (17)
- 03-XX Mathematical logic and foundations (17)
- 03Bxx General logic (17)
- 03B05 Classical propositional logic (17)
- 03Bxx General logic (17)
- 03-XX Mathematical logic and foundations (17)
P
Porschen, Stefan
(2002)
On Generalizations of the Shadow Independent Set Problem.
Technical Report
, 18 p.
Porschen, Stefan
(2007)
On variable-weighted exact satisfiability problems.
Published in:
Annals of mathematics and artificial intelligence Vol. 51 (1).
pp. 27-54.
Porschen, Stefan
(2005)
A new parameterization of the shadow problem.
Technical Report
, 16 p.
Porschen, Stefan and Schmidt, Tatjana and Speckenmeyer, Ewald and Wotzlaw, Andreas
(2011)
XSAT and NAE-SAT of linear CNF classes.
Published in:
Discrete Applied Mathematics Vol. 167.
pp. 1-14.
ISSN 0166-218X
Porschen, Stefan and Speckenmeyer, Ewald
(2007)
Algorithms for Variable-Weighted 2-SAT and Dual Problems.
Technical Report
, 14 p.
Porschen, Stefan and Speckenmeyer, Ewald
(2007)
Clause Set Structures and Polynomial-Time SAT-Decidable Classes.
Technical Report
, 12 p.
Porschen, Stefan and Speckenmeyer, Ewald
(2007)
Clause set structures and satisfiability.
Technical Report
, 23 p.
Porschen, Stefan and Speckenmeyer, Ewald
(2007)
Satisfiability of Mixed Horn Formulas.
Published in:
Discrete applied mathematics Vol. 155 (11).
1408 -1419.
Porschen, Stefan and Speckenmeyer, Ewald and Randerath, Bert and Gärtner, Mattias
(2004)
Tabu-Sat and Walksat for Level Graph Formulas.
Technical Report
, 20 p.
Porschen, Stefan and Speckenmeyer, Ewald and Zhao, Xishun
(2006)
Linear CNF formulas and satisfiability.
Technical Report
, 37 p.
S
Speckenmeyer, Ewald and Wotzlaw, Andreas and Porschen, Stefan
(2011)
A Satisfiability-based Approach for Embedding Generalized Tanglegrams on Level Graphs.
Published In:
Theory and Applications of Satisfiability Testing - SAT 2011 : 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011. Proceedings, Lecture notes in computer science. 6695 Springer February 2011, pp. 134-144.
V
van der Grinten, Alexander and Wotzlaw, Andreas and Speckenmeyer, Ewald and Porschen, Stefan
(2012)
satUZK: Solver Description.
Published In:
Proceedings of SAT Challenge 2012; Solver and Benchmark Descriptions, Department of Computer Science Series of Publications B. 2012-2 University of Helsinki 2012, pp. 54-55.
W
Wotzlaw, Andreas and Speckenmeyer, Ewald and Porschen, Stefan
(2012)
Generalized k-ary tanglegrams on level graphs: a satisfiability-based approach and its evaluation.
Published in:
Discrete Applied Mathematics Vol. 160 (16-17).
pp. 2349-2363.
Wotzlaw, Andreas and Speckenmeyer, Ewald and Porschen, Stefan
(2012)
Probabilistic Analysis of Random Mixed Horn Formulas.
Technical Report
, 9 p.
Wotzlaw, Andreas and Speckenmeyer, Ewald and Porschen, Stefan (2012) A Satisfiability-based Approach for Generalized Tanglegrams on Level Graphs. , Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH. (Unpublished)
Wotzlaw, Andreas and van der Grinten, Alexander and Speckenmeyer, Ewald
(2013)
Effectiveness of pre- and inprocessing for CDCL-based SAT solving.
Technical Report
, 9 p.
Wotzlaw, Andreas and van der Grinten, Alexander and Speckenmeyer, Ewald and Porschen, Stefan
(2012)
pfolioUZK: Solver Description.
Published In:
Proceedings of SAT Challenge 2012; Solver and Benchmark Descriptions, Department of Computer Science Series of Publications B. 2012-2 University of Helsinki 2012, p. 45.