English
Related papers

Related papers: Domains, Information Frames, Rough Sets: An Equiva…

200 papers

In \cite{sp25}, continuous information frames were introduced that capture exactly all continuous domains. They are obtained from the information frames considered in \cite{sp21} by omitting the conservativity requirement. Information…

Logic in Computer Science · Computer Science 2025-07-29 Dieter Spreen

A generalisation of Scott's information systems \cite{sco82} is presented that captures exactly all L-domains. The global consistency predicate in Scott's definition is relativised in such a way that there is a consistency predicate for…

Logic in Computer Science · Computer Science 2021-03-26 Dieter Spreen

Representations of domains mean in a general way representing a domain as a suitable family endowed with set-inclusion order of some mathematical structures. In this paper, representations of domains via CF-approximation spaces are…

Rings and Algebras · Mathematics 2023-06-22 Guojun Wu , Luoshan Xu

Closure space has proven to be a useful tool to restructure lattices and various order structures.This paper aims to provide a novel approach to characterizing some important kinds of continuous domains by means of closure spaces. By…

Logic in Computer Science · Computer Science 2022-02-04 Longchun Wang , Qingguo Li , Lanlun Guo

Formal Concept Analysis has proven to be an effective method of restructuring complete lattices and various algebraic domains. In this paper, the notions of attribute continuous formal context and continuous formal concept are introduced by…

Logic in Computer Science · Computer Science 2021-03-23 Longchun Wang Lankun Guo , Qingguo Li

Information systems with witnesses have been introduced in [D. Spreen. Generalised information systems capture L-domains. arXiv:1610.02260v2] as a logic-style representation of L-domains: The category of such information systems with…

Logic in Computer Science · Computer Science 2021-10-15 Dieter Spreen

Scott's information systems provide a categorically equivalent, intensional description of Scott domains and continuous functions. Following a well established pattern in denotational semantics, we define a linear version of information…

Logic in Computer Science · Computer Science 2010-04-08 A. Bucciarelli , A. Carraro , T. Ehrhard , A. Salibra

Basically information means selection within a domain (value or definition set) of possibilities. For objectifiable, comparable and precise information the domain should be the same for all. Therefore the global (online) definition of the…

Information Retrieval · Computer Science 2016-03-04 Wolfgang Orthuber

We present old and new characterizations of core spaces, alias worldwide web spaces, originally defined by the existence of supercompact neighborhood bases. The patch spaces of core spaces, obtained by joining the original topology with a…

Logic in Computer Science · Computer Science 2016-07-19 Marcel Erné

Web spaces, wide web spaces and worldwide web spaces (alias C-spaces) provide useful generalizations of continuous domains. We present new characterizations of such spaces and their patch spaces, obtained by joining the original topology…

General Topology · Mathematics 2023-06-22 Marcel Erné

Many real life optimization problems contain both hard and soft constraints, as well as qualitative conditional preferences. However, there is no single formalism to specify all three kinds of information. We therefore propose a framework,…

Artificial Intelligence · Computer Science 2009-05-26 Carmel Domshlak , Francesca Rossi , Kristen Brent Venable , Toby Walsh

This monograph is an ongoing revision of "Lectures On A Mathematical Theory of Computation" by Dana Scott. Scott's monograph uses a formulation of domains called neighborhood systems in which finite elements are selected subsets of a master…

Programming Languages · Computer Science 2016-06-15 Robert Cartwright , Rebecca Parsons , Moez AbdelGawad

Two groups of naturally arising questions in the mathematical theory of domains for denotational semantics are addressed. Domains are equipped with Scott topology and represent data types. Scott continuous functions represent computable…

Logic in Computer Science · Computer Science 2015-12-15 Michael A. Bukatin

Formal concept analysis has grown from a new branch of the mathematical field of lattice theory to a widely recognized tool in Computer Science and elsewhere. In order to fully benefit from this theory, we believe that it can be enriched…

Logic in Computer Science · Computer Science 2012-01-23 Pascal Hitzler , Markus Krötzsch , Guo-Qiang Zhang

In this paper, concepts of (topological) FS-approximation spaces are introduced. Representations of FS-domains and BF-domains via (topological) FS-approximation spaces are considered. It is proved that the collection of CF-closed sets in an…

Category Theory · Mathematics 2024-08-08 Guojun Wu , Luoshan Xu

Recently, J. D. Lawson encouraged the domain theory community to consider the scientific program of developing domain theory in the wider context of $T_0$ spaces instead of restricting to posets. In this paper, we respond to this calling…

Logic in Computer Science · Computer Science 2023-06-22 Hadrian Andradi , Weng Kin Ho

A concept of "evolving categories" is suggested to build a simple, scalable, mathematically consistent framework for representing in uniform way both data and algorithms. A state machine for executing algorithms becomes clear, rich and…

Data Structures and Algorithms · Computer Science 2007-05-23 Evgeny Yanenko

Scientific knowledge is constantly subject to a variety of changes due to new discoveries, alternative interpretations, and fresh perspectives. Understanding uncertainties associated with various stages of scientific inquiries is an…

Digital Libraries · Computer Science 2020-12-24 Chaomei Chen , Ming Song , Go Eun Heo

In this paper, facts existing in different domains are explored, which are comparable by their end result. Properties of various domains and the facts that are part of such a unit are also presented, examples of comparison and methods of…

Cryptography and Security · Computer Science 2007-05-23 Kirti Chawla

This work presents a quantitative framework for describing the overcompleteness of a large class of frames. It introduces notions of localization and approximation between two frames $\mathcal{F} = \{f_i\}_{i \in I}$ and $\mathcal{E} =…

Functional Analysis · Mathematics 2007-05-23 R. Balan , P. G. Casazza , C. Heil , Z. Landau
‹ Prev 1 2 3 10 Next ›