2196 search results - page 135 / 440 » Practical Reasoning Using Values |
167
click to vote
CADE
1998
Springer
15 years 6 months ago
1998
Springer
Partial types allow the reasoning about partial functions in type theory. The partial functions of main interest are recursively computed functions, which are commonly assigned ty...
163
Voted
OWLED
2007
15 years 3 months ago
2007
There are many query languages (QLs) that can be used to query RDF and OWL ontologies but neither type is satisfactory for querying OWL-DL ontologies. RDF-based QLs (RDQL, SeRQL, S...
119
Voted
CSL
2006
Springer
15 years 6 months ago
2006
Springer
The goal of this note is to provide a background and references for the invited lecture presented at Computer Science Logic 2006. We briefly discuss motivations that led to the eme...
128
click to vote
JCST
2010
14 years 9 months ago
2010
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
115
click to vote
ILP
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We study predicate selection functions (also known as splitting rules) for structural decision trees and propose two improvements to existing schemes. The first is in cl...