TUD Logo

 Search 
TUD Home » ... » Institutes » Institute of Artificial Intelligence » Knowledge Representation and Reasoning » Publications

Faculty of Computer Science

Publications and Technical Reports
in Year 2013

Bibliography

1
Adrian Balint and Norbert Manthey.
Boosting the performance of sls and cdcl solvers by preprocessor tuning.
In Pragmatics of SAT(POS'13), 2013.

2
Pedro Barahona, Steffen Hölldobler, and Van Hau Nguyen.
Translating the At-Most-One Constraint to SAT.
In Doctoral Program, 19th International Conference on Principles and Practice of Constraint Programming 2013, Uppsala, Sweden, September 16-20, 2013.

3
Pedro Barahona, Steffen Hölldobler, and Van Hau Nguyen.
Efficient SAT-Encoding of Linear CSP Constraints.
In Proc. International Symposium on Artificial Intelligence and Mathematics (ISAIM-2014), Special session on Boolean and pseudo-Boolean Functions, January 6–8, Fort Lauderdale, FL, USA, 2014, to appear, 2014.

4
A. Belov, N. Manthey, and J. P. Marques-Silva.
Parallel mus extraction.
In M. Järvisalo and A. Van Gelder, editors, Theory and Applications of Satisfiability Testing - SAT 2013, volume 7962 of LNCS, pages 133-149. Springer, Berlin Heidelberg, 2013.

5
A. Bernstein, W. Effelsberg, S. Hölldobler, H.-P. Lenhof, K.-P. Löhr, P. Molitor, G. Neumann, R. Reischuk, N. Schweickardt, M. Spiliopoulou, H. Störrle, and S. Süsstrunk, editors.
Ausgezeichnete Informatikdissertationen 2012, volume D-13.
German Informatics Society, 2013.

6
Emmanuelle-Anna Dietz, Steffen Hölldobler, and Marco Ragni.
A Computational Logic Approach to the Abstract and the Social Case of the Selection Task.
Technical Report Knowledge Representation and Reasoning 13-03, Technische Universität Dresden, Technische Universität Dresden, 01062 Dresden, Germany, 2013.
Download: PDF file.

7
Emmanuelle-Anna Dietz, Steffen Hölldobler, and Marco Ragni.
A Computational Logic Approach to the Abstract and the Social Case of the Selection Task.
In Proceedings of the 11th International Symposium on Logical Formalizations of Commonsense Reasoning, 2013.

8
Emmanuelle-Anna Dietz, Steffen Hölldobler, and Christoph Wernhard.
Modeling the Suppression Task under Weak Completion and Well-Founded Semantics.
Technical Report Knowledge Representation and Reasoning 13-02, Technische Universität Dresden, Technische Universität Dresden, 01062 Dresden, Germany, 2013.
Download: PDF file.

9
Emmanuelle-Anna Dietz, Steffen Hölldobler, and Christoph Wernhard.
Modeling the suppression task under weak completion and well-founded semantics.
Journal of Applied Non-Classsical Logics, 2013.
to appear.

10
Kilian Gebhard and Norbert Manthey.
Parallel variable elimination on cnf formulas.
In Pragmatics of SAT(POS'13), 2013.

11
K. Gebhardt and N. Manthey.
Parallel variable elimination on CNF formulas.
In I. J. Timm and M. Thimm, editors, KI 2013: Advances in Artificial Intelligence,, volume 8077 of LNCS, pages 61-73. Springer, Berlin, Heidelberg, 2013.

12
S. Hölldobler and V.H. Nguyen.
On SAT-encodings of the at-most-one constraint.
In G. Katsirelos and C.-G. Quimpe, editors, Proceedings ModRef2013: The Twelfth International Workshop on Constraint Modelling and Reformulation, pages 1-17, 2013.

13
Steffen Hölldobler and Van Hau Nguyen.
An Efficient Encoding of the At-Most-One Constraint.
Technical report, Knowledge Representation and Reasoning Group 2013-04, Technische Universität Dresden, 01062 Dresden, Germany, 2013.

14
Steffen Hölldobler and Van Hau Nguyen.
An efficient encoding of the at-most-one constraint.
Technical Report Technical Report 2013-04, TU Dresden, Dresden, Germany, 2013.
Download: PDF file.

15
Steffen Hölldobler and Van Hau Nguyen.
On SAT-Encodings of the At-Most-One Constraint.
In George Katsirelos and Claude-Guy Quimper, editors, Proc. The Twelfth International Workshop on Constraint Modelling and Reformulation, Uppsala, Sweden, September 16-20, pages 1-17, 2013.

16
Ahmed Irfan, Davide Lanti, and Norbert Manthey.
Modern cooperative parallel sat solving.
In Pragmatics of SAT(POS'13), 2013.

17
Jana Kittelmann and Christoph Wernhard.
Semantik, Web, Metadaten und digitale Edition: Grundlagen und Ziele der Erschließung neuer Quellen des Branitzer Pückler-Archivs.
In Irene Krebs et al., editors, Resonanzen. Pücklerforschung im Spannungsfeld zwischen Wissenschaft und Kunst. Ein Konferenzbericht., pages 179-202. trafo Verlag, Berlin, 2013.

18
Vladimir Klebanov, Norbert Manthey, and Christian Muise.
SAT-based analysis and quantification of information flow in programs.
In K. R. Joshi, M. Siegle, M. Stoelinga, and P. R. D'Argenio, editors, Quantitative Evaluation of Systems,, volume 8054 of LNCS, pages 177-192. Springer, Berlin, Heidelberg, 2013.

19
Davide Lanti and Norbert Manthey.
Sharing Information in Parallel Search with Search Space Partitioning.
Technical Report 1, Knowledge Representation and Reasoning Group, Technische Universität Dresden, 01062 Dresden, Germany, 2013.
Download: PDF file.

20
Davide Lanti and Norbert Manthey.
Sharing information in parallel search with search space partitioning.
In Giuseppe Nicosia and Panos M. Pardalos, editors, LION, volume 7997 of Lecture Notes in Computer Science, pages 52-58. Springer, 2013.

21
Norbert Manthey, Tobias Philipp, and Christoph Wernhard.
Soundness of inprocessing in clause sharing SAT solvers.
In Matti Järvisalo and Allen Van Gelder, editors, Theory and Applications of Satisfiability Testing, 16th International Conference, SAT 2013, volume 7962 of LNCS, pages 22-39. Springer, 2013.
Received the SAT 2013 Best Paper Award.

22
Van Hau Nguyen, Miroslav N. Velev, and Pedro Barahona.
Application of Hierarchical Hybrid Encodings to Efficient Translation of CSPs to SAT.
In Proc. 2013 IEEE 25th International Conference on Tools with Artificial Intelligence (ICTAI2013), Special Track on SAT and CSP, November 4-6, Washington DC, USA, 2013, pages 1028-1035. Conference Publishing Services, 2013.

23
Christoph Wernhard.
Abduction in logic programming as second-order quantifier elimination.
Technical Report KRR 13-05, TU Dresden, 2013.
Download: PDF file.

24
Christoph Wernhard.
Abduction in logic programming as second-order quantifier elimination.
In Pascal Fontaine, Christophe Ringeissen, and Renate A. Schmidt, editors, 9th International Symposium on Frontiers of Combining Systems, FroCoS 2013, volume 8152 of LNCS (LNAI), pages 103-119. Springer, 2013.

25
Christoph Wernhard.
Computing with logic as operator elimination: The ToyElim system.
In Hans Tompits, Salvador Abreu, Johannes Oetsch, Jörg Pührer, Dietmar Seipel, Masanobu Umeda, and Armin Wolf, editors, Applications of Declarative Programming and Knowledge Management, 19th International Conference (INAP 2011) and 25th Workshop on Logic Programming(WLP 2011), Revised Selected Papers, volume 7773 of LNCS (LNAI), pages 289-296. Springer, 2013.