English
Related papers

Related papers: Product representation for default bilattices: an …

200 papers

This paper focuses on natural dualities for varieties of bilattice-based algebras.Such varieties have been widely studied as semantic models in situations where information is incomplete or inconsistent. The most popular tool for studying…

Rings and Algebras · Mathematics 2015-07-17 Leonardo Cabrer , Hilary Priestley

This paper studies algebras arising as algebraic semantics for logics used to model reasoning with incomplete or inconsistent information. In particular we study, in a uniform way, varieties of bilattices equipped with additional…

Rings and Algebras · Mathematics 2015-03-25 L. M. Cabrer , H. A. Priestley

This paper provides a fresh perspective on the representation of distributive bilattices and of related varieties. The techniques of naturalduality are employed to give, economically and in a uniform way, categories ofstructures dually…

Rings and Algebras · Mathematics 2014-01-16 L. M. Cabrer , H. A. Priestley

Bilattices provide an algebraic tool with which to model simultaneously knowledge and truth. They were introduced by Belnap in 1977 in a paper entitled \emph{How a computer should think}. Belnap argued that instead of using a logic with two…

Logic · Mathematics 2019-05-07 Andrew Craig , Brian A. Davey , Miroslav Haviar

Bilattices, which provide an algebraic tool for simultaneously modelling knowledge and truth, were introduced by N.D. Belnap in a 1977 paper entitled 'How a computer should think'. Prioritised default bilattices include not only Belnap's…

Logic · Mathematics 2020-12-16 Andrew Craig , Brian A. Davey , Miroslav Haviar

We introduce a proper multi-type display calculus for bilattice logic (with conflation) for which we prove soundness, completeness, conservativity, standard subformula property and cut-elimination. Our proposal builds on the product…

Logic · Mathematics 2017-09-08 Giuseppe Greco , Fei Liang , Alessandra Palmigiano , Umberto Rivieccio

The natural join and the inner union combine in different ways tables of a relational database. Tropashko [18] observed that these two operations are the meet and join in a class of lattices-called the relational lattices- and proposed…

Logic in Computer Science · Computer Science 2016-02-29 Luigi Santocanale

This paper fills a gap in the literature on natural duality theory. It concerns dual representations of categories of distributive-lattice-based algebras in which the lattice reducts are not assumed to have bounds. The development of theory…

Rings and Algebras · Mathematics 2020-02-18 Leonardo M. Cabrer , Hilary A. Priestley

Default logic can be regarded as a mechanism to represent families of belief sets of a reasoning agent. As such, it is inherently second-order. In this paper, we study the problem of representability of a family of theories as the set of…

Logic in Computer Science · Computer Science 2007-05-23 Victor Marek , Jan Treur , Miroslaw Truszczynski

A mixed lattice is a lattice-type structure consisting of a set with two partial orderings, and generalizing the notion of a lattice. Mixed lattice theory has previously been studied in various algebraic structures, such as groups and…

Combinatorics · Mathematics 2024-04-10 Jani Jokela

In this article we introduce theory and algorithms for learning discrete representations that take on a lattice that is embedded in an Euclidean space. Lattice representations possess an interesting combination of properties: a) they can be…

Machine Learning · Computer Science 2020-06-25 Luis A. Lastras

This paper presents a systematic study of coproducts. This is carried out principally, but not exclusively, for finitely generated quasivarieties A that admit a (term) reduct in the variety D of bounded distributive lattices. In this…

Rings and Algebras · Mathematics 2013-08-22 L. M. Cabrer , H. A. Priestley

A partial algebra construction of Gr\"atzer and Schmidt from "Characterizations of congruence lattices of abstract algebras" (Acta Sci. Math. (Szeged) 24 (1963), 34-59) is adapted to provide an alternative proof to a well-known fact that…

Rings and Algebras · Mathematics 2014-09-23 Brian T. Chan

Relational Lattice is a succinct mathematical model for Relational Algebra. It reduces the set of six classic relational algebra operators to two: natural join and inner union. In this paper we push relational lattice theory in two…

Databases · Computer Science 2009-03-24 Vadim Tropashko

Information algebras arise from the idea that information comes in pieces which can be aggregated or combined into new pieces, that information refers to questions and that from any piece of information, the part relevant to a given…

Information Theory · Computer Science 2021-01-01 Juerg Kohlas , Juerg Schmid

Dualization of a monotone Boolean function on a finite lattice can be represented by transforming the set of its minimal 1 to the set of its maximal 0 values. In this paper we consider finite lattices given by ordered sets of their meet and…

Logic in Computer Science · Computer Science 2015-12-31 Mikhail A. Babin , Sergei O. Kuznetsov

We introduce a proper display calculus for (non-distributive) Lattice Logic which is sound, complete, conservative, and enjoys cut-elimination and sub-formula property. Properness (i.e. closure under uniform substitution of all parametric…

Logic · Mathematics 2016-12-31 Giuseppe Greco , Alessandra Palmigiano

This paper introduces the order-theoretic concept of lattices along with the concept of consistent quantification where lattice elements are mapped to real numbers in such a way that preserves some aspect of the order-theoretic structure.…

Logic in Computer Science · Computer Science 2018-07-23 Kevin H. Knuth

We introduce a new formal model -- based on the mathematical construct of sheaves -- for representing contradictory information in textual sources. This model has the advantage of letting us (a) identify the causes of the inconsistency; (b)…

Computation and Language · Computer Science 2018-01-30 Wlodek Zadrozny , Luciana Garbayo

Description logics (DLs) are well-known knowledge representation formalisms focused on the representation of terminological knowledge. Due to their first-order semantics, these languages (in their classical form) are not suitable for…

Logic in Computer Science · Computer Science 2020-09-29 Leonard Botha , Thomas Meyer , Rafael Peñaloza
‹ Prev 1 2 3 10 Next ›