Conference Paper (59)
81.
Conference Paper
Plausible Inference for Default Conditionals. In: Symbolic and Quantitative Approaches to Reasoning and Uncertainty, pp. 356 - 363 (Eds. Clarke, M.; Kruse, R.; Moral, S.). European Conferences on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, Granada, Spain, November 08, 1993 - November 10, 1993. Springer, Berlin (1993)
Thesis - Habilitation (1)
82.
Thesis - Habilitation
Thema der Antrittsvorlesung: Transformation logischer Systeme. Habilitation, Universität des Saarlandes, Saarbrücken (1993)
Thesis - Diploma (1)
83.
Thesis - Diploma
Darstellung und Implementierung polynomieller und streng polynomieller Algorithmen für das Minimum-Cost-Flow-Problem. Diploma, X, 127 pp., Universität des Saarlandes, Saarbrücken (1993)
Report (66)
84.
Report
A needed narrowing strategy. Max-Planck-Institut für Informatik, Saarbrücken (1993), 28 pp.
85.
Report
Associative-commutative superposition. Max-Planck-Institut für Informatik, Saarbrücken (1993)
86.
Report
Ordered chaining for total orderings. Max-Planck-Institut für Informatik, Saarbrücken (1993), 20 pp.
87.
Report
Rewrite techniques for transitive relations. Max-Planck-Institut für Informatik, Saarbrücken (1993), 19 pp.
88.
Report
Basic paramodulation. Max-Planck-Institut für Informatik, Saarbrücken (1993), 36 pp.
89.
Report
A framework for program development based on schematic proof. Max-Planck-Institut für Informatik, Saarbrücken (1993), 12 pp.
90.
Report
Middle-out reasoning for logic program synthesis. Max-Planck-Institut für Informatik, Saarbrücken (1993), 12 pp.
91.
Report
A conservative extension of first-order logic and its application to theorem proving. Max-Planck-Institut für Informatik, Saarbrücken (1993), 11 pp.
92.
Report
Fast parallel space allocation, estimation and integer sorting (revised). Max-Planck-Institut für Informatik, Saarbrücken (1993), 85 pp.
93.
Report
A lower bound for area-universal graphs. Max-Planck-Institut für Informatik, Saarbrücken (1993), 7 pp.
94.
Report
Narrowing strategies for arbitrary canonical rewrite systems. Max-Planck-Institut für Informatik, Saarbrücken (1993), 29 pp.
95.
Report
Künstliche Intelligenz und Operations Research. Max-Planck-Institut für Informatik, Saarbrücken (1993), 36 pp.
96.
Report
The circuit subfunction relations are $sum^P_2$-complete. Max-Planck-Institut für Informatik, Saarbrücken (1993), 14 pp.
97.
Report
Towards automating duality. Max-Planck-Institut für Informatik, Saarbrücken (1993), 50 pp.
98.
Report
Negative set constraints: an easy proof of decidability. Max-Planck-Institut für Informatik, Saarbrücken (1993), 11 pp.
99.
Report
A lower bound for linear approximate compaction. Max-Planck-Institut für Informatik, Saarbrücken (1993), 12 pp.
100.
Report
Sensitive functions and approximate problems. Max-Planck-Institut für Informatik, Saarbrücken (1993), 8 pp.