default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristoph Wernhard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Christoph Wernhard, Wolfgang Bibel:
Investigations into Proof Structures. J. Autom. Reason. 68(4): 24 (2024)- [j4]Michael Benedikt, Cécilia Pradic, Christoph Wernhard:
Synthesizing nested relational queries from implicit specifications: via model theory and via proof theory. Log. Methods Comput. Sci. 20(3) (2024) - [c28]Jan Heuer
, Christoph Wernhard:
Synthesizing Strongly Equivalent Logic Programs: Beth Definability for Answer Set Programs via Craig Interpolation in First-Order Logic. IJCAR (1) 2024: 172-193 - [i19]Jan Heuer, Christoph Wernhard:
Synthesizing Strongly Equivalent Logic Programs: Beth Definability for Answer Set Programs via Craig Interpolation in First-Order Logic. CoRR abs/2402.07696 (2024) - 2023
- [c27]Christoph Wernhard:
Structure-Generating First-Order Theorem Proving. AReCCa@TABLEAUX 2023: 64-83 - [c26]Michael Benedikt, Cécilia Pradic, Christoph Wernhard:
Synthesizing Nested Relational Queries from Implicit Specifications. PODS 2023: 33-45 - [c25]Christoph Wernhard:
Range-Restricted and Horn Interpolation through Clausal Tableaux. TABLEAUX 2023: 3-23 - [c24]Michael Rawson, Christoph Wernhard, Zsolt Zombori, Wolfgang Bibel:
Lemmas: Generation, Selection, Application. TABLEAUX 2023: 153-174 - [i18]Michael Rawson, Christoph Wernhard, Zsolt Zombori, Wolfgang Bibel:
Lemmas: Generation, Selection, Application. CoRR abs/2303.05854 (2023) - [i17]Christoph Wernhard, Wolfgang Bibel:
Investigations into Proof Structures. CoRR abs/2304.12827 (2023) - [i16]Christoph Wernhard:
Range-Restricted Interpolation through Clausal Tableaux. CoRR abs/2306.03572 (2023) - 2022
- [c23]Christoph Wernhard:
Generating Compressed Combinatory Proof Structures: An Approach to Automated First-Order Theorem Proving. PAAR@IJCAR 2022 - [i15]Christoph Wernhard:
CD Tools - Condensed Detachment and Structure Generating Theorem Proving (System Description). CoRR abs/2207.08453 (2022) - [i14]Michael Benedikt, Cécilia Pradic, Christoph Wernhard:
Synthesizing Nested Relational Queries from Implicit Specifications. CoRR abs/2209.08299 (2022) - [i13]Christoph Wernhard:
Generating Compressed Combinatory Proof Structures - An Approach to Automated First-Order Theorem Proving. CoRR abs/2209.12592 (2022) - [i12]Michael Benedikt, Cécilia Pradic, Christoph Wernhard:
Synthesizing nested relational queries from implicit specifications: via model theory and via proof theory. CoRR abs/2212.03085 (2022) - 2021
- [j3]Christoph Wernhard:
Craig Interpolation with Clausal First-Order Tableaux. J. Autom. Reason. 65(5): 647-690 (2021) - [c22]Christoph Wernhard, Wolfgang Bibel:
Learning from Łukasiewicz and Meredith: Investigations into Proof Structures. CADE 2021: 58-75 - [c21]Christoph Wernhard:
Applying Second-Order Quantifier Elimination in Inspecting Gödel's Ontological Proof. SOQE@KR 2021: 98-111 - [e4]Renate A. Schmidt, Christoph Wernhard, Yizheng Zhao:
Proceedings of the Second Workshop on Second-Order Quantifier Elimination and Related Topics (SOQE 2021) associated with the 18th International Conference on Principles of Knowledge Representation and Reasoning (KR 2021), Online Event, November 4, 2021. CEUR Workshop Proceedings 3009, CEUR-WS.org 2021 [contents] - [i11]Christoph Wernhard, Wolfgang Bibel:
Learning from Łukasiewicz and Meredith: Investigations into Proof Structures (Extended Version). CoRR abs/2104.13645 (2021) - [i10]Christoph Wernhard:
Applying Second-Order Quantifier Elimination in Inspecting Gödel's Ontological Proof. CoRR abs/2110.11108 (2021) - 2020
- [i9]Jana Kittelmann, Christoph Wernhard:
KBSET - Knowledge-Based Support for Scholarly Editing and Text Processing with Declarative LaTeX Markup and a Core Written in SWI-Prolog. CoRR abs/2002.10329 (2020) - [i8]Christoph Wernhard:
Facets of the PIE Environment for Proving, Interpolating and Eliminating on the Basis of First-Order Logic. CoRR abs/2002.10892 (2020) - [i7]Christoph Wernhard:
Craig Interpolation with Clausal First-Order Tableaux. CoRR abs/2008.03489 (2020)
2010 – 2019
- 2019
- [c20]Christoph Wernhard:
Facets of the PIE Environment for Proving, Interpolating and Eliminating on the Basis of First-Order Logic. DECLARE 2019: 160-177 - [c19]Jana Kittelmann, Christoph Wernhard:
KBSET - Knowledge-Based Support for Scholarly Editing and Text Processing with Declarative [inline-graphic not available: see fulltext] Markup and a Core Written in SWI-Prolog. DECLARE 2019: 178-196 - [i6]Jana Kittelmann, Christoph Wernhard:
KBSET - Knowledge-Based Support for Scholarly Editing and Text Processing. CoRR abs/1908.11135 (2019) - [i5]Christoph Wernhard:
PIE - Proving, Interpolating and Eliminating on the Basis of First-Order Logic. CoRR abs/1908.11137 (2019) - 2018
- [i4]Christoph Wernhard:
Craig Interpolation and Access Interpolation with Clausal First-Order Tableaux. CoRR abs/1802.04982 (2018) - 2017
- [c18]Christoph Wernhard:
The Boolean Solution Problem from the Perspective of Predicate Logic. FroCoS 2017: 333-350 - [c17]Christoph Wernhard:
Approximating Resultants of Existential Second-Order Quantifier Elimination upon Universal Relational First-Order Formulas. SOQE 2017: 82-98 - [c16]Christoph Wernhard:
The Boolean Solution Problem from the Perspective of Predicate Logic (Abstract). SOQE 2017: 99-101 - [c15]Christoph Wernhard:
Early Steps of Second-Order Quantifier Elimination beyond the Monadic Case: The Correspondence between Heinrich Behmann and Wilhelm Ackermann 1928-1934 (Abstract). SOQE 2017: 102-105 - [e3]Patrick Koopmann, Sebastian Rudolph, Renate A. Schmidt, Christoph Wernhard:
Proceedings of the Workshop on Second-Order Quantifier Elimination and Related Topics (SOQE 2017), Dresden, Germany, December 6-8, 2017. CEUR Workshop Proceedings 2013, CEUR-WS.org 2017 [contents] - [e2]Steffen Hölldobler, Andrey Malikov, Christoph Wernhard:
YSIP2 - Proceedings of the Second Young Scientist's International Workshop on Trends in Information Processing, Dombai, Russian Federation, May 16-20, 2017. CEUR Workshop Proceedings 1837, CEUR-WS.org 2017 [contents] - [i3]Christoph Wernhard:
The Boolean Solution Problem from the Perspective of Predicate Logic - Extended Version. CoRR abs/1706.08329 (2017) - [i2]Christoph Wernhard:
Heinrich Behmann's Contributions to Second-Order Quantifier Elimination from the View of Computational Logic. CoRR abs/1712.06868 (2017) - 2016
- [c14]Christoph Wernhard:
The PIE Environment for First-Order-Based Proving, Interpolating and Eliminating. PAAR@IJCAR 2016: 125-138 - [c13]Jana Kittelmann, Christoph Wernhard:
Knowledge-Based Support for Scholarly Editing and Text Processing. DHd 2016 - 2015
- [c12]Christoph Wernhard:
Second-Order Quantifier Elimination on Relational Monadic Formulas - A Basic Method and Some Less Expected Applications. TABLEAUX 2015: 253-269 - 2014
- [j2]Emmanuelle-Anna Dietz, Steffen Hölldobler, Christoph Wernhard:
Modeling the suppression task under weak completion and well-founded semantics. J. Appl. Non Class. Logics 24(1-2): 61-85 (2014) - [e1]Steffen Hölldobler, Andrey Malikov, Christoph Wernhard:
Proceedings of the Young Scientists' International Workshop on Trends in Information Processing (YSIP) Co-located with the Sixth International Conference on Infocommunicational Technologies in Science, Production and Education (INFOCOM-6), Stavropol, Russian Federation, April 22-25, 2014. CEUR Workshop Proceedings 1145, CEUR-WS.org 2014 [contents] - 2013
- [c11]Christoph Wernhard:
Abduction in Logic Programming as Second-Order Quantifier Elimination. FroCos 2013: 103-119 - [c10]Norbert Manthey, Tobias Philipp, Christoph Wernhard:
Soundness of Inprocessing in Clause Sharing SAT Solvers. SAT 2013: 22-39 - 2012
- [j1]Christoph Wernhard:
Projection and scope-determined circumscription. J. Symb. Comput. 47(9): 1089-1108 (2012) - 2011
- [c9]Steffen Hölldobler, Tobias Philipp, Christoph Wernhard:
An Abductive Model for Human Reasoning. AAAI Spring Symposium: Logical Formalizations of Commonsense Reasoning 2011 - [c8]Christoph Wernhard:
Computing with Logic as Operator Elimination: The ToyElim System. INAP/WLP 2011: 289-296 - [i1]Christoph Wernhard:
Computing with Logic as Operator Elimination: The ToyElim System. CoRR abs/1108.4891 (2011) - 2010
- [c7]Christoph Wernhard:
Circumscription and Projection as Primitives of Logic Programming. ICLP (Technical Communications) 2010: 202-211
2000 – 2009
- 2009
- [b1]Christoph Wernhard:
Automated deduction for projection elimination. University of Koblenz-Landau, 2009, ISBN 978-3-89838-324-0, pp. 1-283 - [c6]Christoph Wernhard:
Literal Projection and Circumscription. FTP 2009 - [c5]Christoph Wernhard:
Tableaux for Projection Computation and Knowledge Compilation. TABLEAUX 2009: 325-340 - 2008
- [c4]Christoph Wernhard:
Literal Projection for First-Order Logic. JELIA 2008: 389-402 - 2007
- [c3]Björn Pelzer, Christoph Wernhard:
System Description: E-KRHyper. CADE 2007: 508-513 - 2004
- [c2]Christoph Wernhard:
Semantic Knowledge Partitioning. IJCAR Doctoral Programme 2004 - [c1]Christoph Wernhard:
Semantic Knowledge Partitioning. JELIA 2004: 552-564
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:44 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
