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 2014

Bibliography

1
Enrique Alfonso and Norbert Manthey.
New CNF features and formula classification.
In Daniel Le Berre, editor, POS-14, volume 27 of EPiC Series, pages 57-71. EasyChair, 2014.

2
Enrique M. Alfonso and Norbert Manthey.
Riss 4.27 BlackBox.
In Anton Belov, Daniel Diepold, Marijn J.H. Heule, and Matti Järvisalo, editors, Proceedings of SAT Competition 2014, volume B-2014-2 of Department of Computer Science Series of Publications B, pages 68-69. University of Helsinki, Helsinki, Finland, 2014.

3
Adrian Balint, Davide Lanti, Ahmed Irfan, and Norbert Manthey.
CLAS - A parallel SAT solver that combines CDCL, look-ahead and SLS search strategies.
In Anton Belov, Daniel Diepold, Marijn J.H. Heule, and Matti Järvisalo, editors, Proceedings of SAT Competition 2014, volume B-2014-2 of Department of Computer Science Series of Publications B, page 21. University of Helsinki, Helsinki, Finland, 2014.

4
Adrian Balint and Norbert Manthey.
SparrowToRiss.
In Anton Belov, Daniel Diepold, Marijn J.H. Heule, and Matti Järvisalo, editors, Proceedings of SAT Competition 2014, volume B-2014-2 of Department of Computer Science Series of Publications B, page 77. University of Helsinki, Helsinki, Finland, 2014.

5
Pedro Barahona, Steffen Hölldobler, and Van-Hau Nguyen.
Representative Encodings to Translate Finite CSPs into SAT.
In Simonis [28], pages 251-267.

6
Armin Biere, Daniel Le Berre, Emmanuel Lonca, and Norbert Manthey.
Détection de contraintes de cardinalité dans les CNF.
10ièmes Journées Francophones de Programmation par Contraintes (JFPC'14), pages 253-262, 2014.

7
Armin Biere, Daniel Le Berre, Emmanuel Lonca, and Norbert Manthey.
Detecting cardinality constraints in CNF.
In Carsten Sinz and Uwe Egly, editors, Theory and Applications of Satisfiability Testing ? SAT 2014, volume 8561 of Lecture Notes in Computer Science, pages 285-301. Springer International Publishing, 2014.

8
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, 24(1-2):61-85, 2014.

9
Marijn J.H. Heule, Norbert Manthey, and Tobias Philipp.
Validating unsatisfiability results of clause sharing parallel SAT solvers.
In Daniel Le Berre, editor, POS-14, volume 27 of EPiC Series, pages 12-25. EasyChair, 2014.

10
Steffen Hölldobler, Andrey Malikov, and Christoph Wernhard, editors.
Proceedings of the Young Scientists' International Workshop on Trends in Information Processing, YSIP, volume 1145 of CEUR Workshop Proceedings. CEUR-WS.org, 2014.

11
Steffen Hölldobler, Norbert Manthey, Tobias Philipp, and Peter Steinke.
Generic CDCL - A formalization of modern propositional satisfiability solvers.
In Daniel Le Berre, editor, POS-14, volume 27 of EPiC Series, pages 89-102. EasyChair, 2014.

12
Steffen Hölldobler, Norbert Manthey, Tobias Philipp, and Peter Steinke.
Generic CDCL - A formalization of modern propositional satisfiability solvers.
In Steffen Hölldobler, Andrey Malikov, and Christoph Wernhard, editors, Proceedings of the Young Scientists' International Workshop on Trends in Information Processing, 2014.

13
Jana Kittelmann and Christoph Wernhard.
Semantik, Linked Data, Web-Präsentation: Grundlagen der Nachlasserschlie├čung im Portal www.pueckler-digital.de.
In Anne Baillot and Anna Busch, editors, Workshop Datenmodellierung in digitalen Briefeditionen und ihre interpretatorische Leistung, 2014.

14
Davide Lanti, Ahmed Irfan, and Norbert Manthey.
Pcasso ?- a Parallel Cooperative Sat SOlver.
In Anton Belov, Daniel Diepold, Marijn J.H. Heule, and Matti Järvisalo, editors, Proceedings of SAT Competition 2014, volume B-2014-2 of Department of Computer Science Series of Publications B, page 56. University of Helsinki, Helsinki, Finland, 2014.

15
Norbert Manthey.
CDCL solver additions: Local look-ahead, all-unit-UIP learning and on-the-fly probing.
In Carsten Lutz and Michael Tielscher, editors, KI 2014: Advances in Artificial Intelligence, volume 8736 of Lecture Notes in Computer Science, pages 98-110. Springer Berlin Heidelberg, 2014.

16
Norbert Manthey.
Extended resolution in modern SAT solving.
In Joint Automated Reasoning Workshop and Deduktionstreffen, 2014.

17
Norbert Manthey.
Generating clique coloring problem formulas.
In Anton Belov, Daniel Diepold, Marijn J.H. Heule, and Matti Järvisalo, editors, Proceedings of SAT Competition 2014, volume B-2014-2 of Department of Computer Science Series of Publications B, page 89. University of Helsinki, Helsinki, Finland, 2014.

18
Norbert Manthey.
MinitSAT.
In Anton Belov, Daniel Diepold, Marijn J.H. Heule, and Matti Järvisalo, editors, Proceedings of SAT Competition 2014, volume B-2014-2 of Department of Computer Science Series of Publications B, page 48. University of Helsinki, Helsinki, Finland, 2014.

19
Norbert Manthey.
Riss 4.27.
In Anton Belov, Daniel Diepold, Marijn J.H. Heule, and Matti Järvisalo, editors, Proceedings of SAT Competition 2014, volume B-2014-2 of Department of Computer Science Series of Publications B, pages 65-67. University of Helsinki, Helsinki, Finland, 2014.

20
Norbert Manthey and Tobias Philipp.
Formula simplifications as DRAT derivations.
In Carsten Lutz and Michael Tielscher, editors, KI 2014: Advances in Artificial Intelligence, volume 8736 of Lecture Notes in Computer Science, pages 111-122. Springer Berlin Heidelberg, 2014.

21
Norbert Manthey, Tobias Philipp, and Peter Steinke.
A more compact translation of pseudo-Boolean constraints into CNF such that generalized arc consistency is maintained.
In Carsten Lutz and Michael Tielscher, editors, KI 2014: Advances in Artificial Intelligence, volume 8736 of Lecture Notes in Computer Science, pages 123-134. Springer Berlin Heidelberg, 2014.

22
Norbert Manthey and Peter Steinke.
Too many rooks.
In Anton Belov, Daniel Diepold, Marijn J.H. Heule, and Matti Järvisalo, editors, Proceedings of SAT Competition 2014, volume B-2014-2 of Department of Computer Science Series of Publications B, pages 97-98. University of Helsinki, Helsinki, Finland, 2014.

23
Van-Hau Nguyen and Thai Mai Son.
Solving the All-Interval Series Problem: SAT vs CP.
In 5th International Symposium on Information and Communication Technology, SoICT '14, Hanoi, Viet Nam - December 04 - 05, 2014, to appear, 2014.

24
Luís Moniz Pereira, Emmanuelle-Anna Dietz, and Steffen Hölldobler.
A computational logic approach to the belief bias effect.
In 14th International Conference on Principles of Knowledge Representation and Reasoning, KR 2014, Vienna, Austria, July 20-24, 2014, 2014.

25
Luís Moniz Pereira, Emmanuelle-Anna Dietz, and Steffen Hölldobler.
Contextual abductive reasoning with side-effects.
In Proceedings of the 30th International Conference on Logic Programming, ICLP 2014, Vienna, Austria, July 19-22, 2014, 2014.

26
Luís Moniz Pereira, Emmanuelle-Anna Dietz, and Steffen Hölldobler.
Contextual abductive reasoning with side-effects.
Journal of Theory and Practice of Logic Programming (TPLP), 14(4-5):633-648, 2014.

27
Tobias Philipp.
Clause simplifications in search-space decomposition-based SAT solvers.
In STAIRS 2014 - Proceedings of the 7th European Starting AI Researcher Symposium, Prague, Czech Republic, August 18-22, 2014, volume 264 of Frontiers in Artificial Intelligence and Applications, pages 211-219. IOS Press, 2014.

28
Helmut Simonis, editor.
Integration of AI and OR Techniques in Constraint Programming - 11th International Conference, CPAIOR 2014, Cork, Ireland, May 19-23, 2014. Proceedings, volume 8451 of Lecture Notes in Computer Science. Springer, 2014.

29
Peter Steinke and Norbert Manthey.
Pblib -- a c++ toolkit for encoding
pseudo-boolean constraints into cnf.
Technical Report 2014-01, TU Dresden, Dresden, Germany, 2014.
Download: PDF file.

30
Christoph Wernhard.
Application patterns of projection/forgetting.
In Laura Kovacs and Georg Weissenbacher, editors, Workshop on Interpolation: From Proofs to Applications (iPRA 2014), 2014.

31
Christoph Wernhard.
Expressing view-based query processing and related approaches with second-order operators.
Technical Report Knowledge Representation and Reasoning 14-02, Technische Universität Dresden, 2014.
Download: PDF file.

32
Christoph Wernhard.
Second-order characterizations of definientia in formula classes.
In Alexander Bolotov and Manfred Kerber, editors, Joint Automated Reasoning Workshop and Deduktionstreffen (ARW-DT 2014), pages 36-37, 2014.

33
Christoph Wernhard.
Second-order characterizations of definientia in formula classes.
Technical Report Knowledge Representation and Reasoning 14-03, Technische Universität Dresden, 2014.
Download: PDF file.