VLDB 2026 Research / reviewers in the wild / expert
Satoru Niki
dblp:273/6472
· DBLP profile ↗
4ranked-venue papers
3as first author
2since 2021 · last 2024
0000-0002-0882-806XORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 4 · 3 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | To Be More Concrete About Abstracta and ConcretaabstractThe distinction between abstract and concrete entities, especially its precise characterization, remains underexplored in foundational ontology research. This paper aims to constitute the initial steps towards a formal ontology of abstracta and concreta. We begin by presenting three existing criteria (epistemic, spatiotemporal and causal) for the abstract/concrete distinction. We illustrate them with some well-known upper ontologies. After examining the shared assumption by the three criteria that any entity is either abstract or concrete but not both, we develop an alternative and more general framework for formally representing abstract and concrete entities. In particular, we propose a relational account of them by introducing the relation of “concretization”. The pivotal idea is that being abstract (or concrete) amounts to being concretized by (or concretizing) some other entity. We also briefly discuss a concretization-based reinterpretation of the spatiotemporal criterion and universals. Fumiaki Toyoshima, Satoru Niki |
FOIS | 2 |
| 2022 | Intuitionistic Modality and Beth Semantics
Satoru Niki |
AiML | 1 |
| 2020 | Actuality in Intuitionistic Logic
Satoru Niki, Hitoshi Omori |
AiML | 1 |
| 2020 | On Scott's semantics for many-valued logicabstractAbstract The semantics in ordered abelian groups Scott proposed for Łukasiewicz’s many-valued logic fails to be sound for one direction of one of the rules Scott gave for implication. We show this by a counterexample Urquhart has used to justify that in his own semantics, every formula has to have a least point at which it is valid. While this condition would make Scott’s semantics sound, it would cause a problem with its completeness. The question arises whether one can still amend Scott’s semantics so as to make it both sound and complete or better stick to Urquhart’s semantics anyway. Satoru Niki, Peter Schuster 0001 |
J. Log. Comput. | 1 |