Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Peter K. Rathmann

dblp:72/4633 · also Peter Rathmann · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
0since 2021 · last 1994
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 3 · 2 first-authorArtificial intelligence and machine learning · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Knowledge representation and reasoning · 100%
Theoretical computer science
1 paper
Logic in computer science · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 100%
Databases, data mining, and information retrieval
1 paper
Indexing and storage engines · 100%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Knowledge representation and reasoning › nonmonotonic reasoning
circumscription
0.011994
Circumscription with Homomorphisms: Solving the Equality and Counterexample Problems · J. ACM 1994
Knowledge, reasoning and agents › Knowledge representation and reasoning
commonsense reasoning
0.011994
Circumscription with Homomorphisms: Solving the Equality and Counterexample Problems · J. ACM 1994
Logic in computer science › nonmonotonic reasoning
circumscription
0.011989
Circumscribing Equality · IJCAI 1989
Logic in computer science
equality
0.011989
Circumscribing Equality · IJCAI 1989
Indexing and storage engines
dynamic data structures
0.011984
Dynamic Data Structures on Optical Disks · ICDE 1984
Storage systems
optical storage
0.011984
Dynamic Data Structures on Optical Disks · ICDE 1984
Storage systems › storage hierarchy
secondary storage
0.011984
Dynamic Data Structures on Optical Disks · ICDE 1984

Methods — techniques the papers use, named apart from their topics

model theory · 0.0homomorphism · 0.0
YearPublicationVenuePosition
1994 Circumscription with Homomorphisms: Solving the Equality and Counterexample Problems
abstract
One important facet of common-sense reasoning is the ability to draw default conclusions about the state of the world, so that one can, for example, assume that a given bird flies in the absence of information to the contrary. A deficiency in the circumscriptive approach to common-sense reasoning has been its difficulties in producing default that Tweety ≠ Blutto using ordinary circumscription, or conclude by default that a particular bird flies, if some birds are known not to fly. In this paper, we introduce a new form of circumscription, based on homomorphisms between models, that remedies these two problems and still retains the major desirable properties of traditional forms of circumscription.
Peter K. Rathmann, Marianne Winslett, Mark S. Manasse
J. ACM1
1990 Partitioning and composing knowledge
Gio Wiederhold, Peter K. Rathmann, Thierry Barsalou, Byung Suk Lee 0001, Dallan Quass
Inf. Syst.2
1989 Circumscribing Equality
Peter K. Rathmann, Marianne Winslett
IJCAI1
1986 The Cost of Locking
Peter K. Rathmann
ICDT1
1984 Dynamic Data Structures on Optical Disks
abstract
Current data structures for online secondary storage depend on the ability to alter data once it is written. On an optical disk such modification is not possible, so new approaches are needed. In this paper, data structures which allow additions, logical deletions, and rapid access to data stored on optical disks are proposed and analyzed.
Peter K. Rathmann
ICDE1