( en | de | ru )

 

Disambiguation of "Goebel, Randy"

Author of the publication

copydeleteadd this publication to your clipboard
Visualizing Web Navigation Data with Polygon Graphs.

, , , , , and . IV, page 232-237. IEEE Computer Society, (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Randy Jäger

Randy Kurz

Randy Eichin

Randy Koch

Randy J Lapolla

 

Other publications of authors with the same name

Submodular and supermodular multi-labeling, and vertex happiness., , and . CoRR, (2016)On Generality and Knowledge Transferability in Cross-Domain Duplicate Question Detection for Heterogeneous Community Question Answering., , , , , , and . CoRR, (2018)Strong Equivalence of Logic Programs with Abstract Constraint Atoms., , , , and . LPNMR, volume 6645 of Lecture Notes in Computer Science, page 161-173. Springer, (2011)Curried least general generalization: A framework for higher order concept learning., , and . PRICAI Workshops, volume 1359 of Lecture Notes in Computer Science, page 45-60. Springer, (1996)The role of default representations in incremental learning., , and . PRICAI Workshops, volume 1359 of Lecture Notes in Computer Science, page 92-105. Springer, (1996)Describing Plan Recognition as Nonmonotonic Reasoning and Belief Revision., and . Australian Joint Conference on Artificial Intelligence, volume 1342 of Lecture Notes in Computer Science, page 236-245. Springer, (1997)Taking Levi Identity Seriously: A Plea for Iterated Belief Contraction., , , and . KSEM, volume 4092 of Lecture Notes in Computer Science, page 305-317. Springer, (2006)Using Definite Clauses and Integrity Constraints as the Basis for a Theory Formation Approach to Diagnostic Reasoning., , and . ICLP, volume 225 of Lecture Notes in Computer Science, page 211-222. Springer, (1986)An Abductive Semantics for Disjunctive Logic Programs and Its Proof Procedure., , and . FSTTCS, volume 1346 of Lecture Notes in Computer Science, page 138-152. Springer, (1997)On eliminating loops in Prolog., and . ACM SIGPLAN Notices, 20 (8): 38-40 (1985)