Sciweavers

2519 search results - page 263 / 504
» Reasoning with Textual Cases
Sort
View
CADE
2005
Springer
16 years 7 months ago
A Proof-Producing Decision Procedure for Real Arithmetic
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...
Sean McLaughlin, John Harrison
ESWS
2009
Springer
16 years 1 months ago
Relational Databases as Semantic Web Endpoints
This proposal explores the promotion of existing relational databases to Semantic Web Endpoints. It presents the benefits of ontologybased read and write access to existing relati...
Matthias Hert
ISIPTA
1999
IEEE
116views Mathematics» more  ISIPTA 1999»
15 years 11 months ago
On the Distribution of Natural Probability Functions
The purpose of this note is to describe the underlying insights and results obtained by the authors, and others, in a series of papers aimed at modelling the distribution of `natu...
Jeff B. Paris, Paul N. Watton, George M. Wilmers
AAAI
2008
15 years 9 months ago
An Architecture and Formalism for Handling Modular Ontologies
The goal of my ongoing work is to provide an architecture for developing and manipulating modular ontologies in such a way that each ontology module can plug into or unplug from a...
Faezeh Ensan
AAAI
1990
15 years 7 months ago
The Representation of Defaults in Cyc
This paper provides an account of the representation of defaults in Cyc and their semantics in terms of first order logic with reification. Default reasoning is a complex thing, a...
Ramanathan V. Guha