Dr. Claus-Peter Wirth
Dr. Claus-Peter Wirth
Research Fellow, FB AI, Hochschule Harz
Verified email at logic.at - Homepage
Title
Cited by
Cited by
Year
Proof Development with Ωmega
J Siekmann, C Benzmüller, V Brezhnev, L Cheikhrouhou, A Fiedler, ...
International Conference on Automated Deduction, 144-149, 2002
1112002
Hilbert's epsilon as an operator of indefinite committed choice
CP Wirth
Journal of Applied Logic 6 (3), 287-317, 2008
95*2008
Descente infinie+ deduction
CP Wirth
Logic Journal of IGPL 12 (1), 1-96, 2004
742004
A constructor-based approach to positive/negative-conditional equational specifications
CP Wirth, B Gramlich
Journal of Symbolic Computation 17 (1), 51-90, 1994
411994
How to Prove Inductive Theorems? QuodLibet!
J Avenhaus, U Kühler, T Schmidt-Samoa, CP Wirth
International Conference on Automated Deduction, 328-333, 2003
352003
A generic modular data structure for proof attempts alternating on ideas and granularity
S Autexier, C Benzmüller, D Dietrich, A Meier, CP Wirth
International Conference on Mathematical Knowledge Management, 126-142, 2005
342005
Positive/Negative-Conditional Equations: A Constructor-Based Framework for Specification and Inductive Theorem Proving. Schriftenreihe Forschungsergebnisse zur Informatik, ISBN …
CP Wirth
Verlag Dr. Kovac, Hamburg 31, 250, 1997
31*1997
Conditional equational specifications of data types with partial operations for inductive theorem proving
U Kühler, CP Wirth
International Conference on Rewriting Techniques and Applications, 38-52, 1997
281997
Conditional equational specifications of data types with partial operations for inductive theorem proving
U Kühler, CP Wirth
International Conference on Rewriting Techniques and Applications, 38-52, 1997
281997
On notions of inductive validity for first-order equational clauses
CP Wirth, B Gramlich
International Conference on Automated Deduction, 162-176, 1994
261994
Hilbert's epsilon as an operator of indefinite committed choice
CP Wirth
Journal of Applied Logic 6 (3), 287-317, 2008
192008
Syntactic confluence criteria for positive/negative-conditional term rewriting systems
CP Wirth
arXiv preprint arXiv:0902.3614, 2009
172009
History and future of implicit and inductionless induction: beware the old jade and the zombie!
CP Wirth
Mechanizing Mathematical Reasoning, 192-203, 2005
172005
Abstract notions and inference systems for proofs by mathematical induction
CP Wirth, K Becker
International Workshop on Conditional Term Rewriting Systems, 353-373, 1994
171994
Full First-Order Sequent and Tableau Calculi With Preservation of Solutions and the Liberalized δ-Rule but Without Skolemization
CP Wirth
International Workshop on First-Order Theorem Proving, 282-297, 1998
151998
Full First-Order Sequent and Tableau Calculi With Preservation of Solutions and the Liberalized δ-Rule but Without Skolemization
CP Wirth
International Workshop on First-Order Theorem Proving, 282-297, 1998
151998
Shallow confluence of conditional term rewriting systems
CP Wirth
Journal of Symbolic Computation 44 (1), 60-98, 2009
122009
Jacques Herbrand: Life, Logic, and Automated Deduction.
CP Wirth, JH Siekmann, C Benzmüller, S Autexier
Logic from Russell to Church, 195-254, 2009
112009
lim+, δ+, and Non-Permutability of β-Steps
CP Wirth
Journal of Symbolic Computation 47 (9), 1109-1135, 2012
10*2012
An algebraic dexter-based hypertext reference model
V Mattick, CP Wirth
arXiv preprint arXiv:0902.3648, 2009
102009
The system can't perform the operation now. Try again later.
Articles 1–20