Published in: LIPIcs, Volume 98, 21st International Conference on Database Theory (ICDT 2018)
Jean Christoph Jung, Carsten Lutz, Mauricio Martel, and Thomas Schneider. Querying the Unary Negation Fragment with Regular Path Expressions. In 21st International Conference on Database Theory (ICDT 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 98, pp. 15:1-15:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{jung_et_al:LIPIcs.ICDT.2018.15, author = {Jung, Jean Christoph and Lutz, Carsten and Martel, Mauricio and Schneider, Thomas}, title = {{Querying the Unary Negation Fragment with Regular Path Expressions}}, booktitle = {21st International Conference on Database Theory (ICDT 2018)}, pages = {15:1--15:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-063-7}, ISSN = {1868-8969}, year = {2018}, volume = {98}, editor = {Kimelfeld, Benny and Amsterdamer, Yael}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2018.15}, URN = {urn:nbn:de:0030-drops-85971}, doi = {10.4230/LIPIcs.ICDT.2018.15}, annote = {Keywords: Query Answering, Regular Path Queries, Decidable Fragments of First-Order Logic, Computational Complexity} }
Published in: LIPIcs, Volume 80, 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)
Jean Christoph Jung, Carsten Lutz, Mauricio Martel, Thomas Schneider, and Frank Wolter. Conservative Extensions in Guarded and Two-Variable Fragments. In 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 80, pp. 108:1-108:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{jung_et_al:LIPIcs.ICALP.2017.108, author = {Jung, Jean Christoph and Lutz, Carsten and Martel, Mauricio and Schneider, Thomas and Wolter, Frank}, title = {{Conservative Extensions in Guarded and Two-Variable Fragments}}, booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)}, pages = {108:1--108:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-041-5}, ISSN = {1868-8969}, year = {2017}, volume = {80}, editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.108}, URN = {urn:nbn:de:0030-drops-74647}, doi = {10.4230/LIPIcs.ICALP.2017.108}, annote = {Keywords: Conservative Extensions, Decidable Fragments of First-Order Logic, Computational Complexity\}} }
Published in: Dagstuhl Seminar Proceedings, Volume 9411, Interaction versus Automation: The two Faces of Deduction (2010)
Stephan Swiderski, Michael Parting, Jürgen Giesl, Carsten Fuhs, and Peter Schneider-Kamp. Inductive Theorem Proving meets Dependency Pairs. In Interaction versus Automation: The two Faces of Deduction. Dagstuhl Seminar Proceedings, Volume 9411, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{swiderski_et_al:DagSemProc.09411.4, author = {Swiderski, Stephan and Parting, Michael and Giesl, J\"{u}rgen and Fuhs, Carsten and Schneider-Kamp, Peter}, title = {{Inductive Theorem Proving meets Dependency Pairs}}, booktitle = {Interaction versus Automation: The two Faces of Deduction}, pages = {1--4}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {9411}, editor = {Thomas Ball and J\"{u}rgen Giesl and Reiner H\"{a}hnle and Tobias Nipkow}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09411.4}, URN = {urn:nbn:de:0030-drops-24220}, doi = {10.4230/DagSemProc.09411.4}, annote = {Keywords: Termination, Term Rewriting, Dependency Pairs, Inductive Theorem Proving} }
Published in: Dagstuhl Seminar Proceedings, Volume 9411, Interaction versus Automation: The two Faces of Deduction (2010)
Carsten Fuhs, Jürgen Giesl, Martin Plücker, Peter Schneider-Kamp, and Stephan Falke. Termination of Integer Term Rewriting. In Interaction versus Automation: The two Faces of Deduction. Dagstuhl Seminar Proceedings, Volume 9411, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{fuhs_et_al:DagSemProc.09411.5, author = {Fuhs, Carsten and Giesl, J\"{u}rgen and Pl\"{u}cker, Martin and Schneider-Kamp, Peter and Falke, Stephan}, title = {{Termination of Integer Term Rewriting}}, booktitle = {Interaction versus Automation: The two Faces of Deduction}, pages = {1--4}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {9411}, editor = {Thomas Ball and J\"{u}rgen Giesl and Reiner H\"{a}hnle and Tobias Nipkow}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09411.5}, URN = {urn:nbn:de:0030-drops-24233}, doi = {10.4230/DagSemProc.09411.5}, annote = {Keywords: Termination analysis, integers, term rewriting, dependency pairs} }
Published in: Dagstuhl Seminar Proceedings, Volume 7401, Deduction and Decision Procedures (2007)
Peter Schneider-Kamp, Carsten Fuhs, René Thiemann, Jürgen Giesl, Elena Annov, Michael Codish, Aart Middeldorp, and Harald Zankl. Implementing RPO and POLO using SAT. In Deduction and Decision Procedures. Dagstuhl Seminar Proceedings, Volume 7401, pp. 1-10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{schneiderkamp_et_al:DagSemProc.07401.5, author = {Schneider-Kamp, Peter and Fuhs, Carsten and Thiemann, Ren\'{e} and Giesl, J\"{u}rgen and Annov, Elena and Codish, Michael and Middeldorp, Aart and Zankl, Harald}, title = {{Implementing RPO and POLO using SAT}}, booktitle = {Deduction and Decision Procedures}, pages = {1--10}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7401}, editor = {Franz Baader and Byron Cook and J\"{u}rgen Giesl and Robert Nieuwenhuis}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07401.5}, URN = {urn:nbn:de:0030-drops-12491}, doi = {10.4230/DagSemProc.07401.5}, annote = {Keywords: Termination, SAT, recursive path order, polynomial interpretation} }
Published in: Dagstuhl Seminar Proceedings, Volume 5021, Mathematics, Algorithms, Proofs (2006)
Carsten Schneider. Some Notes On ``When is 0.999... equal to 1?. In Mathematics, Algorithms, Proofs. Dagstuhl Seminar Proceedings, Volume 5021, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
@InProceedings{schneider:DagSemProc.05021.19, author = {Schneider, Carsten}, title = {{Some Notes On ``When is 0.999... equal to 1?}}, booktitle = {Mathematics, Algorithms, Proofs}, pages = {1--3}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2006}, volume = {5021}, editor = {Thierry Coquand and Henri Lombardi and Marie-Fran\c{c}oise Roy}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05021.19}, URN = {urn:nbn:de:0030-drops-2755}, doi = {10.4230/DagSemProc.05021.19}, annote = {Keywords: Symbolic summation, computer algebra, proofs, harmonic numbers, zeta-relations} }
Feedback for Dagstuhl Publishing