Sciweavers

38 search results - page 2 / 8
» Axiomatizability of representable domain algebras
Sort
View
AI
2008
Springer
13 years 4 months ago
MEBN: A language for first-order Bayesian knowledge bases
Although classical first-order logic is the de facto standard logical foundation for artificial intelligence, the lack of a built-in, semantically grounded capability for reasonin...
Kathryn B. Laskey
IMAMS
2007
157views Mathematics» more  IMAMS 2007»
13 years 7 months ago
Regularity Criteria for the Topology of Algebraic Curves and Surfaces
In this paper, we consider the problem of analysing the shape of an object defined by polynomial equations in a domain. We describe regularity criteria which allow us to determine...
Lionel Alberti, Bernard Mourrain
DATE
2009
IEEE
120views Hardware» more  DATE 2009»
14 years 1 months ago
Optimizing data flow graphs to minimize hardware implementation
Abstract - This paper describes an efficient graphbased method to optimize data-flow expressions for best hardware implementation. The method is based on factorization, common su...
Daniel Gomez-Prado, Q. Ren, Maciej J. Ciesielski, ...
FUIN
2006
103views more  FUIN 2006»
13 years 6 months ago
A Categorical View on Algebraic Lattices in Formal Concept Analysis
Formal concept analysis has grown from a new branch of the mathematical field of lattice theory to a widely recognized tool in Computer Science and elsewhere. In order to fully be...
Pascal Hitzler, Markus Krötzsch, Guo-Qiang Zh...
PARA
2004
Springer
13 years 11 months ago
A Domain Theoretic Account of Euler's Method for Solving Initial Value Problems
Abstract. This paper presents a method of solving initial value problems using Euler’s method, based on the domain of interval valued functions of a real variable. In contrast to...
Abbas Edalat, Dirk Pattinson