Publikationer pr. år
Publikationer 2003 2019
- 1 - 50 ud af 74 resultater
- Titel (stigende)
Active Integrity Constraints: from Theory to Implementation
Cruz-Filipe, L., Franz, M., Hakhverdyan, A., Ludovico, M., Nunes, I. & Schneider-Kamp, P., 2017, Knowledge Discovery, Knowledge Engineering and Knowledge Management: Proceedings of 7th the International Join Conference on Knowledge Disvovery, Knowledge Engineering, and Knowledge Management. Fred, A., Dietz, J. L. G., Aveiro, D., Liu, K. & Filipe, J. (red.). Springer, s. 399-420 (Communications in Computer and Information Science, Bind 631).Publikation: Bidrag til bog/antologi/rapport/konference-proceeding › Konferencebidrag i proceedings › Forskning › peer review
Active integrity constraints for general-purpose knowledge bases
Cruz-Filipe, L., Gaspar, G., Nunes, I. & Schneider-Kamp, P., 2018, I : Annals of Mathematics and Artificial Intelligence. 83, 3-4, s. 213-246Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › peer review
Active Integrity Constraints for Multi-context Systems
Cruz-Filipe, L., Gaspar, G., Nunes, I. & Schneider-Kamp, P., 2016, Knowledge Engineering and Knowledge Management: 20th International Conference, EKAW 2016, Bologna, Italy, November 19-23, 2016, Proceedings. Blomqvist, E., Ciancarini, P., Poggi, F. & Vitali, F. (red.). Springer, s. 98-112 (Lecture Notes in Computer Science, Bind 10024).Publikation: Bidrag til bog/antologi/rapport/konference-proceeding › Konferencebidrag i proceedings › Forskning › peer review
Adding constants to string rewriting
Thiemann, R., Zantema, H., Giesl, J. & Schneider-Kamp, P., 1. feb. 2008, I : Applicable Algebra in Engineering, Communications and Computing. 19, 1, s. 27-38 12 s.Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › peer review
A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog
Ströder, T., Emmes, F., Schneider-Kamp, P., Giesl, J. & Fuhs, C., 2012, Proceedings of the 14th International Symposium on Principles and Practice of Declarative Programming (PPDP '12). Association for Computing Machinery, s. 237-252 (Lecture Notes in Computer Science, Bind 7225).Publikation: Bidrag til bog/antologi/rapport/konference-proceeding › Konferencebidrag i proceedings › Forskning › peer review
A mixed neural network and support vector machine model for tender creation in the European union TED database
Kayte, S. & Schneider-Kamp, P., 2019, Proceedings of the 11th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management (IC3K 2019)). Bernardino, J., Salgado, A. & Filipe, J. (red.). SCITEPRESS Digital Library, Bind 3. s. 139-145 7 s.Publikation: Bidrag til bog/antologi/rapport/konference-proceeding › Konferencebidrag i proceedings › Forskning › peer review
Analyzing Program Termination and Complexity Automatically with AProVE
Giesl, J., Aschermann, C., Brockschmidt, M., Emmes, F., Frohn, F., Fuhs, C., Hensel, J., Otto, C., Plücker, M., Schneider-Kamp, P., Ströder, T., Swiderski, S. & Thiemann, R., 2017, I : Journal of Automated Reasoning. 58, 1, s. 3-31Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › peer review
Applying Sorting Networks to Synthesize Optimized Sorting Libraries
Codish, M., Cruz-Filipe, L., Nebel, M. & Schneider-Kamp, P., dec. 2015, Logic-Based Program Synthesis and Transformation: 25th International Symposium, LOPSTR 2015, Siena, Italy, July 13-15, 2015. Revised Selected Papers. Falaschi, M. (red.). Springer, s. 127-142 (Lecture Notes in Computer Science, Bind 9527).Publikation: Bidrag til bog/antologi/rapport/konference-proceeding › Konferencebidrag i proceedings › Forskning › peer review
AProVE 1.2: Automatic termination proofs in the dependency pair framework
Giesl, J., Schneider-Kamp, P. & Thiemann, R., 1. jan. 2006, Automated Reasoning - Third International Joint Conference, IJCAR 2006, Proceedings. Springer VS, s. 281-286 6 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 4130 LNAI).Publikation: Bidrag til bog/antologi/rapport/konference-proceeding › Konferencebidrag i proceedings › Forskning › peer review
Automated termination analysis for haskell: From term rewriting to programming languages
Giesl, J., Swiderski, S., Schneider-Kamp, P. & Thiemann, R., 1. jan. 2006, Term Rewriting and Applications - 17th International Conference, RTA 2006, Proceedings. Springer VS, s. 297-312 16 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 4098 LNCS).Publikation: Bidrag til bog/antologi/rapport/konference-proceeding › Konferencebidrag i proceedings › Forskning › peer review
Automated termination analysis for logic programs by term rewriting
Schneider-Kamp, P., Giesl, J., Serebrenik, A. & Thiemann, R., 28. aug. 2007, Logic-Based Program Synthesis and Transformation - 16th International Symposium, LOPSTR 2006 Revised Selected Papers. s. 177-193 17 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 4407 LNCS).Publikation: Bidrag til bog/antologi/rapport/konference-proceeding › Konferencebidrag i proceedings › Forskning › peer review
Automated Termination Analysis for Logic Programs with Cut
Schneider-Kamp, P., Giesl, J., Ströder, T., Serebrenik, A. & Thiemann, R., 2010, I : Theory and Practice of Logic Programming. 10, 4-6, s. 365 381 s.Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › peer review
Automated Termination Proofs for Haskell by Term Rewriting
Giesl, J., Raffelsieper, M., Schneider-Kamp, P., Swiderski, S. & Thiemann, R., 2011, I : A C M Transactions on Programming Languages and Systems. 33, 2, s. Article 7 39 s.Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › peer review
Automated Termination Proofs for Logic Programs by Term Rewriting
Schneider-Kamp, P., Giesl, J., Serebrenik, A. & Thiemann, R., 2009, I : ACM Transactions on Computational Logic. 11, 1, s. Article 2 52 s.Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › peer review
Automated termination proofs with AProVE
Giesl, J., Thiemann, R., Schneider-Kamp, P. & Falke, S., 1. dec. 2004, I : Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3091, s. 210-220 11 s.Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › peer review
Automatically Proving Termination and Memory Safety for Programs with Pointer Arithmetic
Ströder, T., Giesl, J., Brockschmidt, M., Frohn, F., Fuhs, C., Hensel, J., Schneider-Kamp, P. & Aschermann, C., 2017, I : Journal of Automated Reasoning. 58, 1, s. 33-65Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › peer review
Deciding innermost loops
Thiemann, R., Giesl, J. & Schneider-Kamp, P., 13. aug. 2008, Rewriting Techniques and Applications - 19th International Conference, RTA 2008, Proceedings. s. 366-380 15 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 5117 LNCS).Publikation: Bidrag til bog/antologi/rapport/konference-proceeding › Konferencebidrag i proceedings › Forskning › peer review
Dependency Triples for Improving Termination Analysis of Logic Programs with Cut
Ströder, T., Schneider-Kamp, P. & Giesl, J., 2011, Proceedings of the 20th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR '10). Springer, s. 184-199 (Lecture Notes in Computer Science, Bind 6564).Publikation: Bidrag til bog/antologi/rapport/konference-proceeding › Konferencebidrag i proceedings › Forskning › peer review
Design thinking for website optimization. A case study.
Somoza Sanchez, V. V., Andersen, F., Schneider-Kamp, P. & Goduscheit, R. C., 17. jan. 2018. 24 s.Publikation: Konferencebidrag uden forlag/tidsskrift › Paper › Forskning › peer review
Efficient Certified RAT Verification
Cruz-Filipe, L., Heule, M., Hunt, Jr, W., Kaufmann, M. & Schneider-Kamp, P., 2017, Automated Deduction - CADE 26: Proceedings of the 26th International Conference on Automated Deduction. de Moura, L. (red.). Springer, s. 220-236 (Lecture Notes in Computer Science, Bind 10395).Publikation: Bidrag til bog/antologi/rapport/konference-proceeding › Konferencebidrag i proceedings › Forskning › peer review
Efficient Certified Resolution Proof Checking
Cruz-Filipe, L., Marques-Silva, J. & Schneider-Kamp, P., 2017, Tools and Algorithms for the Construction and Analysis of Systems: Proceedings of the 3rd International Conference, TACAS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017. Legay, A. & Margaria, T. (red.). Springer, Bind Part I. s. 118-135 (Lecture Notes in Computer Science, Bind 10205).Publikation: Bidrag til bog/antologi/rapport/konference-proceeding › Konferencebidrag i proceedings › Forskning › peer review
Foreword
Hanus, M. & Schneider-Kamp, P., 2. sep. 2011, I : PPDP'11 - Proceedings of the 2011 Symposium on Principles and Practices of Declarative Programming.Publikation: Bidrag til tidsskrift › Leder › Forskning › peer review
Formalizing Size-Optimal Sorting Networks: Extracting a Certified Proof Checker
Cruz-Filipe, L. & Schneider-Kamp, P., 2015, Interactive Theorem Proving: 6th International Conference, ITP 2015, Nanjing, China, August 24-27, 2015, Proceedings. Urban, C. & Zhang, X. (red.). Springer, s. 154-169 (Lecture Notes in Computer Science, Bind 9236).Publikation: Bidrag til bog/antologi/rapport/konference-proceeding › Konferencebidrag i proceedings › Forskning › peer review
Formally Proving Size Optimality of Sorting Networks
Cruz-Filipe, L., Larsen, K. S. & Schneider-Kamp, P., 2017, I : Journal of Automated Reasoning. 59, 4, s. 425-454Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › peer review
Formally Proving the Boolean Triples Conjecture
Cruz-Filipe, L. & Schneider-Kamp, P., 2017, Proceedings of LPAR-21: 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning. Eiter, T. & Sands, D. (red.). EasyChair Publications, s. 509-522 (EPiC Series in Computing, Bind 46).Publikation: Bidrag til bog/antologi/rapport/konference-proceeding › Konferencebidrag i proceedings › Forskning › peer review
Formally Verifying the Solution to the Boolean Pythagorean Triples Problem
Cruz-Filipe, L., Marques-Silva, J. & Schneider-Kamp, P., okt. 2019, I : Journal of Automated Reasoning. 63, 3, s. 695-722 28 s.Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › peer review
Group Communication Patterns for High Performance Computing in Scala
Hargreaves, F. P., Merkle, D. & Schneider-Kamp, P., 2014, Proceedings of the 3rd ACM SIGPLAN Workshop on Functional High-Performance Computing. Association for Computing Machinery, s. 75-85Publikation: Bidrag til bog/antologi/rapport/konference-proceeding › Konferencebidrag i proceedings › Forskning › peer review
How to Get More Out of Your Oracles
Cruz-Filipe, L., Larsen, K. S. & Schneider-Kamp, P., 2017, Proceedings of the 8th International Conference on Interactive Theorem Proving. Ayala-Rincón, M. & Muñoz, C. A. (red.). Springer, s. 164-170 (Lecture Notes in Computer Science, Bind 10499).Publikation: Bidrag til bog/antologi/rapport/konference-proceeding › Konferencebidrag i proceedings › Forskning › peer review
Improved modular termination proofs using dependency pairs
Thiemann, R., Giesl, J. & Schneider-Kamp, P., 9. dec. 2004, I : Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science). 3097, s. 75-90 16 s.Publikation: Bidrag til tidsskrift › Konferenceartikel › Forskning › peer review
Improving context-sensitive dependency Pairs
Alarcón, B., Emmes, F., Fuhs, C., Giesl, J., Gutiérrez, R., Lucas, S., Schneider-Kamp, P. & Thiemann, R., 31. dec. 2008, Logic for Programming, Artificial Intelligence, and Reasoning - 15th International Conference, LPAR 2008, Proceedings. s. 636-651 16 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 5330 LNAI).Publikation: Bidrag til bog/antologi/rapport/konference-proceeding › Konferencebidrag i proceedings › Forskning › peer review
Improving dependency Pairs
Giesl, J., Thiemann, R., Schneider-Kamp, P. & Falke, S., 1. jan. 2003, Logic for Programming, Artificial Intelligence, and Reasoning. Voronkov, A. & Vardi, M. Y. (red.). Springer VS, s. 167-182 16 s. (Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science), Bind 2850).Publikation: Bidrag til bog/antologi/rapport/konference-proceeding › Konferencebidrag i proceedings › Forskning › peer review
Integrity Constraints for General-Purpose Knowledge Bases
Cruz-Filipe, L., Nunes, I. & Schneider-Kamp, P., 2016, FoIKS 2016: Proceedings of the 9th International Symposium on Foundations of Information and Knowledge Systems. Gyssens, M. & Simari, G. (red.). Springer, s. 235-254 (Lecture Notes in Computer Science, Bind 9616).Publikation: Bidrag til bog/antologi/rapport/konference-proceeding › Konferencebidrag i proceedings › Forskning › peer review
Is Big Data Overrated? The underestimated innovation challenges of BD management
Somoza Sanchez, V. V., Schneider-Kamp, P., Goduscheit, R. C. & Gerstlberger, W., 17. jan. 2019.Publikation: Konferencebidrag uden forlag/tidsskrift › Paper › Forskning › peer review
Lazy Abstractions for Size-Change Termination
Codish, M., Fuhs, C., Giesl, J. & Schneider-Kamp, P., 2010, International Conference on Logic for Programming Artificial Intelligence and Reasoning. Fermüller, C. G. & Voronkov, A. (red.). Springer, s. 217-232 (Lecture Notes in Computer Science, Bind 6397).Publikation: Bidrag til bog/antologi/rapport/konference-proceeding › Konferencebidrag i proceedings › Forskning › peer review
Loops under Strategies ... Continued
Thiemann, R., Sternagel, C., Giesl, J. & Schneider-Kamp, P., 2010, Proceedings of the Proceedings of the 1st International Workshop on Strategies in Rewriting, Proving, and Programming (IWS '10). Electronic Proceedings in Theoretical Computer Science, Bind 44.Publikation: Bidrag til bog/antologi/rapport/konference-proceeding › Konferencebidrag i proceedings › Forskning › peer review
Maximal termination
Fuhs, C., Giesl, J., Middeldorp, A., Schneider-Kamp, P., Thiemann, R. & Zankl, H., 13. aug. 2008, Rewriting Techniques and Applications - 19th International Conference, RTA 2008, Proceedings. s. 110-125 16 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 5117 LNCS).Publikation: Bidrag til bog/antologi/rapport/konference-proceeding › Konferencebidrag i proceedings › Forskning › peer review
Mechanizing and improving dependency pairs
Giesl, J., Thiemann, R., Schneider-Kamp, P. & Falke, S., 1. okt. 2006, I : Journal of Automated Reasoning. 37, 3, s. 155-203 49 s.Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › peer review
Optimal Base Encodings for Pseudo-Boolean Constraints
Codish, M., Fekete, Y., Fuhs, C. & Schneider-Kamp, P., 2010, Proceedings of the 17th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS '11). Springer, Bind 6605. 23 s.Publikation: Bidrag til bog/antologi/rapport/konference-proceeding › Konferencebidrag i proceedings › Forskning › peer review
Optimal-depth sorting networks
Bundala, D., Codish, M., Cruz-Filipe, L., Schneider-Kamp, P. & Závodný, J., 2017, I : Journal of Computer and System Sciences. 84, s. 185-204Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › peer review
Optimizing a Certified Proof Checker for a Large-Scale Computer-Generated Proof
Cruz-Filipe, L. & Schneider-Kamp, P., 2015, Intelligent Computer Mathematics: Proceedings of the 8th Conference on Intelligent Computer Mathematics (CICM 2015). Kerber, M., Carette, J., Kaliszyk, C., Rabe, F. & Sorge, V. (red.). Springer, s. 55-70 (Lecture Notes in Computer Science, Bind 9150).Publikation: Bidrag til bog/antologi/rapport/konference-proceeding › Konferencebidrag i proceedings › Forskning › peer review
Optimizing Sorting Algorithms by Using Sorting Networks
Codish, M., Cruz-Filipe, L., Nebel, M. & Schneider-Kamp, P., 2017, I : Formal Aspects of Computing. 29, 3, s. 559-579Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › peer review
Polytool: Polynomial Interpretations as a Basis for Termination Analysis of Logic Programs
Nguyen, M. T., De Schreye, D., Giesl, J. & Schneider-Kamp, P., 2011, I : Theory and Practice of Logic Programming. 11, s. 33-63Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › peer review
Proving and disproving termination of higher-order functions
Giesl, J., Thiemann, R. & Schneider-Kamp, P., 1. dec. 2005, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). s. 216-231 16 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 3717 LNAI).Publikation: Bidrag til bog/antologi/rapport/konference-proceeding › Konferencebidrag i proceedings › Forskning › peer review
Proving Termination and Memory Safety for Programs with Pointer Arithmetic
Ströder, T., Giesl, J., Brockschmidt, M., Frohn, F., Fuhs, C., Hensel, J. & Schneider-Kamp, P., 2014, Automated Reasoning: Proceedings of the 7th International Joint Conference on Automated Reasoning (IJCAR '14). Demri, S., Kapur, D. & Weidenbach, C. (red.). Springer, s. 208-223 16 s. (Lecture Notes in Computer Science, Bind 8562).Publikation: Bidrag til bog/antologi/rapport/konference-proceeding › Konferencebidrag i proceedings › Forskning › peer review
Proving termination and memory safety for programs with pointer arithmetic
Ströder, T., Giesl, J., Brockschmidt, M., Frohn, F., Fuhs, C., Hensel, J. & Schneider-Kamp, P., 2014Publikation: Bog/antologi/afhandling/rapport › Bog › Forskning › peer review
Proving termination by bounded increase
Giesl, J., Thiemann, R., Swiderski, S. & Schneider-Kamp, P., 15. okt. 2007, Automated Deduction - CADE-21 - 21st International Conference on Automated Deduction, Proceedings. s. 443-459 17 s. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Bind 4603 LNAI).Publikation: Bidrag til bog/antologi/rapport/konference-proceeding › Konferencebidrag i proceedings › Forskning › peer review
Proving Termination by Dependency Pairs and Inductive Theorem Proving
Fuhs, C., Giesl, J., Schneider-Kamp, P. & Parting, M., 2011, I : Journal of Automated Reasoning. 47, 2, s. 133-160Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › peer review
Proving Termination of Integer Term Rewriting
Fuhs, C., Giesl, J., Plücker, M., Schneider-Kamp, P. & Falke, S., 2009, Proceedings of the 20th International Conference on Rewriting Techniques and Applications (RTA '09). Springer, 15 s.Publikation: Bidrag til bog/antologi/rapport/konference-proceeding › Konferencebidrag i proceedings › Forskning › peer review
Proving Termination of Programs Automatically with AProVE
Giesl, J., Brockschmidt, M., Emmes, F., Frohn, F., Fuhs, C., Otto, C., Plücker, M., Schneider-Kamp, P., Ströder, T., Swiderski, S. & Thiemann, R., 2014, Automated Reasoning: Proceedings of the 7th International Joint Conference on Automated Reasoning (IJCAR '14). Demri, S., Kapur, D. & Weidenbach, C. (red.). Springer, s. 184-191 8 s. (Lecture Notes in Computer Science, Bind 8562).Publikation: Bidrag til bog/antologi/rapport/konference-proceeding › Konferencebidrag i proceedings › Forskning › peer review
Proving termination of programs automatically with AProVE
Giesl, J., Brockschmidt, M., Emmes, F., Frohn, F., Fuhs, C., Otto, C., Plücker, M., Schneider-Kamp, P., Ströder, T., Swiderski, S. & Thiemann, R., 2014Publikation: Bog/antologi/afhandling/rapport › Bog › Forskning › peer review