Sciweavers

63 search results - page 10 / 13
» Vivid Knowledge and Tractable Reasoning
Sort
View
IADIS
2004
13 years 11 months ago
OWL DL: description logic's syntactic variant for the semantic web
OWL DL, being established by W3C, is a Knowledge Representation Markup Language for the Semantic Web. OWL DL is a new synthesis of research on KRML for the Semantic Web, which nee...
Wei Ming Zhang, Jun-feng Song
FOSSACS
2007
Springer
14 years 4 months ago
Polynomial Constraints for Sets with Cardinality Bounds
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
Bruno Marnette, Viktor Kuncak, Martin C. Rinard
AMW
2010
13 years 11 months ago
Query Rewriting under Non-Guarded Rules
We address the problem of answering conjunctive queries over knowledge bases, specified by sets of first-order sentences called tuple-generating dependencies (TGDs). This problem i...
Andrea Calì, Georg Gottlob, Andreas Pieris
DLOG
2011
13 years 1 months ago
Dependencies to Optimize Ontology Based Data Access
Query answering in Ontology Based Data Access (OBDA) exploits the knowledge of an ontology’s TBox to deal with incompleteness of the ABox (or data source). Current query-answerin...
Mariano Rodriguez-Muro, Diego Calvanese
LICS
1999
IEEE
14 years 2 months ago
Proof Techniques for Cryptographic Processes
Contextual equivalences for cryptographic process calculi, like the spi-calculus, can be used to reason about correctness of protocols, but their definition suffers from quantific...
Michele Boreale, Rocco De Nicola, Rosario Pugliese