Sciweavers

1071 search results - page 133 / 215
» Modal Logics, Description Logics and Arithmetic Reasoning
Sort
View
ESWS
2007
Springer
15 years 4 months ago
Algorithms for Paraconsistent Reasoning with OWL
In an open, constantly changing and collaborative environment like the forthcoming Semantic Web, it is reasonable to expect that knowledge sources will contain noise and inaccuraci...
Yue Ma, Pascal Hitzler, Zuoquan Lin
CSL
2010
Springer
14 years 11 months ago
On the Computability of Region-Based Euclidean Logics
By a Euclidean logic, we understand a formal language whose variables range over subsets of Euclidean space, of some fixed dimension, and whose non-logical primitives have fixed me...
Yavor Nenov, Ian Pratt-Hartmann
AGP
2003
IEEE
15 years 3 months ago
Local Closed-World Assumptions for reasoning about Semantic Web data
Abstract The Semantic Web (SW) can be seen as abstract representation and exchange of data and metadata. Metadata is given in terms of data mark-up and reference to shared, Web-acc...
Elisa Bertino, Alessandro Provetti, Franco Salvett...
PPDP
2010
Springer
14 years 8 months ago
Type inference in intuitionistic linear logic
We study the type checking and type inference problems for intuitionistic linear logic: given a System F typed λ-term, (i) for an alleged linear logic type, determine whether the...
Patrick Baillot, Martin Hofmann
LICS
1999
IEEE
15 years 2 months ago
Counting and Addition Cannot Express Deterministic Transitive Closure
An important open question in complexity theory is whether the circuit complexity class TC0 is (strictly) weaker than LOGSPACE. This paper considers this question from the viewpoi...
Matthias Ruhl