We introduce the use of asynchronous logic automata (ALA) for cryptography. ALA aligns the descriptions of hardware and software for portability, programmability, and scalability. ...
Peter Schmidt-Nielsen, Kailiang Chen, Jonathan Bac...
Abstract. aRa is an automatic theorem prover for various kinds of relation algebras. It is based on Gordeev’s Reduction Predicate Calculi for n-variable logic (RPCn) which allow ...
Ontologies and datasets for the Semantic Web are encoded in OWL formalisms that are not easily comprehended by people. To make ontologies accessible to human domain experts, sever...
This paper presents a new approach to the tracking of regions in an image sequence. Unlike most other methods, the proposed approach can handle topology changes, i.e., regions may...
Abdol-Reza Mansouri, Antoine Olivier, Janusz Konra...
Fuzzy formal logics were introduced in order to handle graded truth values instead of only ‘true’ and ‘false’. A wide range of such logics were introduced successfully, li...
Bart Van Gasse, Chris Cornelis, Glad Deschrijver, ...