2308 search results - page 362 / 462 » Representing Symbolic Reasoning |
147
click to vote
CIE
2005
Springer
15 years 12 months ago
2005
Springer
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Potts and Edalat [1]. We choose the constructive type theory as our formal verification t...
210
click to vote
DALT
2005
Springer
15 years 12 months ago
2005
Springer
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
150
click to vote
ECSQARU
2005
Springer
15 years 12 months ago
2005
Springer
In this paper we explore the use of several types of structural restrictions within algorithms for learning Bayesian networks. These restrictions may codify expert knowledge in a g...
168
click to vote
ECSQARU
2005
Springer
15 years 12 months ago
2005
Springer
Conditional deduction in binary logic basically consists of deriving new statements from an existing set of statements and conditional rules. Modus Ponens, which is the classical e...
170
click to vote
ICLP
2005
Springer
15 years 12 months ago
2005
Springer
The Semantic Web is a rapidly growing research area aiming at the exchange of semantic information over the World Wide Web. The Semantic Web is built on top of RDF, an XML-based ex...