Sciweavers

268 search results - page 2 / 54
» Equivalence for the G3'-stable models semantics
Sort
View
LPNMR
2007
Springer
13 years 11 months ago
Yet Another Proof of the Strong Equivalence Between Propositional Theories and Logic Programs
Recently, the stable model semantics was extended to the syntax of arbitrary propositional formulas, which are beyond the traditional rule form. Cabalar and Ferraris, as well as Ca...
Joohyung Lee, Ravi Palla
ALT
2011
Springer
12 years 5 months ago
Semantic Communication for Simple Goals Is Equivalent to On-line Learning
Abstract. Previous works [11, 6] introduced a model of semantic communication between a “user” and a “server,” in which the user attempts to achieve a given goal for commun...
Brendan Juba, Santosh Vempala
LPNMR
2007
Springer
13 years 11 months ago
Alternative Characterizations for Program Equivalence under Answer-Set Semantics: Preliminary Report
Logic programs under answer-set semantics constitute an important tool for declarative problem solving. In recent years, two research issues received growing attention. On the one ...
Martin Gebser, Torsten Schaub, Hans Tompits, Stefa...
ER
2007
Springer
95views Database» more  ER 2007»
13 years 11 months ago
Providing Semantically Equivalent, Complete Views for Multilingual Access to Integrated Data
Today, there are several approaches supporting an integrated processing of XML and (object-)relational data sources. However, each of these approaches favors a single data model f...
Iryna Kozlova, Norbert Ritter, Martin Husemann
SIGIR
2003
ACM
13 years 10 months ago
On an equivalence between PLSI and LDA
Latent Dirichlet Allocation (LDA) is a fully generative approach to language modelling which overcomes the inconsistent generative semantics of Probabilistic Latent Semantic Index...
Mark Girolami, Ata Kabán