Sciweavers

2432 search results - page 124 / 487
» Cryptographic logical relations
Sort
View
124
Voted
ILP
2004
Springer
15 years 6 months ago
Macro-Operators Revisited in Inductive Logic Programming
For the last ten years a lot of work has been devoted to propositionalization techniques in relational learning. These techniques change the representation of relational problems t...
Érick Alphonse
114
Voted
LOGCOM
2007
91views more  LOGCOM 2007»
15 years 16 days ago
A New Modal Approach to the Logic of Intervals
In Artificial Intelligence there is a need for reasoning about continuous processes, where assertions refer to time intervals rather than time points. Taking our lead from van Ben...
Altaf Hussain
83
Voted
APAL
2008
87views more  APAL 2008»
15 years 24 days ago
Characterising nested database dependencies by fragments of propositional logic
We extend the earlier results on the equivalence between the Boolean and the multivalued dependencies in relational databases and fragments of the Boolean propositional logic. It ...
Sven Hartmann, Sebastian Link
97
Voted
ICML
2009
IEEE
16 years 1 months ago
Learning Markov logic network structure via hypergraph lifting
Markov logic networks (MLNs) combine logic and probability by attaching weights to first-order clauses, and viewing these as templates for features of Markov networks. Learning ML...
Stanley Kok, Pedro Domingos
159
Voted
AAAI
2011
14 years 20 days ago
Markov Logic Sets: Towards Lifted Information Retrieval Using PageRank and Label Propagation
Inspired by “GoogleTM Sets” and Bayesian sets, we consider the problem of retrieving complex objects and relations among them, i.e., ground atoms from a logical concept, given...
Marion Neumann, Babak Ahmadi, Kristian Kersting