Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[4]
Hilfe
Suche: Author="Rosenthal, Erik"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Linearity and regularity with negation normal form
Reiner Hähnle
,
Neil V. Murray
,
Erik Rosenthal
Theoretical Computer Science
328
(3), 2004, pp. 325-354
A foundation for hybrid knowledge bases
James J. Lu
,
Neil V. Murray
,
Erik Rosenthal
Lecture Notes in Computer Science
1738
, 1999, pp. 155-167
On the relative merits of path dissolution and the method of analytic tableaux
Neil V. Murray
,
Erik Rosenthal
Theoretical Computer Science
131
(1), 1994, pp. 1-28
Dissolution: Making paths vanish
Neil V. Murray
,
Erik Rosenthal
Journal of the ACM
40
(3), 1993, July, pp. 504-535
Reexamining intractability of tableau methods
Neil V. Murray
,
Erik Rosenthal
Proceedings of the 1990 International Symposium on Symbolic and Algebraic Computation, ISSAC'90 (Tokyo, Japan, August 20-24, 1990)
, 1990, pp. 52-59
Employing path dissolution to shorten tableaux proofs
Neil V. Murray
,
Erik Rosenthal
Proceedings of the 1989 International Symposium on Symbolic and Algebraic Computation, ISSAC'89 (Portland, Oregon, July 17-19, 1989)
, 1989, pp. 373-381
Theory links: Applications to automated theorem proving
Neil V. Murray
,
Erik Rosenthal
Journal Symbolic Computation
4
(2), 1987, pp. 173-190
Inference with path resolution and semantic graphs
Neil V. Murray
,
Erik Rosenthal
Journal of the ACM
34
(2), 1987, pp. 225-254
On deleting links in semantic graphs
Neil V. Murray
,
Erik Rosenthal
Lecture Notes in Computer Science
229
, 1986, pp. 404-415