Stephan Schulz
Stephan Schulz
Professor of Computer Science, DHBW Stuttgart
Verified email at eprover.org - Homepage
TitleCited byYear
E–a brainiac theorem prover
S Schulz
Ai Communications 15 (2, 3), 111-126, 2002
5052002
System description: E 1.8
S Schulz
International Conference on Logic for Programming Artificial Intelligence …, 2013
2202013
New results on rewrite-based satisfiability procedures
A Armando, MP Bonacina, S Ranise, S Schulz
ACM Transactions on Computational Logic (TOCL) 10 (1), 4, 2009
1172009
System description: E 0.81
S Schulz
International Joint Conference on Automated Reasoning, 223-228, 2004
1142004
MathSAT: Tight Integration of SAT and Mathematical Decision Procedures
M Bozzano, R Bruttomesso, A Cimatti, T Junttila, P Van Rossum, S Schulz, ...
Journal of Automated Reasoning 35 (1-3), 265-293, 2005
922005
An incremental and layered procedure for the satisfiability of linear arithmetic logic
M Bozzano, R Bruttomesso, A Cimatti, T Junttila, P Van Rossum, S Schulz, ...
International Conference on Tools and Algorithms for the Construction and …, 2005
852005
Discount-a distributed and learning equational prover
J Denzinger, M Kronenburg, S Schulz
Journal of Automated Reasoning 18 (2), 189-198, 1997
811997
Using the TPTP language for writing derivations and finite interpretations
G Sutcliffe, S Schulz, K Claessen, A Van Gelder
International Joint Conference on Automated Reasoning, 67-81, 2006
742006
The mathsat 3 system
M Bozzano, R Bruttomesso, A Cimatti, T Junttila, P Van Rossum, S Schulz, ...
International Conference on Automated Deduction, 315-321, 2005
662005
TSTP data-exchange formats for automated theorem proving tools
G Sutcliffe, J Zimmer, S Schulz
Distributed Constraint Problem Solving and Reasoning in Multi-Agent Systems …, 2004
632004
Recording and analysing knowledge-based distributed deduction processes
J Denzinger, S Schulz
Journal of Symbolic Computation 21 (4-6), 523-541, 1996
561996
The TPTP typed first-order form with arithmetic
G Sutcliffe, S Schulz, K Claessen, P Baumgartner
International Conference on Logic for Programming Artificial Intelligence …, 2012
552012
System abstract: E 0.61
S Schulz
International Joint Conference on Automated Reasoning, 370-375, 2001
522001
Learning domain knowledge to improve theorem proving
J Denzinger, S Schulz
International Conference on Automated Deduction, 62-76, 1996
511996
On a rewriting approach to satisfiability procedures: extension, combination of theories and an experimental appraisal
A Armando, MP Bonacina, S Ranise, S Schulz
International Workshop on Frontiers of Combining Systems, 65-80, 2005
492005
Analysis and Representation of Equational Proofs Generated by a Distributed Completion Based Proof System
J Denzinger, S Schulz
46*1994
A Comparison of Different Techniques for Grounding Near-Propositional CNF Formulae.
S Schulz
FLAIRS Conference, 72-76, 2002
432002
Learning search control knowledge for equational theorem proving
S Schulz
Annual Conference on Artificial Intelligence, 320-334, 2001
372001
System abstract: E 0.3
S Schulz
International Conference on Automated Deduction, 297-301, 1999
361999
Learning search control knowledge for equational deduction. Number 230 in DISKI
S Schulz
Akademische Verlagsgesellschaft Aka GmbH Berlin, 2000
352000
The system can't perform the operation now. Try again later.
Articles 1–20