3773 search results - page 339 / 755 » Logical Reasoning |
196
click to vote
CADE
2000
Springer
15 years 11 months ago
2000
Springer
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 ...
193
click to vote
AAAI
2007
15 years 9 months ago
2007
Description Logics, and in particular the web ontology language OWL has been proposed as an appropriate basis for computing matches between structured objects for the sake of info...
183
click to vote
CADE
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Automated theorem provers (ATPs) struggle to solve problems with large sets of possibly superfluous axiom. Several algorithms have been developed to reduce the number of ...
181
click to vote
CALCO
2005
Springer
16 years 9 days ago
2005
Springer
We show that any institution I satisfying some reasonable conditions can be transformed into another institution, Ibeh, which captures formally and abstractly the intuitions of add...
237
click to vote
IDA
2005
Springer
16 years 8 days ago
2005
Springer
Abstract. This paper introduces Higher-Order Bayesian Networks, a probabilistic reasoning formalism which combines the efficient reasoning mechanisms of Bayesian Networks with the...