Sciweavers

25 search results - page 3 / 5
» Logical Foundations of (e)RDF(S): Complexity and Reasoning
Sort
View
86
Voted
JELIA
1998
Springer
15 years 2 months ago
A Logic for Anytime Deduction and Anytime Compilation
Abstract. One of the maincharacteristics of logical reasoning in knowledge based systems is its high computational complexity. Anytime deduction and anytime compilation are two att...
Frédéric Koriche
90
Voted
KI
2008
Springer
14 years 10 months ago
Shallow Models for Non-iterative Modal Logics
Abstract. Modal logics see a wide variety of applications in artificial intelligence, e.g. in reasoning about knowledge, belief, uncertainty, agency, defaults, and relevance. From ...
Lutz Schröder, Dirk Pattinson
67
Voted
LPAR
2010
Springer
14 years 8 months ago
On the Complexity of Model Expansion
Abstract. We study the complexity of model expansion (MX), which is the problem of expanding a given finite structure with additional relations to produce a finite model of a giv...
Antonina Kolokolova, Yongmei Liu, David G. Mitchel...
81
Voted
CSL
2010
Springer
14 years 11 months ago
Quantified Differential Dynamic Logic for Distributed Hybrid Systems
Abstract. We address a fundamental mismatch between the combinations of dynamics that occur in complex physical systems and the limited kinds of dynamics supported in analysis. Mod...
André Platzer
LOGCOM
2007
130views more  LOGCOM 2007»
14 years 10 months ago
A Logic for Concepts and Similarity
Categorisation of objects into classes is currently supported by (at least) two ‘orthogonal’ methods. In logic-based approaches, classifications are defined through ontologi...
Mikhail Sheremet, Dmitry Tishkovsky, Frank Wolter,...