Demo Data from EDBT 2026 / reviewers in the wild / expert
Eugene S. Santos
dblp:64/4973
· DBLP profile ↗
23ranked-venue papers
20as first author
0since 2021 · last 2003
0009-0002-0144-2348ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 14 · 14 first-authorDatabases, data management, data science and information retrieval · 5 · 5 first-authorArtificial intelligence and machine learning · 3Applied, 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
13 papers |
Automata and formal languages · 75% Mathematical optimization · 16% Coding theory · 8% |
Topics — the 15 heaviest of 16, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Knowledge, reasoning and agents › Knowledge representation and reasoning
abductive reasoning |
0.0 | 1 | 1996 | Polynomial Solvability of Cost-Based Abduction · Artif. Intell. 1996 |
Knowledge, reasoning and agents › Knowledge representation and reasoning › abductive reasoning
cost-based abduction |
0.0 | 1 | 1996 | Polynomial Solvability of Cost-Based Abduction · Artif. Intell. 1996 |
Automata and formal languages › probabilistic automata
probabilistic languages |
0.0 | 2 | 1975 | On Weak Regular Probabilistic Languages · Inf. Control. 1975 Regular Probabilistic Languages · Inf. Control. 1973 |
Automata and formal languages
stochastic machines |
0.0 | 2 | 1975 | State-Splitting for Stochastic Machines · SIAM J. Comput. 1975 Algebraic Structure Theory of Stochastic Machines · STOC 1971 |
Coding theory › constrained coding › finite-state encoders
state-splitting algorithm |
0.0 | 1 | 1975 | State-Splitting for Stochastic Machines · SIAM J. Comput. 1975 |
Automata and formal languages
probabilistic grammars |
0.0 | 1 | 1974 | A Note on Probabilistic Grammars · Inf. Control. 1974 |
Mathematical optimization › combinatorial optimization
covering problems |
0.0 | 1 | 1972 | First and Second Covering Problems on Quasi Stochastic Systems · Inf. Control. 1972 |
Automata and formal languages
formal grammars |
0.0 | 1 | 1972 | A Note on Bracketed Grammars · J. ACM 1972 |
Automata and formal languages › formal language classes
recursively enumerable languages |
0.0 | 1 | 1972 | A Note on Bracketed Grammars · J. ACM 1972 |
Automata and formal languages › probabilistic transition systems
stochastic finite-state systems |
0.0 | 1 | 1972 | Identification of Stochastic Finite-State Systems · Inf. Control. 1972 |
Mathematical optimization
stochastic systems |
0.0 | 1 | 1972 | First and Second Covering Problems on Quasi Stochastic Systems · Inf. Control. 1972 |
Mathematical optimization › control theory
system identification |
0.0 | 1 | 1972 | Identification of Stochastic Finite-State Systems · Inf. Control. 1972 |
Automata and formal languages
finite automata |
0.0 | 1 | 1971 | Algebraic Structure Theory of Stochastic Machines · STOC 1971 |
Automata and formal languages › finite automata
sequential machines |
0.0 | 1 | 1968 | General Formulation of Sequential Machines · Inf. Control. 1968 |
Distributed computing theory
concurrent systems |
0.0 | 1 | 1971 | Algebraic Structure Theory of Stochastic Machines · STOC 1971 |
Methods — techniques the papers use, named apart from their topics
stochastic generalization of covers · 0.0linear algebra · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2003 | Implicitly preserving semantics during incremental knowledge base acquisition under uncertainty
Eugene Santos Jr., Eugene S. Santos, Solomon Eyal Shimony |
Int. J. Approx. Reason. | 2 |
| 1999 | A framework for building knowledge-bases under uncertaintyabstractManaging uncertainty during the knowledge engineering process from elicitation to validation and verification requires a flexible, intuitive, and semantically sound knowledge representation. This is especially important since this process is typically highly interactive with the human user to add, update, and maintain knowledge. In this paper, we present a model of knowledge representation called Bayesian Knowledge-Bases (BKBs). It unifies a ‘if-then’ style rules with probability theory. We also consider the computational efficiency of reasoning over BKBs. We can show that through careful construction of the knowledge-base, reasoning is computationally tractable and can in fact be polynomial-time. BKBs are currently fielded in the PESKI intelligent system development environment. Eugene Santos Jr., Eugene S. Santos |
J. Exp. Theor. Artif. Intell. | 2 |
| 1996 | Polynomial Solvability of Cost-Based Abduction
Eugene Santos Jr., Eugene S. Santos |
Artif. Intell. | 2 |
| 1979 | Abstract families of relations
Eugene S. Santos |
Inf. Sci. | 1 |
| 1976 | Fuzzy automata and languages
Eugene S. Santos |
Inf. Sci. | 1 |
| 1976 | Fuzzy and probabilistic programs
Eugene S. Santos |
Inf. Sci. | 1 |
| 1975 | On Weak Regular Probabilistic Languages
Eugene S. Santos |
Inf. Control. | 1 |
| 1975 | Max-product grammars and languages
Eugene S. Santos |
Inf. Sci. | 1 |
| 1975 | Realizations of fuzzy languages by probabilistic, max-product, and maximin automata
Eugene S. Santos |
Inf. Sci. | 1 |
| 1975 | State-Splitting for Stochastic MachinesabstractIn this paper, a systematic theory of the “state-splitting” technique for the decomposition of stochastic machines is presented, which makes use of a stochastic generalization of the conventional concept of covers or set systems. Eugene S. Santos |
SIAM J. Comput. | 1 |
| 1974 | A Note on Probabilistic Grammars
Eugene S. Santos |
Inf. Control. | 1 |
| 1974 | Context-Free Fuzzy Languages
Eugene S. Santos |
Inf. Control. | 1 |
| 1973 | Regular Probabilistic Languages
Eugene S. Santos |
Inf. Control. | 1 |
| 1972 | First and Second Covering Problems on Quasi Stochastic Systems
Eugene S. Santos |
Inf. Control. | 1 |
| 1972 | Identification of Stochastic Finite-State Systems
Eugene S. Santos |
Inf. Control. | 1 |
| 1972 | Probabilistic Grammars and Automata
Eugene S. Santos |
Inf. Control. | 1 |
| 1972 | A Note on Bracketed GrammarsabstractIn this note we show that the family of languages generated by general two-type bracketed grammars coincides with the family of recursively enumerable languages. Eugene S. Santos |
J. ACM | 1 |
| 1972 | Algebraic Structure Theory of Stochastic Machines
Eugene S. Santos |
Math. Syst. Theory | 1 |
| 1971 | Algebraic Structure Theory of Stochastic MachinesabstractIn the present paper, an algebraic structure theory of stochastic machines is developed which contains both Bacon's theory [1] and Hartmanis' theory for deterministic machines [5] as special cases. Although the present theory is patterned after both theories, it exhibits many interesting features which are here-to-fore unknown. Among other things, it is shown that the basic concepts involved, e.g., partitions with substitution property, partition pairs, state-behavior realizations, are all equivalent to well-known concepts in linear algebra. Section II introduces the model of stochastic machines to be used in subsequent developments. In Section III, various types of realizations and assignments are introduced. The concepts of partitions with substitution property, partition pairs, etc. are introduced in Section III. The last section gives a formulation of a network of concurrently operating QSMs. Eugene S. Santos |
STOC | 1 |
| 1970 | Fuzzy Algorithms
Eugene S. Santos |
Inf. Control. | 1 |
| 1969 | Maximin Sequential-Like Machines and Chains
Eugene S. Santos |
Math. Syst. Theory | 1 |
| 1968 | Maximin Automata
Eugene S. Santos |
Inf. Control. | 1 |
| 1968 | General Formulation of Sequential Machines
Eugene S. Santos, William G. Wee |
Inf. Control. | 1 |