Sciweavers

130 search results - page 6 / 26
» A Logical Study of Partial Entailment
Sort
View
ICFP
2008
ACM
14 years 7 months ago
Type checking with open type functions
We report on an extension of Haskell with open type-level functions and equality constraints that unifies earlier work on GADTs, functional dependencies, and associated types. The...
Tom Schrijvers, Simon L. Peyton Jones, Manuel M. T...
SUM
2007
Springer
14 years 1 months ago
Finding Most Probable Worlds of Probabilistic Logic Programs
Abstract. Probabilistic logic programs have primarily studied the problem of entailment of probabilistic atoms. However, there are some interesting applications where we are intere...
Samir Khuller, Maria Vanina Martinez, Dana S. Nau,...
DEXAW
2000
IEEE
74views Database» more  DEXAW 2000»
13 years 11 months ago
Retrieval Situations and Belief Change
Situational aspects are very helpful to decide relevance but they have often been left aside by Information Retrieval models. The standard logical approach to Information Retrieva...
David E. Losada, Alvaro Barreiro
AML
1998
60views more  AML 1998»
13 years 7 months ago
A restricted computation model on Scott domains and its partial primitive recursive functionals
The paper builds on both a simply typed term system PRω and a computation model on Scott domains via so-called parallel typed while programs (PTWP). The former provides a notion ...
Karl-Heinz Niggl
ICMLA
2007
13 years 8 months ago
Learning to evaluate conditional partial plans
In our research we study rational agents which learn how to choose the best conditional, partial plan in any situation. The agent uses an incomplete symbolic inference engine, emp...
Slawomir Nowaczyk, Jacek Malec