Sciweavers

441 search results - page 31 / 89
» Possibility theory and statistical reasoning
Sort
View
LACL
1998
Springer
13 years 12 months ago
Anaphora and Quantification in Categorial Grammar
Abstract. The paper proposes a type logical reformulation of Jacobson's ([9]) treatment of anaphoric dependencies in Categorial Grammar. To this end, the associative Lambek Ca...
Gerhard Jäger
ICLP
2010
Springer
13 years 11 months ago
Program analysis for code duplication in logic programs
Abstract. In this PhD project, we deal with the issue of code duplication in logic programs. In particular semantical duplication or redundancy is generally viewed as a possible se...
Celine Dandois
UAI
1989
13 years 8 months ago
Can Uncertainty Management be Realized in a Finite Totally Ordered Probability Algebra?
In this paper, the feasibility of using finite totally ordered probability models under Aleliunas’s Theory of Probabilistic Logic [Aleliunas, 1988] is investigated. The general...
Yang Xiang, Michael P. Beddoes, David Poole
CADE
2011
Springer
12 years 7 months ago
Experimenting with Deduction Modulo
Deduction modulo is a generic framework to describe proofs in a theory better than using raw axioms. This is done by presenting the theory through rules rewriting terms and proposi...
Guillaume Burel
ILP
2005
Springer
14 years 1 months ago
Generalization Behaviour of Alkemic Decision Trees
Abstract. This paper is concerned with generalization issues for a decision tree learner for structured data called Alkemy. Motivated by error bounds established in statistical lea...
Kee Siong Ng