Sciweavers

5818 search results - page 966 / 1164
» A reasonable Semantic Web
Sort
View
JAIR
2010
111views more  JAIR 2010»
15 years 5 months ago
Grounding FO and FO(ID) with Bounds
Grounding is the task of reducing a first-order theory and finite domain to an equivalent propositional theory. It is used as preprocessing phase in many logic-based reasoning s...
Johan Wittocx, Maarten Mariën, Marc Denecker
RR
2010
Springer
15 years 5 months ago
A Probabilistic Abduction Engine for Media Interpretation Based on Ontologies
For multimedia interpretation, and in particular for the combined interpretation of information coming from different modalities, a semantically well-founded formalization is requ...
Oliver Gries, Ralf Möller, Anahita Nafissi, M...
LPAR
2010
Springer
15 years 4 months ago
Verifying Pointer and String Analyses with Region Type Systems
Pointer analysis statically approximates the heap pointer structure during a program execution in order to track heap objects or to establish alias relations between references, a...
Lennart Beringer, Robert Grabowski, Martin Hofmann
195
Voted
CACM
2010
121views more  CACM 2010»
15 years 4 months ago
Goldilocks: a race-aware Java runtime
We present Goldilocks, a Java runtime that monitors program executions and throws a DataRaceException when a data race is about to occur. This prevents racy accesses from taking p...
Tayfun Elmas, Shaz Qadeer, Serdar Tasiran
CORR
2011
Springer
153views Education» more  CORR 2011»
15 years 1 months ago
Proof-Theoretic Soundness and Completeness
We give a calculus for reasoning about the first-order fragment of classical logic that is adequate for giving the truth conditions of intuitionistic Kripke frames, and outline a...
Robert Rothenberg