Abstract and concrete categories
Abstract and concrete categories
Some results involving multilattice ideals and distributivity
Discrete Mathematics
Category theory for computing science
Category theory for computing science
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems
A New Algebraic Tool for Automatic Theorem Provers
Annals of Mathematics and Artificial Intelligence
Distributing probability over non-determinism
Mathematical Structures in Computer Science
Components as coalgebras: the refinement dimension
Theoretical Computer Science - Algebraic methodology and software technology
Fuzzy logic programming via multilattices
Fuzzy Sets and Systems
A coalgebraic approach to the semantics of the ambient calculus
Theoretical Computer Science - Algebra and coalgebra in computer science
Note on Some Order Properties Related to Processes Semantics (I)
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Computing with data non-determinism: Wait time management for peer-to-peer systems
Computer Communications
Non-deterministic ideal operators: An adequate tool for formalization in Data Bases
Discrete Applied Mathematics
Services and Contracts: Coalgebraically
Electronic Notes in Theoretical Computer Science (ENTCS)
Coalgebraic Trace Semantics for Combined Possibilitistic and Probabilistic Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Coinductive Properties of Causal Maps
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
G-Reactive Systems as Coalgebras
Electronic Notes in Theoretical Computer Science (ENTCS)
Using coalgebra and coinduction to define ontology-based multi-agent systems
International Journal of Metadata, Semantics and Ontologies
Automata and fixed point logic: A coalgebraic perspective
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Congruence relations on some hyperstructures
Annals of Mathematics and Artificial Intelligence
IBERAMIA-SBIA'06 Proceedings of the 2nd international joint conference, and Proceedings of the 10th Ibero-American Conference on AI 18th Brazilian conference on Advances in Artificial Intelligence
Coalgebraic models for reactive systems
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Non-deterministic algebraic structures for soft computing
IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part II
On residuation in multilattices: Filters, congruences, and homomorphisms
Fuzzy Sets and Systems
Hi-index | 0.07 |
Multilattices are a suitable generalization of lattices which enables to accommodate the formalization of non-deterministic computation; specifically, the algebraic characterization for multilattices provides a formal framework to develop tools in several fields of computer science. On the other hand, the usefulness of coalgebra theory has been increasing in the recent years, and its importance is undeniable. In this paper, somehow mimicking the use of universal algebra, we define a new kind of coalgebras (the ND-coalgebras) that allows to formalize non-determinism, and show that several concepts, widely used in computer science are, indeed, ND-coalgebras. Within this formal context, we study a minimal set of properties which provides a coalgebraic definition of multilattices.