Sciweavers

507 search results - page 92 / 102
» Automating first-order relational logic
Sort
View
DLOG
2004
13 years 8 months ago
A Uniform Tableaux-Based Approach to Concept Abduction and Contraction in ALN
We present algorithms based on truth-prefixed tableaux to solve both Concept Abduction and Contraction in ALN DL. We also analyze the computational complexity of the problems, sho...
Simona Colucci, Tommaso Di Noia, Eugenio Di Sciasc...
DLOG
2003
13 years 8 months ago
Implementing Matching in ALE--First Results
Matching problems in Description Logics are theoretically well understood, with a variety of algorithms available for different DLs. Nevertheless, still no implementation of a ge...
Sebastian Brandt
GIS
2010
ACM
13 years 5 months ago
Tolerance geometry: Euclid's first postulate for points and lines with extension
Object representation and reasoning in vector based geographic information systems (GIS) is based on Euclidean geometry. Euclidean geometry is built upon Euclid's first postu...
Gwen Wilke, Andrew U. Frank
CASES
2004
ACM
14 years 25 days ago
Balancing design options with Sherpa
Application specific processors offer the potential of rapidly designed logic specifically constructed to meet the performance and area demands of the task at hand. Recently, t...
Timothy Sherwood, Mark Oskin, Brad Calder
CSL
2010
Springer
13 years 8 months ago
From Feasible Proofs to Feasible Computations
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
Jan Krajícek