Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Christoph Weidenbach
2010 – today
- 2013
[c32]- 2012
- [j11]Arnaud Fietzke, Christoph Weidenbach: Superposition as a Decision Procedure for Timed Automata. Mathematics in Computer Science 6(4): 409-425 (2012)
- [j10]Evgeny Kruglov, Christoph Weidenbach: Superposition Decides the First-Order Logic Fragment Over Ground Theories. Mathematics in Computer Science 6(4): 427-456 (2012)
- [c31]Pascal Fontaine, Stephan Merz, Christoph Weidenbach: Combination of Disjoint Theories: Beyond Decidability. IJCAR 2012: 256-270
- [c30]Martin Suda, Christoph Weidenbach: A PLTL-Prover Based on Labelled Superposition with Partial Model Guidance. IJCAR 2012: 537-543
- [c29]Jasmin Christian Blanchette, Andrei Popescu, Daniel Wand, Christoph Weidenbach: More SPASS with Isabelle - Superposition with Hard Sorts and Configurable Simplification. ITP 2012: 345-360
- [c28]Arnaud Fietzke, Evgeny Kruglov, Christoph Weidenbach: Automatic Generation of Invariants for Circular Derivations in SUP(LA). LPAR 2012: 197-211
- [c27]
- 2011
- [c26]Tianxiang Lu, Stephan Merz, Christoph Weidenbach: Towards Verification of the Pastry Protocol Using TLA + . FMOODS/FORTE 2011: 244-258
- [c25]Andreas Eggers, Evgeny Kruglov, Stefan Kupferschmid, Karsten Scheibler, Tino Teige, Christoph Weidenbach: Superposition Modulo Non-linear Arithmetic. FroCoS 2011: 119-134
- 2010
- [j9]Christoph Weidenbach, Patrick Wischnewski: Subterm contextual rewriting. AI Commun. 23(2-3): 97-109 (2010)
- [j8]Matthias Horbach, Christoph Weidenbach: Superposition for fixed domains. ACM Trans. Comput. Log. 11(4) (2010)
- [c24]Martin Suda, Christoph Weidenbach, Patrick Wischnewski: On the Saturation of YAGO. IJCAR 2010: 441-456
- [c23]Arnaud Fietzke, Holger Hermanns, Christoph Weidenbach: Superposition-Based Analysis of First-Order Probabilistic Timed Automata. LPAR (Yogyakarta) 2010: 302-316
2000 – 2009
- 2009
- [j7]Arnaud Fietzke, Christoph Weidenbach: Labelled splitting. Ann. Math. Artif. Intell. 55(1-2): 3-34 (2009)
- [c22]Christoph Weidenbach, Dilyana Dimova, Arnaud Fietzke, Rohit Kumar, Martin Suda, Patrick Wischnewski: SPASS Version 3.5. CADE 2009: 140-145
- [c21]Matthias Horbach, Christoph Weidenbach: Decidability Results for Saturation-Based Model Building. CADE 2009: 404-420
- [c20]Matthias Horbach, Christoph Weidenbach: Deciding the Inductive Validity of FOR ALL THERE EXISTS * Queries. CSL 2009: 332-347
- [c19]Ernst Althaus, Evgeny Kruglov, Christoph Weidenbach: Superposition Modulo Linear Arithmetic SUP(LA). FroCoS 2009: 84-99
- 2008
- [c18]
- [c17]
- [c16]
- [i1]
- 2007
- [c15]Tal Lev-Ami, Christoph Weidenbach, Thomas W. Reps, Mooly Sagiv: Labelled Clauses. CADE 2007: 311-327
- [c14]Christoph Weidenbach, Renate A. Schmidt, Thomas Hillenbrand, Rostislav Rusev, Dalibor Topic: System Description: SpassVersion 3.0. CADE 2007: 514-520
- 2002
- [c13]Christoph Weidenbach, Uwe Brahm, Thomas Hillenbrand, Enno Keen, Christian Theobald, Dalibor Topic: S PASS Version 2.0. CADE 2002: 275-279
- 2001
- [c12]Bijan Afshordel, Thomas Hillenbrand, Christoph Weidenbach: First-Order Atom Definitions Extended. LPAR 2001: 309-319
- [p2]Andreas Nonnengart, Christoph Weidenbach: Computing Small Clause Normal Forms. Handbook of Automated Reasoning 2001: 335-367
- [p1]Christoph Weidenbach: Combining Superposition, Sorts and Splitting. Handbook of Automated Reasoning 2001: 1965-2013
1990 – 1999
- 1999
- [c11]Christoph Weidenbach: Towards an Automatic Analysis of Security Protocols in First-Order Logic. CADE 1999: 314-328
- [c10]
- [c9]Ullrich Hustadt, Renate A. Schmidt, Christoph Weidenbach: MSPASS: Subsumption Testing with SPASS. Description Logics 1999
- 1998
- [j6]Reinhold Letz, Christoph Weidenbach: Paradigmen und Perspektiven der automatischen Deduktion. KI 12(4): 15-19 (1998)
- [c8]Andreas Nonnengart, Georg Rock, Christoph Weidenbach: On Generating Small Clause Normal Forms. CADE 1998: 397-411
- [c7]Florent Jacquemard, Christoph Meyer, Christoph Weidenbach: Unification in Extension of Shallow Equational Theories. RTA 1998: 76-90
- 1997
- [j5]
- [c6]Harald Ganzinger, Christoph Meyer, Christoph Weidenbach: Soft Typing for Ordered Resolution. CADE 1997: 321-335
- 1996
- [b1]Christoph Weidenbach: Computational aspects of a first-order logic with sorts. Universität Saarbrücken 1996, pp. I-XIII, 1-183
- [j4]Christoph Weidenbach: Unification in Sort Theories and Its Applications. Ann. Math. Artif. Intell. 18(2-4): 261-293 (1996)
- [c5]
- [c4]
- 1995
- [j3]Christoph Weidenbach: First-Order Tableaux with Sorts. Logic Journal of the IGPL 3(6): 887-906 (1995)
- [j2]Hans Jürgen Ohlbach, Christoph Weidenbach: A Note on Assumptions about Skolem Functions. J. Autom. Reasoning 15(2): 267-275 (1995)
- 1993
- [c3]
- 1992
- [j1]
- [c2]
- 1990
- [c1]Christoph Weidenbach, Hans Jürgen Ohlbach: A Resolution Calculus with Dynamic Sort Structures and Partial Functions. ECAI 1990: 688-693
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-17 21:10 CEST by the dblp team