We show that feature logic extended by functional uncertainty is decidable, even if one admits cyclic descriptions. We present an algorithm, which solves feature descriptions cont...
Background: The indexing of scientific literature and content is a relevant and contemporary requirement within life science information systems. Navigating information available ...
Christopher J. O. Baker, Kanagasabai Rajaraman, We...
Presently, there is no specialized language for complex integrity constraints description in XML documents. In this paper we present a language that combines first-order logic toge...
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 ...