Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Computer Sciences (10)
- Systems Architecture (7)
- Arts and Humanities (5)
- Logic and Foundations of Mathematics (5)
- Other Mathematics (5)
-
- Philosophy (5)
- Algebra (3)
- Computer Engineering (3)
- Engineering (3)
- Environmental Sciences (3)
- Other Computer Engineering (3)
- Other Computer Sciences (3)
- Set Theory (3)
- Social and Behavioral Sciences (3)
- Artificial Intelligence and Robotics (2)
- Continental Philosophy (2)
- Creative Writing (2)
- Epistemology (2)
- Other Languages, Societies, and Cultures (2)
- Other Social and Behavioral Sciences (2)
- Philosophy of Mind (2)
- Philosophy of Science (2)
- Programming Languages and Compilers (2)
- Statistics and Probability (2)
- Theory and Algorithms (2)
- Applied Mathematics (1)
- Multivariate Analysis (1)
- Institution
- Keyword
-
- Data mining (5)
- Information Theory (5)
- Multivariate analysis discrete multivariate modeling (5)
- Probabilistic graphical modeling (5)
- Reconstructability Analysis (5)
-
- Coalgebra (2)
- Modal logic (2)
- Contextural Programming Paradigm (1)
- Decentralism (1)
- Descriptive general frames (1)
- HIV/AIDS research (1)
- Heterarchy (1)
- Kalkül (1)
- Kreativität (1)
- Kripke polynomial functors (1)
- Medicine (1)
- Modal expansion (1)
- Neutrosophic logic (1)
- Polycontexturality (1)
- Polycontexturality - Second-Order Cybernetics (1)
- Polykontexturalität (1)
- Polysemy (1)
- Semantic (1)
- Semantic web (1)
- Stone space (1)
- Stone spaces (1)
- Vietoris endofunctor (1)
- Vietoris topology (1)
- Web (1)
- Publication
- Publication Type
Articles 1 - 14 of 14
Full-Text Articles in Logic and Foundations
Enhancements To Crisp Possibilistic Reconstructability Analysis, Anas Al-Rabadi, Martin Zwick
Enhancements To Crisp Possibilistic Reconstructability Analysis, Anas Al-Rabadi, Martin Zwick
Systems Science Faculty Publications and Presentations
Modified Reconstructibility Analysis (MRA), a novel decomposition within the framework of set-theoretic (crisp possibilistic) Reconstructibility Analysis, is presented. It is shown that in some cases while 3-variable NPN-classified Boolean functions are not decomposable using Conventional Reconstructibility Analysis (CRA), they are decomposable using Modified Reconstructibility Analysis (MRA). Also, it is shown that whenever a decomposition of 3-variable NPN-classified Boolean functions exists in both MRA and CRA, MRA yields simpler or equal complexity decompositions. A comparison of the corresponding complexities for Ashenhurst-Curtis decompositions, and Modified Reconstructibility Analysis (MRA) is also presented. While both AC and MRA decompose some but …
Preface, Thomas Hildebrandt, Alexander Kurz
Preface, Thomas Hildebrandt, Alexander Kurz
Engineering Faculty Articles and Research
No abstract provided.
Miniaturen. Studien Zu Kalkül Und Kreativität 1998-2002, Rudolf Kaehr
Miniaturen. Studien Zu Kalkül Und Kreativität 1998-2002, Rudolf Kaehr
Rudolf Kaehr
Informatik, künstlerische Praktik und Kunsttheorie der digitalen Bildtechnologien NULL&NICHTS; weder leer, noch nicht – oder Kraut und Rüben Gedanken zu einer autonomen Medienwissenschaft Das Menschenbild aus der Sicht einer polykontexturalen Systemtheorie Thesen zum trans-klassischen Menschenbild Gebaute Phantasien, unkontrollierbare Schwankungen Kreativität und Kalkül Ver_Endungen in/der Programmierbarkeit Diagrammatik: Denken a la Carte Zur Verstörung des (H)ortes der Zerstörung Zur Kenogrammatik der Medientheorie
Dynamic Semantic Web, Rudolf Kaehr
Dynamic Semantic Web, Rudolf Kaehr
Rudolf Kaehr
Dynamic Semantic Web (DSW) is based at first on the techniques, methods and paradigms of the emerging Semantic Web movement and its applications. DSW is advancing one fundamental step further from a static to a dynamic concept of the Semantic Web with extended flexibility in the navigation between ontologies and more profound transparency of the informational system. Web Services are now redefinded by Semantic Web. To proof the advantages of DSW, it is the main aim of this project to develop the tools and methods necessary to develop a DSW based Web Service (DSW business application). The existing framework of …
Tesselland: A Mathematical Oddment, Martin Glover
Tesselland: A Mathematical Oddment, Martin Glover
Humanistic Mathematics Network Journal
No abstract provided.
Bridging To Infinity, Mike Pinter
Bridging To Infinity, Mike Pinter
Humanistic Mathematics Network Journal
The author's own experiences as a mathematics student and teacher have influenced how he thinks about the infinite. Author Madeleine L'Engle has also shaped his thinking with her writing. The author offers some thoughts that connect some of L'Engle's writing with his experience.
Mathematics, The Liberal Arts, And Slavish Devotions, J. D. Phillips
Mathematics, The Liberal Arts, And Slavish Devotions, J. D. Phillips
Humanistic Mathematics Network Journal
No abstract provided.
Analysis Of Social Aspects Of Migrant Labourers Living With Hiv/Aids Using Fuzzy Theory And Neutrosophic Cognitive Maps, Florentin Smarandache, W.B. Vasantha Kandasamy
Analysis Of Social Aspects Of Migrant Labourers Living With Hiv/Aids Using Fuzzy Theory And Neutrosophic Cognitive Maps, Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
Neutrosophic logic grew as an alternative to the existing topics and it represents a mathematical model of uncertainty, vagueness, ambiguity, imprecision, undefined-ness, unknown, incompleteness, inconsistency, redundancy and contradiction. Despite various attempts to reorient logic, there has remained an essential need for an alternative system that could infuse into itself a representation of the real world. Out of this need arose the system of neutrosophy and its connected logic, neutrosophic logic. This new logic, which allows also the concept of indeterminacy to play a role in any real-world problem, was introduced first by one of the authors Florentin Smarandache. In this …
Algebraic Semantics For Coalgebraic Logics, Clemens Kupke, Alexander Kurz, Dirk Pattinson
Algebraic Semantics For Coalgebraic Logics, Clemens Kupke, Alexander Kurz, Dirk Pattinson
Engineering Faculty Articles and Research
With coalgebras usually being defined in terms of an endofunctor T on sets, this paper shows that modal logics for T-coalgebras can be naturally described as functors L on boolean algebras. Building on this idea, we study soundness, completeness and expressiveness of coalgebraic logics from the perspective of duality theory. That is, given a logic L for coalgebras of an endofunctor T, we construct an endofunctor L such that L-algebras provide a sound and complete (algebraic) semantics of the logic. We show that if L is dual to T, then soundness and completeness of the algebraic semantics immediately yield the …
A Comparison Of Modified Reconstructability Analysis And Ashenhurst‐Curtis Decomposition Of Boolean Functions, Anas Al-Rabadi, Marek Perkowski, Martin Zwick
A Comparison Of Modified Reconstructability Analysis And Ashenhurst‐Curtis Decomposition Of Boolean Functions, Anas Al-Rabadi, Marek Perkowski, Martin Zwick
Systems Science Faculty Publications and Presentations
Modified reconstructability analysis (MRA), a novel decomposition technique within the framework of set‐theoretic (crisp possibilistic) reconstructability analysis, is applied to three‐variable NPN‐classified Boolean functions. MRA is superior to conventional reconstructability analysis, i.e. it decomposes more NPN functions. MRA is compared to Ashenhurst‐Curtis (AC) decomposition using two different complexity measures: log‐functionality, a measure suitable for machine learning, and the count of the total number of two‐input gates, a measure suitable for circuit design. MRA is superior to AC using the first of these measures, and is comparable to, but different from AC, using the second.
Modified Reconstructability Analysis For Many-Valued Functions And Relations, Anas Al-Rabadi, Martin Zwick
Modified Reconstructability Analysis For Many-Valued Functions And Relations, Anas Al-Rabadi, Martin Zwick
Systems Science Faculty Publications and Presentations
A novel many-valued decomposition within the framework of lossless Reconstructability Analysis is presented. In previous work, Modified Recontructability Analysis (MRA) was applied to Boolean functions, where it was shown that most Boolean functions not decomposable using conventional Reconstructability Analysis (CRA) are decomposable using MRA. Also, it was previously shown that whenever decomposition exists in both MRA and CRA, MRA yields simpler or equal complexity decompositions. In this paper, MRA is extended to many-valued logic functions, and logic structures that correspond to such decomposition are developed. It is shown that many-valued MRA can decompose many-valued functions when CRA fails to do …
State-Based Reconstructability Analysis, Martin Zwick, Michael S. Johnson
State-Based Reconstructability Analysis, Martin Zwick, Michael S. Johnson
Systems Science Faculty Publications and Presentations
Reconstructability analysis (RA) is a method for detecting and analyzing the structure of multivariate categorical data. While Jones and his colleagues extended the original variable‐based formulation of RA to encompass models defined in terms of system states, their focus was the analysis and approximation of real‐valued functions. In this paper, we separate two ideas that Jones had merged together: the “g to k” transformation and state‐based modeling. We relate the idea of state‐based modeling to established variable‐based RA concepts and methods, including structure lattices, search strategies, metrics of model quality, and the statistical evaluation of model fit for analyses based …
Reversible Modified Reconstructability Analysis Of Boolean Circuits And Its Quantum Computation, Anas Al-Rabadi, Martin Zwick
Reversible Modified Reconstructability Analysis Of Boolean Circuits And Its Quantum Computation, Anas Al-Rabadi, Martin Zwick
Systems Science Faculty Publications and Presentations
Modified Reconstructability Analysis (MRA) can be realized reversibly by utilizing Boolean reversible (3,3) logic gates that are universal in two arguments. The quantum computation of the reversible MRA circuits is also introduced. The reversible MRA transformations are given a quantum form by using the normal matrix representation of such gates. The MRA-based quantum decomposition may play an important role in the synthesis of logic structures using future technologies that consume less power and occupy less space.
Coalgebras And Modal Expansions Of Logics, Alexander Kurz, Alessandra Palmigiano
Coalgebras And Modal Expansions Of Logics, Alexander Kurz, Alessandra Palmigiano
Engineering Faculty Articles and Research
In this paper we construct a setting in which the question of when a logic supports a classical modal expansion can be made precise. Given a fully selfextensional logic S, we find sufficient conditions under which the Vietoris endofunctor V on S-referential algebras can be defined and we propose to define the modal expansions of S as the logic that arises from the V-coalgebras. As an example, we also show how the Vietoris endofunctor on referential algebras extends the Vietoris endofunctor on Stone spaces. From another point of view, we examine when a category of ‘spaces’ (X,A), ie sets X …