Sciweavers

214 search results - page 20 / 43
» Optimisation of Terminological Reasoning
Sort
View
FOIKS
2006
Springer
14 years 8 days ago
Reasoning Support for Expressive Ontology Languages Using a Theorem Prover
It is claimed in [45] that first-order theorem provers are not efficient for reasoning with ontologies based on description logics compared to specialised description logic reasone...
Ian Horrocks, Andrei Voronkov
ASIACRYPT
2009
Springer
14 years 3 months ago
Secure Two-Party Computation Is Practical
Abstract. Secure multi-party computation has been considered by the cryptographic community for a number of years. Until recently it has been a purely theoretical area, with few im...
Benny Pinkas, Thomas Schneider, Nigel P. Smart, St...
ICLP
2003
Springer
14 years 1 months ago
On Deterministic Computations in the Extended Andorra Model
Logic programming is based on the idea that computation is controlled inference. The Extended Andorra Model provides a very powerful framework that supports both co-routining and p...
Ricardo Lopes, Vítor Santos Costa, Fernando...
PERCOM
2006
ACM
14 years 8 months ago
Pushing Doors for Modeling Contexts with OWL DL a Case Study
In this paper we present an integrated view for modeling and reasoning for context applications using OWL DL. In our case study, we describe a task driven approach to model typica...
Anni-Yasmin Turhan, Thomas Springer, Michael Berge...
CSL
2010
Springer
13 years 9 months ago
Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic
Abstract. We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be d...
Damien Pous