Sciweavers

3047 search results - page 71 / 610
» On the Meaning of Logical Completeness
Sort
View
WWW
2007
ACM
14 years 11 months ago
Just the right amount: extracting modules from ontologies
The ability to extract meaningful fragments from an ontology is key for ontology re-use. We propose a definition of a module that guarantees to completely capture the meaning of a...
Bernardo Cuenca Grau, Ian Horrocks, Yevgeny Kazako...
PADS
2005
ACM
14 years 4 months ago
Merging Parallel Simulation Programs
In earlier work cloning is proposed as a means for efficiently splitting a running simulation midway through its execution into multiple parallel simulations. In simulation cloni...
Abhishek Agarwal, Maria Hybinette
FLOPS
2008
Springer
14 years 14 days ago
Formalizing a Constraint Deductive Database Language Based on Hereditary Harrop Formulas with Negation
In this paper, we present an extension of the scheme HH(C) (Hereditary Harrop formulas with Constraints) with a suitable formulation of negation in order to obtain a constraint ded...
Susana Nieva, Jaime Sánchez-Hernánde...
CADE
2010
Springer
14 years 23 hour ago
Global Caching for Coalgebraic Description Logics
Coalgebraic description logics offer a common semantic umbrella for extensions of description logics with reasoning principles outside relational semantics, e.g. quantitative uncer...
Rajeev Goré, Clemens Kupke, Dirk Pattinson,...
INFORMATICALT
2007
111views more  INFORMATICALT 2007»
13 years 10 months ago
Sequent Calculi for Branching Time Temporal Logics of Knowledge and Belief
In this paper we consider branching time temporal logics of knowledge and belief. These logics involve the discrete time linear temporal logic operators “next” and “until” ...
Jurate Sakalauskaite