Sciweavers

811 search results - page 11 / 163
» Probabilistic Semantics and Program Analysis
Sort
View
NMR
2004
Springer
14 years 23 days ago
Logic programs with annotated disjunctions
Current literature offers a number of different approaches to what could generally be called “probabilistic logic programming”. These are usually based on Horn clauses. Here, ...
Joost Vennekens, Sofie Verbaeten, Maurice Bruynoog...
CORR
2011
Springer
174views Education» more  CORR 2011»
12 years 11 months ago
Parameter Learning of Logic Programs for Symbolic-Statistical Modeling
We propose a logical/mathematical framework for statistical parameter learning of parameterized logic programs, i.e. de nite clause programs containing probabilistic facts with a ...
Yoshitaka Kameya, Taisuke Sato
ICLP
2010
Springer
13 years 11 months ago
Tabling and Answer Subsumption for Reasoning on Logic Programs with Annotated Disjunctions
Probabilistic Logic Programming is an active field of research, with many proposals for languages, semantics and reasoning algorithms. One such proposal, Logic Programming with A...
Fabrizio Riguzzi, Terrance Swift
RTA
2010
Springer
13 years 11 months ago
A Rewriting Logic Semantics Approach to Modular Program Analysis
The K framework, based on rewriting logic semantics, provides a powerful logic for defining the semantics of programming languages. While most work in this area has focused on de...
Mark Hills, Grigore Rosu
KDD
2005
ACM
180views Data Mining» more  KDD 2005»
14 years 27 days ago
Information retrieval based on collaborative filtering with latent interest semantic map
In this paper, we propose an information retrieval model called Latent Interest Semantic Map (LISM), which features retrieval composed of both Collaborative Filtering(CF) and Prob...
Noriaki Kawamae, Katsumi Takahashi