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
Demo Data from VLDB 2026 / reviewers in the wild / expert

Arie Tzvieli

dblp:81/3543 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1990
—ORCID · none

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

Databases, data management, data science and information retrieval · 2 · 2 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.

Theoretical computer science
1 paper
Logic in computer science · 100%

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

TopicWeightPapersLastEvidence papers
Logic in computer science
first-order logic		 0.011988
PL - A Probabilistic Logic · ICDE 1988
Logic in computer science › knowledge representation and reasoning › uncertainty reasoning
probabilistic logic		 0.011988
PL - A Probabilistic Logic · ICDE 1988
Logic in computer science › proof theory
soundness and completeness		 0.011988
PL - A Probabilistic Logic · ICDE 1988

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

probability estimates · 0.0
YearPublicationVenuePosition
1990 Possibility theory: An approach to computerized processing of uncertainty
Arie Tzvieli
 J. Am. Soc. Inf. Sci.1
1988 PL - A Probabilistic Logic
abstract
A description is given of a logic called PL, which uses probability estimates to express uncertainties (without adopting the conventional probability axioms). The author proposes a generalization of the logical interpretations of the connectives and quantifiers to this case. The notions of a formula, a structure, assignment, satisfaction, deduction, etc., are generalizations of the corresponding first-order ones. A method of assigning semantics to PL is proposed, and some of its properties are studied. The soundness and completeness of PL is studied. In particular, PL is shown to be compatible with the first-order predicate calculus.>
Arie Tzvieli
 ICDE1