Sciweavers

977 search results - page 28 / 196
» Logic programming with infinite sets
Sort
View
CVPR
2012
IEEE
13 years 2 months ago
A grammar for hierarchical object descriptions in logic programs
Modeling objects using formal grammars has recently regained much attention in computer vision. Probabilistic logic programming, such as Bilattice based Logical Reasoning (BLR), i...
Toufiq Parag, Claus Bahlmann, Vinay D. Shet, Manee...
ACL
2012
13 years 2 months ago
Learning to "Read Between the Lines" using Bayesian Logic Programs
Most information extraction (IE) systems identify facts that are explicitly stated in text. However, in natural language, some facts are implicit, and identifying them requires â€...
Sindhu Raghavan, Raymond J. Mooney, Hyeonseo Ku
99
Voted
CSL
2006
Springer
15 years 4 months ago
Game Quantification on Automatic Structures and Hierarchical Model Checking Games
Game quantification is an expressive concept and has been studied in model theory and descriptive set theory, especially in relation to infinitary logics. Automatic structures on t...
Lukasz Kaiser
LICS
2010
IEEE
14 years 10 months ago
Recursion Schemes and Logical Reflection
Let R be a class of generators of node-labelled infinite trees, and L be a logical language for describing correctness properties of these trees. Given R R and L, we say that R ...
Christopher H. Broadbent, Arnaud Carayol, C.-H. Lu...
88
Voted
AAAI
1990
15 years 1 months ago
Operationality Criteria for Recursive Predicates
Current explanation-based generalization (EBG) techniques can perform badly when the problem being solved involves recursion. Often an infinite series of learned concepts are gene...
Stanley Letovsky