Sciweavers

670 search results - page 9 / 134
» Modeling generalized implicatures using non-monotonic logics
Sort
View
ICDT
1990
ACM
110views Database» more  ICDT 1990»
13 years 11 months ago
Beginnings of a Theory of General Database Completions
Ordinary logical implication is not enough for answering queries in a logic database, since especially negative information is only implicitly represented in the database state. M...
Stefan Brass
ECIR
1998
Springer
13 years 8 months ago
Modeling Information Retrieval with Probabilistic Argumentation Systems
Probabilistic Argumentation Systems (PAS) are a technique for representing uncertainty both symbolically and numerically. It is shown that this technique, which combines symbolic ...
Justin Picard, Rolf Haenni
AIMSA
2000
Springer
13 years 11 months ago
Least Generalization under Relative Implication
Inductive Logic Programming (ILP) deals with inducing clausal theories from examples basically through generalization or specialization. The specialization and generalization oper...
Svetla Boytcheva
FOSSACS
2009
Springer
14 years 2 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...
FLAIRS
2008
13 years 9 months ago
A New Approach to Model-Based Diagnosis Using Probabilistic Logic
We describe a new approach to model construction using transfer function diagrams that are consequently mapped into generalized loopy logic, a first-order, Turing-complete stochas...
Nikita A. Sakhanenko, Roshan Rammohan, George F. L...