Sciweavers

226 search results - page 20 / 46
» Extensional Theories and Rewriting
Sort
View
FROCOS
2005
Springer
14 years 2 months ago
A Comprehensive Framework for Combined Decision Procedures
We define a general notion of a fragment within higher order type theory; a procedure for constraint satisfiability in combined fragments is outlined, following Nelson-Oppen sche...
Silvio Ghilardi, Enrica Nicolini, Daniele Zucchell...
GISCIENCE
2008
Springer
145views GIS» more  GISCIENCE 2008»
13 years 10 months ago
Similarity-Based Information Retrieval and Its Role within Spatial Data Infrastructures
While similarity has gained in importance in research about information retrieval on the (geospatial) semantic Web, information retrieval paradigms and their integration into exist...
Krzysztof Janowicz, Marc Wilkes, Michael Lutz
JANCL
2006
123views more  JANCL 2006»
13 years 8 months ago
Approximate databases: a support tool for approximate reasoning
This paper describes an experimental platform for approximate knowledge databases called the Approximate Knowledge Database (AKDB), based on a semantics inspired by rough sets. The...
Patrick Doherty, Martin Magnusson, Andrzej Szalas
ENTCS
2002
128views more  ENTCS 2002»
13 years 8 months ago
Rewriting Calculus with(out) Types
The last few years have seen the development of a new calculus which can be considered as an outcome of the last decade of various researches on (higher order) term rewriting syst...
Horatiu Cirstea, Claude Kirchner, Luigi Liquori
RTA
2004
Springer
14 years 2 months ago
TORPA: Termination of Rewriting Proved Automatically
Abstract. In this paper it is described how a combination of polynomial interpretations, recursive path order, RFC match-bounds, the dependency pair method and semantic labelling c...
Hans Zantema