Sciweavers

2138 search results - page 250 / 428
» Logical Step-Indexed Logical Relations
Sort
View
LOPSTR
1998
Springer
15 years 10 months ago
Improving Homeomorphic Embedding for Online Termination
Well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure online termination of program analysis, specialisation and transformation t...
Michael Leuschel
ECAI
2006
Springer
15 years 10 months ago
Background Default Knowledge and Causality Ascriptions
A model is defined that predicts an agent's ascriptions of causality (and related notions of facilitation and justification) between two events in a chain, based on background...
Jean-François Bonnefon, Rui Da Silva Neves,...
KRDB
2003
121views Database» more  KRDB 2003»
15 years 8 months ago
Knowledge Representation using Schema Tuple Queries
This paper introduces schema tuple queries and argues for their suitability in representing knowledge over standard relational databases. Schema tuple queries are queries that ret...
Michael Minock
FOSSACS
2009
Springer
16 years 1 months ago
Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....
Lars Birkedal, Kristian Støvring, Jacob Tha...
KR
2000
Springer
15 years 10 months ago
Anytime Diagnostic Reasoning using Approximate Boolean Constraint Propagation
In contrast with classical reasoning, where a solution is either correct or incorrect, approximate reasoning tries to compute solutions which are close to the ideal solution, with...
Alan Verberne, Frank van Harmelen, Annette ten Tei...