Sciweavers

102 search results - page 6 / 21
» Reformulation for Extensional Reasoning
Sort
View
CSL
2001
Springer
14 years 3 days ago
Uniform Derivation of Decision Procedures by Superposition
We show how a well-known superposition-based inference system for first-order equational logic can be used almost directly as a decision procedure for various theories including l...
Alessandro Armando, Silvio Ranise, Michaël Ru...
AIIA
2005
Springer
13 years 9 months ago
Periodicity-Based Temporal Constraints
We propose a framework for performing extensional and intensional temporal reasoning about qualitative and quantitative “periodicity-dependent” temporal constraints between rep...
Paolo Terenziani, Luca Anselma, Stefania Montani
EON
2007
13 years 9 months ago
Benchmarking Reasoners for Multi-Ontology Applications
We describe an approach to create a synthetic workload for large scale extensional query answering experiments. The workload comprises multiple interrelated domain ontologies, data...
Ameet Chitnis, Abir Qasem, Jeff Heflin
JANCL
2006
123views more  JANCL 2006»
13 years 7 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
SIAMJO
2002
115views more  SIAMJO 2002»
13 years 7 months ago
Superlinearly Convergent Algorithms for Solving Singular Equations and Smooth Reformulations of Complementarity Problems
We propose a new algorithm for solving smooth nonlinear equations in the case where their solutions can be singular. Compared to other techniques for computing singular solutions, ...
Alexey F. Izmailov, Mikhail V. Solodov