Sciweavers

60 search results - page 12 / 12
» Algebraic tableau reasoning for the description logic SHOQ
Sort
View
102
Voted
FOIS
2006
15 years 1 months ago
Approximation of Ontologies in CASL
In this paper we present methods to generate a Description Logic (DL) theory from a given First Order Logic (FOL) theory, such that each DL axiom is entailed by the given FOL theor...
Klaus Lüttich
103
Voted
CADE
2005
Springer
15 years 12 months ago
An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
IJCAI
1993
15 years 28 days ago
A New Logical framework for Deductive Planning
objects, like elements of (abstract) data types in ordinary programming languages In the theory of abstract data types most often one only considers algebraic structures where all ...
Werner Stephan, Susanne Biundo
DEXAW
2007
IEEE
128views Database» more  DEXAW 2007»
15 years 3 months ago
Sharing Data on the Grid using Ontologies and distributed SPARQL Queries
The vision of the Semantic Web is to make Web content machine-readable. To describe data, the Resource Description Framework has been extended with a schema-level and description ...
Andreas Langegger, Martin Blöchl, Wolfram W&o...
102
Voted
DAC
2007
ACM
16 years 18 days ago
Progressive Decomposition: A Heuristic to Structure Arithmetic Circuits
Despite the impressive progress of logic synthesis in the past decade, finding the best architecture for a given circuit still remains an open problem and largely unsolved. In mos...
Ajay K. Verma, Philip Brisk, Paolo Ienne