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.

Charles C. Pinter

dblp:26/1815 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2016
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 first-authorSystems, architecture and hardware · 1 · 1 first-authorTheory of computation · 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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Electronic design automation · 100%
Theoretical computer science
1 paper
Computational complexity · 50% Logic in computer science · 50%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › logic synthesis › logic minimization
boolean function minimization
0.011971
On Simplifying Truth Functions: A Preliminary Reduction of Coreless Formulas · IEEE Trans. Computers 1971
Electronic design automation
logic synthesis
0.011971
On Simplifying Truth Functions: A Preliminary Reduction of Coreless Formulas · IEEE Trans. Computers 1971
Electronic design automation › logic synthesis › two-level logic minimization
prime implicant
0.011971
On Simplifying Truth Functions: A Preliminary Reduction of Coreless Formulas · IEEE Trans. Computers 1971
Computational complexity
boolean function theory
0.011971
On Simplifying Truth Functions: A Preliminary Reduction of Coreless Formulas · IEEE Trans. Computers 1971
Logic in computer science › propositional logic › boolean formula
disjunctive normal form
0.011971
On Simplifying Truth Functions: A Preliminary Reduction of Coreless Formulas · IEEE Trans. Computers 1971

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

pseudo-core computation · 0.0
YearPublicationVenuePosition
2016 Stone Space of cylindric Algebras and Topological Model Spaces
abstract
Abstract The Stone representation theorem was a milestone for the understanding of Boolean algebras. From Stone’s theorem, every Boolean algebra is representable as a field of sets with a topological structure. By means of this, the structural elements of any Boolean algebra, as well as the relations between them, are represented geometrically and can be clearly visualized. It is no different for cylindric algebras: Suppose that ${\frak A}$ is a cylindric algebra and ${\cal S}$ is the Stone space of its Boolean part. (Among the elements of the Boolean part are the diagonal elements.) It is known that with nothing more than a family of equivalence relations on ${\cal S}$ to represent quantifiers, ${\cal S}$ represents the full cylindric structure just as the Stone space alone represents the Boolean structure. ${\cal S}$ with this structure is called a cylindric space. Many assertions about cylindric algebras can be stated in terms of elementary topological properties of ${\cal S}$ . Moreover, points of ${\cal S}$ may be construed as models, and on that construal ${\cal S}$ is called a model space. Certain relations between points on this space turn out to be morphisms between models, and the space of models with these relations hints at the possibility of an “abstract” model theory. With these ideas, a point-set version of model theory is proposed, in the spirit of pointless topology or category theory, in which the central insight is to treat the semantic objects (models) homologously with the corresponding syntactic objects so they reside together in the same space. It is shown that there is a new, purely algebraic way of introducing constants in cylindric algebras, leading to a simplified proof of the representation theorem for locally finite cylindric algebras. Simple rich algebras emerge as homomorphic images of cylindric algebras. The topological version of this theorem is especially interesting: The Stone space of every locally finite cylindric algebra ${\frak A}$ can be partitioned into subspaces which are the Stone spaces of all the simple rich homomorphic images of ${\frak A}$ . Each of these images completely determines a model of ${\frak A}$ , and all denumerable models of ${\frak A}$ appear in this representation. The Stone space ${\cal S}$ of every cylindric algebra can likewise be partitioned into closed sets which are duals of all the types in ${\frak A}$ . This fact yields new insights into miscellaneous results in the model theory of saturated models.
Charles C. Pinter
J. Symb. Log.1
1995 Complexity of Network Training for Classes of Neural Networks
Charles C. Pinter
ALT1
1971 On Simplifying Truth Functions: A Preliminary Reduction of Coreless Formulas
abstract
The core of a truth function ø consists of those prime implicants of ø which are terms of every disjunctive normal formula equivalent to ø. The notion of core is generalized here: a class of prime implicants of ø is defined, called its "pseudo core." The pseudo core of ø consists of those prime implicants of ø which are terms of every one of a class Γ of normal equivalents of ø, where Γ includes a simplest normal equivalent. The pseudo core may be found easily and rapidly, plays the same role as the core in simplifying a formula, and may exist even in coreless formulas.
Charles C. Pinter
IEEE Trans. Computers1