Sciweavers

409 search results - page 30 / 82
» Semantics for a theory of defeasible reasoning
Sort
View
POPL
2006
ACM
16 years 2 months ago
Fast and loose reasoning is morally correct
Functional programmers often reason about programs as if they were written in a total language, expecting the results to carry over to non-total (partial) languages. We justify su...
Nils Anders Danielsson, John Hughes, Patrik Jansso...
SEMWEB
2009
Springer
15 years 8 months ago
Axiomatic First-Order Probability
Most languages for the Semantic Web have their logical basis in some fragment of first-order logic. Thus, integrating first-order logic with probability is fundamental for represen...
Kathryn B. Laskey
ISBI
2008
IEEE
15 years 8 months ago
Multimodal medical case retrieval using Bayesian networks and the Dezert-Smarandache theory
In this paper, we present a Case Based Reasoning (CBR) system for the retrieval of medical cases made up of a series of images with semantic information (such as the patient age, ...
Gwénolé Quellec, Mathieu Lamard, Lyn...
FASE
2010
Springer
15 years 8 months ago
Proving Consistency and Completeness of Model Classes Using Theory Interpretation
Abstract. Abstraction is essential in the formal specification of programs. A common way of writing abstract specifications is to specify implementations in terms of basic mathem...
Ádám Darvas, Peter Müller
TLDI
2009
ACM
169views Formal Methods» more  TLDI 2009»
15 years 10 months ago
Relational parametricity for references and recursive types
We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...
Lars Birkedal, Kristian Støvring, Jacob Tha...