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.
Gernot Salzer
2010 – today
- 2012
[c16]Ingo Feinerer, Gerhard Niederbrucker, Gernot Salzer, Tanja Sisel: Configuration Repair via Flow Networks. ISMIS 2012: 321-330- 2011
- [c15]Ingo Feinerer, Gernot Salzer, Tanja Sisel: Reducing Multiplicities in Class Diagrams. MoDELS 2011: 379-393
- 2010
- [j10]Victor Chepoi, Nadia Creignou, Miki Hermann, Gernot Salzer: The Helly property and satisfiability of Boolean formulas defined on set families. Eur. J. Comb. 31(2): 502-516 (2010)
2000 – 2009
- 2009
- [j9]Ingo Feinerer, Gernot Salzer: A comparison of tools for teaching formal software verification. Formal Asp. Comput. 21(3): 293-301 (2009)
- [c14]Stefan Craß, eva Kühn, Gernot Salzer: Algebraic foundation of a data model for an extensible space-based collaboration protocol. IDEAS 2009: 301-306
- 2008
- [j8]Nadia Creignou, Miki Hermann, Andrei A. Krokhin, Gernot Salzer: Complexity of Clausal Constraints Over Chains. Theory Comput. Syst. 42(2): 239-255 (2008)
- [j7]À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)
- [c13]Victor Chepoi, Nadia Creignou, Miki Hermann, Gernot Salzer: Deciding the Satisfiability of Propositional Formulas in Finitely-Valued Signed Logics. ISMVL 2008: 100-105
- 2007
- [c12]Ingo Feinerer, Gernot Salzer: Consistency and Minimality of UML Class Specifications with Multiplicities and Uniqueness Constraints. TASE 2007: 411-420
- 2006
- [j6]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)
- [j5]Sébastien Limet, Gernot Salzer: Tree Tuple Languages from the Logic Programming Point of View. J. Autom. Reasoning 37(4): 323-349 (2006)
- 2005
- [c11]
- 2004
- [c10]À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
- [c9]Sébastien Limet, Gernot Salzer: Proving Properties of Term Rewrite Systems via Logic Programs. RTA 2004: 170-184
- 2003
- [j4]Sébastien Limet, Gernot Salzer: Manipulating Tree Tuple Languages by Transforming Logic Programs. Electr. Notes Theor. Comput. Sci. 86(1): 76-90 (2003)
- 2001
- [p1]Matthias Baaz, Christian G. Fermüller, Gernot Salzer: Automated Deduction for Many-Valued Logics. Handbook of Automated Reasoning 2001: 1355-1402
- 2000
- [j3]Gernot Salzer: Optimal Axiomatizations of Finitely Valued Logics. Inf. Comput. 162(1-2): 185-205 (2000)
- [e1]Ricardo Caferra, Gernot Salzer (Eds.): Automated Deduction in Classical and Non-Classical Logics, Selected Papers. Lecture Notes in Computer Science 1761, Springer 2000, ISBN 3-540-67190-0
1990 – 1999
- 1998
- [j2]Matthias Baaz, Christian G. Fermüller, Gernot Salzer, Richard Zach: Labeled Calculi and Finite-Valued Logics. Studia Logica 61(1): 7-33 (1998)
- [c8]Miki Hermann, Gernot Salzer: On the Word, Subsumption, and Complement Problem for Recurrent Term Schematizations. MFCS 1998: 257-266
- 1996
- [j1]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)
- [c7]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
- [c6]Gernot Salzer: Optimal Axiomatizations for Multiple-Valued Operators and Quantifiers Based on Semi-lattices. CADE 1996: 688-702
- 1994
- [c5]
- [c4]Matthias Baaz, Gernot Salzer: Semi-Unification and Generalizations of a Particularly Simple Form. CSL 1994: 106-120
- 1993
- [c3]Christian G. Fermüller, Gernot Salzer: Ordered Paramodulation and Resolution as Decision Procedure. LPAR 1993: 122-133
- 1992
- [c2]
- 1991
- [c1]Gernot Salzer: Deductive Generalization and Meta-Reasoning or How to Formalize Genesis. ÖGAI 1991: 103-115
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 22:07 CET by the dblp team