Sciweavers

579 search results - page 9 / 116
» Combined reasoning by automated cooperation
Sort
View
LPAR
2004
Springer
14 years 1 months ago
The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs
The dependency pair approach is one of the most powerful techniques for automated termination proofs of term rewrite systems. Up to now, it was regarded as one of several possible ...
Jürgen Giesl, René Thiemann, Peter Sch...
CADE
2006
Springer
14 years 9 months ago
A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL
The nominal datatype package implements an infrastructure in Isabelle/HOL for defining languages involving binders and for reasoning conveniently about alpha-equivalence classes. P...
Christian Urban, Stefan Berghofer
ERCIMDL
2006
Springer
204views Education» more  ERCIMDL 2006»
14 years 8 days ago
Comparing and Combining Two Approaches to Automated Subject Classification of Text
A machine-learning and a string-matching approach to automated subject classification of text were compared, as to their performance, advantages and downsides. The former approach ...
Koraljka Golub, Anders Ardö, Dunja Mladenic, ...
RR
2007
Springer
14 years 2 months ago
A Framework for Combining Rules and Geo-ontologies
Geo-ontologies have a key role to play in the development of the geospatial-semantic web, with regard to facilitating the search for geographical information and resources. They no...
Philip D. Smart, Alia I. Abdelmoty, Baher A. El-Ge...
ICLP
2007
Springer
14 years 14 days ago
Combining OWL with F-Logic Rules and Defaults
We describe the combination of OWL and F-Logic for the architecture of Semantic Web application nodes. The approach has been implemented by combining an existing Jena-based archite...
Heiko Kattenstroth, Wolfgang May, Franz Schenk