Sciweavers

7988 search results - page 81 / 1598
» A Useful Undecidable Theory
Sort
View
ICPR
2006
IEEE
14 years 3 months ago
A fusion methodology based on Dempster-Shafer evidence theory for two biometric applications
Different features carry more or less rich and varied pieces of information to characterize a pattern. The fusion of these different sources of information can provide an opportun...
Muhammad Arif, Thierry Brouard, Nicole Vincent
FOSSACS
2005
Springer
14 years 2 months ago
A Simpler Proof Theory for Nominal Logic
Abstract. Nominal logic is a variant of first-order logic equipped with a “freshname quantifier” N and other features useful for reasoning about languages with bound names. I...
James Cheney
LFCS
2009
Springer
14 years 1 months ago
A Bialgebraic Approach to Automata and Formal Language Theory
A bialgebra is a structure which is simultaneously an algebra and a coalgebra, such that the algebraic and coalgebraic parts are compatible. Bialgebras are usually studied over a ...
James Worthington
TPHOL
1999
IEEE
14 years 1 months ago
Universal Algebra in Type Theory
We present a development of Universal Algebra inside Type Theory, formalized using the proof assistant Coq. We define the notion of a signature and of an algebra over a signature. ...
Venanzio Capretta
WSPI
2004
13 years 10 months ago
A Formal Theory of Conceptual Modeling Universals
Conceptual Modeling is a discipline of great relevance to several areas in Computer Science. In a series of papers [1,2,3] we have been using the General Ontological Language (GOL)...
Giancarlo Guizzardi, Gerd Wagner, Marten van Sinde...