Sciweavers

1717 search results - page 239 / 344
» A Computable Spectral Theorem
Sort
View
SEMWEB
2004
Springer
15 years 10 months ago
A Model Theoretic Semantics for Ontology Versioning
Abstract. We show that the Semantic Web needs a formal semantics for the various kinds of links between ontologies and other documents. We provide a model theoretic semantics that ...
Jeff Heflin, Zhengxiang Pan
CP
2003
Springer
15 years 10 months ago
Propagation Redundancy in Redundant Modelling
Combining mutually redundant models with channelling constraints increases constraint propagation. However, the extra computation efforts of the additional variables and constraint...
Chiu Wo Choi, Jimmy Ho-Man Lee, Peter J. Stuckey
ASM
2010
ASM
15 years 10 months ago
Formal Probabilistic Analysis: A Higher-Order Logic Based Approach
Traditionally, simulation is used to perform probabilistic analysis. However, it provides less accurate results and cannot handle large-scale problems due to the enormous CPU time ...
Osman Hasan, Sofiène Tahar
KR
2010
Springer
15 years 10 months ago
Towards Fixed-Parameter Tractable Algorithms for Argumentation
Abstract argumentation frameworks have received a lot of interest in recent years. Most computational problems in this area are intractable but several tractable fragments have be...
Wolfgang Dvorák, Reinhard Pichler, Stefan W...
LPAR
2001
Springer
15 years 10 months ago
A Local System for Classical Logic
Abstract. The calculus of structures is a framework for specifying logical systems, which is similar to the one-sided sequent calculus but more general. We present a system of infe...
Kai Brünnler, Alwen Fernanto Tiu