| 2009 |
|---|
| 24 | EE | Ingo Feinerer,
Gernot Salzer:
A comparison of tools for teaching formal software verification.
Formal Asp. Comput. 21(3): 293-301 (2009) |
| 2008 |
|---|
| 23 | EE | Victor Chepoi,
Nadia Creignou,
Miki Hermann,
Gernot Salzer:
Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics.
ISMVL 2008: 100-105 |
| 22 | EE | Àngel J. Gil,
Miki Hermann,
Gernot Salzer,
Bruno Zanuttini:
Efficient Algorithms for Description Problems over Finite Totally Ordered Domains.
SIAM J. Comput. 38(3): 922-945 (2008) |
| 21 | EE | Nadia Creignou,
Miki Hermann,
Andrei A. Krokhin,
Gernot Salzer:
Complexity of Clausal Constraints Over Chains.
Theory Comput. Syst. 42(2): 239-255 (2008) |
| 2007 |
|---|
| 20 | EE | Ingo Feinerer,
Gernot Salzer:
Consistency and Minimality of UML Class Specifications with Multiplicities and Uniqueness Constraints.
TASE 2007: 411-420 |
| 2006 |
|---|
| 19 | EE | Sébastien Limet,
Gernot Salzer:
Tree Tuple Languages from the Logic Programming Point of View.
J. Autom. Reasoning 37(4): 323-349 (2006) |
| 18 | | Sébastien Limet,
Gernot Salzer:
Basic Rewriting via Logic Programming, with an Application to the Reachability Problem.
Journal of Automata, Languages and Combinatorics 11(1): 107-142 (2006) |
| 2005 |
|---|
| 17 | EE | Robert A. Barta,
Gernot Salzer:
The tau Model, Formalizing Topic Maps.
APCCM 2005: 37-42 |
| 2004 |
|---|
| 16 | EE | Àngel J. Gil,
Miki Hermann,
Gernot Salzer,
Bruno Zanuttini:
Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains: Extended Abstract.
IJCAR 2004: 244-258 |
| 15 | EE | Sébastien Limet,
Gernot Salzer:
Proving Properties of Term Rewrite Systems via Logic Programs.
RTA 2004: 170-184 |
| 2003 |
|---|
| 14 | EE | Sébastien Limet,
Gernot Salzer:
Manipulating Tree Tuple Languages by Transforming Logic Programs.
Electr. Notes Theor. Comput. Sci. 86(1): (2003) |
| 2001 |
|---|
| 13 | | Matthias Baaz,
Christian G. Fermüller,
Gernot Salzer:
Automated Deduction for Many-Valued Logics.
Handbook of Automated Reasoning 2001: 1355-1402 |
| 2000 |
|---|
| 12 | | Ricardo Caferra,
Gernot Salzer:
Automated Deduction in Classical and Non-Classical Logics, Selected Papers
Springer 2000 |
| 11 | | Gernot Salzer:
Optimal Axiomatizations of Finitely Valued Logics.
Inf. Comput. 162(1-2): 185-205 (2000) |
| 1998 |
|---|
| 10 | EE | Miki Hermann,
Gernot Salzer:
On the Word, Subsumption, and Complement Problem for Recurrent Term Schematizations.
MFCS 1998: 257-266 |
| 9 | | Matthias Baaz,
Christian G. Fermüller,
Gernot Salzer,
Richard Zach:
Labeled Calculi and Finite-Valued Logics.
Studia Logica 61(1): 7-33 (1998) |
| 1996 |
|---|
| 8 | | Matthias Baaz,
Christian G. Fermüller,
Gernot Salzer,
Richard Zach:
MUltlog 1.0: Towards an Expert System for Many-Valued Logics.
CADE 1996: 226-230 |
| 7 | | Gernot Salzer:
Optimal Axiomatizations for Multiple-Valued Operators and Quantifiers Based on Semi-lattices.
CADE 1996: 688-702 |
| 6 | EE | Georg Gottlob,
Sherry Marcus,
Anil Nerode,
Gernot Salzer,
V. S. Subrahmanian:
A Non-Ground Realization of the Stable and Well-Founded Semantics.
Theor. Comput. Sci. 166(1&2): 221-262 (1996) |
| 1994 |
|---|
| 5 | | Gernot Salzer:
Primal Grammars and Unification Modulo a Binary Clause.
CADE 1994: 282-295 |
| 4 | | Matthias Baaz,
Gernot Salzer:
Semi-Unification and Generalizations of a Particularly Simple Form.
CSL 1994: 106-120 |
| 1993 |
|---|
| 3 | | Christian G. Fermüller,
Gernot Salzer:
Ordered Paramodulation and Resolution as Decision Procedure.
LPAR 1993: 122-133 |
| 1992 |
|---|
| 2 | | Gernot Salzer:
The Unification of Infinite Sets of Terms and Its Applications.
LPAR 1992: 409-420 |
| 1991 |
|---|
| 1 | | Gernot Salzer:
Deductive Generalization and Meta-Reasoning or How to Formalize Genesis.
ÖGAI 1991: 103-115 |
